java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:28:54,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:28:54,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:28:54,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:28:54,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:28:54,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:28:54,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:28:54,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:28:54,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:28:54,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:28:54,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:28:54,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:28:54,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:28:54,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:28:54,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:28:54,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:28:54,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:28:54,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:28:54,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:28:54,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:28:54,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:28:54,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:28:54,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:28:54,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:28:54,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:28:54,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:28:54,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:28:54,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:28:54,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:28:54,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:28:54,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:28:54,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:28:54,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:28:54,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:28:54,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:28:54,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:28:54,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:28:54,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:28:54,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:28:54,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:28:54,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:28:54,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:28:54,149 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:28:54,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:28:54,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:28:54,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:28:54,152 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:28:54,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:28:54,153 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:28:54,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:28:54,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:28:54,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:28:54,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:28:54,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:28:54,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:28:54,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:28:54,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:28:54,155 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:28:54,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:28:54,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:28:54,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:28:54,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:28:54,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:28:54,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:28:54,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:28:54,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:28:54,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:28:54,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:28:54,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:28:54,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:28:54,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:28:54,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:28:54,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:28:54,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:28:54,226 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:28:54,227 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:28:54,227 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/bist_cell.cil.c [2019-09-08 06:28:54,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15307d3f5/33b1e2851ffc4e0494892b234bf0b7d7/FLAGf15e68d25 [2019-09-08 06:28:54,766 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:28:54,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2019-09-08 06:28:54,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15307d3f5/33b1e2851ffc4e0494892b234bf0b7d7/FLAGf15e68d25 [2019-09-08 06:28:55,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15307d3f5/33b1e2851ffc4e0494892b234bf0b7d7 [2019-09-08 06:28:55,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:28:55,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:28:55,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:28:55,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:28:55,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:28:55,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:28:55" (1/1) ... [2019-09-08 06:28:55,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277c7fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55, skipping insertion in model container [2019-09-08 06:28:55,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:28:55" (1/1) ... [2019-09-08 06:28:55,211 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:28:55,253 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:28:55,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:28:55,464 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:28:55,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:28:55,620 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:28:55,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55 WrapperNode [2019-09-08 06:28:55,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:28:55,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:28:55,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:28:55,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:28:55,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55" (1/1) ... [2019-09-08 06:28:55,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55" (1/1) ... [2019-09-08 06:28:55,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55" (1/1) ... [2019-09-08 06:28:55,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55" (1/1) ... [2019-09-08 06:28:55,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55" (1/1) ... [2019-09-08 06:28:55,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55" (1/1) ... [2019-09-08 06:28:55,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55" (1/1) ... [2019-09-08 06:28:55,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:28:55,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:28:55,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:28:55,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:28:55,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-08 06:28:55,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:28:55,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:28:55,726 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:28:55,726 INFO L138 BoogieDeclarations]: Found implementation of procedure method1 [2019-09-08 06:28:55,726 INFO L138 BoogieDeclarations]: Found implementation of procedure is_method1_triggered [2019-09-08 06:28:55,727 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b0 [2019-09-08 06:28:55,727 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b1 [2019-09-08 06:28:55,727 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d0 [2019-09-08 06:28:55,727 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d1 [2019-09-08 06:28:55,727 INFO L138 BoogieDeclarations]: Found implementation of procedure update_z [2019-09-08 06:28:55,727 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:28:55,728 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:28:55,728 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:28:55,728 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:28:55,728 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:28:55,728 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:28:55,728 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:28:55,729 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:28:55,729 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:28:55,729 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:28:55,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:28:55,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:28:55,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:28:55,730 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:28:55,730 INFO L130 BoogieDeclarations]: Found specification of procedure method1 [2019-09-08 06:28:55,730 INFO L130 BoogieDeclarations]: Found specification of procedure is_method1_triggered [2019-09-08 06:28:55,730 INFO L130 BoogieDeclarations]: Found specification of procedure update_b0 [2019-09-08 06:28:55,730 INFO L130 BoogieDeclarations]: Found specification of procedure update_b1 [2019-09-08 06:28:55,731 INFO L130 BoogieDeclarations]: Found specification of procedure update_d0 [2019-09-08 06:28:55,731 INFO L130 BoogieDeclarations]: Found specification of procedure update_d1 [2019-09-08 06:28:55,731 INFO L130 BoogieDeclarations]: Found specification of procedure update_z [2019-09-08 06:28:55,731 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:28:55,731 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:28:55,731 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:28:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:28:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:28:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:28:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:28:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:28:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:28:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:28:55,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:28:55,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:28:55,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:28:56,253 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:28:56,254 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 06:28:56,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:28:56 BoogieIcfgContainer [2019-09-08 06:28:56,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:28:56,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:28:56,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:28:56,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:28:56,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:28:55" (1/3) ... [2019-09-08 06:28:56,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddb4267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:28:56, skipping insertion in model container [2019-09-08 06:28:56,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:55" (2/3) ... [2019-09-08 06:28:56,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddb4267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:28:56, skipping insertion in model container [2019-09-08 06:28:56,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:28:56" (3/3) ... [2019-09-08 06:28:56,263 INFO L109 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2019-09-08 06:28:56,273 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:28:56,281 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:28:56,297 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:28:56,328 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:28:56,328 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:28:56,329 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:28:56,329 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:28:56,329 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:28:56,329 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:28:56,329 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:28:56,329 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:28:56,330 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:28:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-09-08 06:28:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 06:28:56,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:56,362 INFO L399 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] [2019-09-08 06:28:56,365 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash -778963544, now seen corresponding path program 1 times [2019-09-08 06:28:56,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:56,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:56,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:56,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:28:56,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:28:56,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:28:56,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:28:56,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:28:56,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:28:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:28:56,735 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2019-09-08 06:28:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:56,994 INFO L93 Difference]: Finished difference Result 265 states and 367 transitions. [2019-09-08 06:28:56,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:28:56,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-08 06:28:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:57,011 INFO L225 Difference]: With dead ends: 265 [2019-09-08 06:28:57,012 INFO L226 Difference]: Without dead ends: 134 [2019-09-08 06:28:57,017 INFO L628 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 [2019-09-08 06:28:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-08 06:28:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-09-08 06:28:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-08 06:28:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2019-09-08 06:28:57,111 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 58 [2019-09-08 06:28:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:57,114 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2019-09-08 06:28:57,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:28:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2019-09-08 06:28:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 06:28:57,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:57,130 INFO L399 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] [2019-09-08 06:28:57,131 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:57,131 INFO L82 PathProgramCache]: Analyzing trace with hash -820467770, now seen corresponding path program 1 times [2019-09-08 06:28:57,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:57,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:57,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:57,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:28:57,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 06:28:57,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:57,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:28:57,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:28:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:57,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:28:57,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 06:28:57,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:57,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-08 06:28:57,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:28:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:28:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:28:57,697 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand 8 states. [2019-09-08 06:28:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:58,766 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2019-09-08 06:28:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:28:58,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2019-09-08 06:28:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:58,772 INFO L225 Difference]: With dead ends: 429 [2019-09-08 06:28:58,772 INFO L226 Difference]: Without dead ends: 313 [2019-09-08 06:28:58,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:28:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-08 06:28:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 293. [2019-09-08 06:28:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-08 06:28:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 402 transitions. [2019-09-08 06:28:58,818 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 402 transitions. Word has length 125 [2019-09-08 06:28:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:58,819 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 402 transitions. [2019-09-08 06:28:58,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:28:58,819 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 402 transitions. [2019-09-08 06:28:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 06:28:58,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:58,823 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:58,824 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1914765000, now seen corresponding path program 1 times [2019-09-08 06:28:58,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:58,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:58,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:58,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:28:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 06:28:58,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:58,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:28:58,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:28:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:59,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:28:59,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:28:59,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:59,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-08 06:28:59,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:28:59,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:28:59,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:28:59,193 INFO L87 Difference]: Start difference. First operand 293 states and 402 transitions. Second operand 8 states. [2019-09-08 06:29:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:00,604 INFO L93 Difference]: Finished difference Result 1253 states and 1967 transitions. [2019-09-08 06:29:00,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 06:29:00,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2019-09-08 06:29:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:00,617 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 06:29:00,617 INFO L226 Difference]: Without dead ends: 983 [2019-09-08 06:29:00,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-09-08 06:29:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-09-08 06:29:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 809. [2019-09-08 06:29:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-09-08 06:29:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1125 transitions. [2019-09-08 06:29:00,743 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1125 transitions. Word has length 127 [2019-09-08 06:29:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:00,744 INFO L475 AbstractCegarLoop]: Abstraction has 809 states and 1125 transitions. [2019-09-08 06:29:00,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:29:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1125 transitions. [2019-09-08 06:29:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 06:29:00,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:00,751 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:00,752 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:00,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:00,752 INFO L82 PathProgramCache]: Analyzing trace with hash -719225028, now seen corresponding path program 1 times [2019-09-08 06:29:00,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:00,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:00,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 06:29:00,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:00,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:00,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:01,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:29:01,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 06:29:01,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:01,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-09-08 06:29:01,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:29:01,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:29:01,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:29:01,093 INFO L87 Difference]: Start difference. First operand 809 states and 1125 transitions. Second operand 9 states. [2019-09-08 06:29:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:03,180 INFO L93 Difference]: Finished difference Result 3139 states and 5103 transitions. [2019-09-08 06:29:03,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 06:29:03,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2019-09-08 06:29:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:03,213 INFO L225 Difference]: With dead ends: 3139 [2019-09-08 06:29:03,213 INFO L226 Difference]: Without dead ends: 2383 [2019-09-08 06:29:03,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-09-08 06:29:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-09-08 06:29:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2049. [2019-09-08 06:29:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2019-09-08 06:29:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2917 transitions. [2019-09-08 06:29:03,533 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2917 transitions. Word has length 127 [2019-09-08 06:29:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:03,534 INFO L475 AbstractCegarLoop]: Abstraction has 2049 states and 2917 transitions. [2019-09-08 06:29:03,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:29:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2917 transitions. [2019-09-08 06:29:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 06:29:03,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:03,553 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:03,554 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:03,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1167073510, now seen corresponding path program 1 times [2019-09-08 06:29:03,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:03,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:03,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:03,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:03,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:29:03,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:03,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:29:03,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:03,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:29:03,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:29:03,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:03,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-08 06:29:03,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:29:03,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:29:03,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:29:03,922 INFO L87 Difference]: Start difference. First operand 2049 states and 2917 transitions. Second operand 10 states. [2019-09-08 06:29:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:05,578 INFO L93 Difference]: Finished difference Result 5984 states and 8957 transitions. [2019-09-08 06:29:05,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:29:05,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-09-08 06:29:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:05,620 INFO L225 Difference]: With dead ends: 5984 [2019-09-08 06:29:05,621 INFO L226 Difference]: Without dead ends: 4036 [2019-09-08 06:29:05,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:29:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2019-09-08 06:29:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 3912. [2019-09-08 06:29:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3912 states. [2019-09-08 06:29:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 5530 transitions. [2019-09-08 06:29:06,074 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 5530 transitions. Word has length 129 [2019-09-08 06:29:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:06,075 INFO L475 AbstractCegarLoop]: Abstraction has 3912 states and 5530 transitions. [2019-09-08 06:29:06,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:29:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 5530 transitions. [2019-09-08 06:29:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 06:29:06,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:06,105 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:06,106 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:06,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:06,106 INFO L82 PathProgramCache]: Analyzing trace with hash -707935510, now seen corresponding path program 1 times [2019-09-08 06:29:06,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:06,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:06,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:06,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:06,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:29:06,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:06,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:29:06,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:06,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:29:06,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:29:06,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:06,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-08 06:29:06,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:29:06,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:29:06,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:29:06,449 INFO L87 Difference]: Start difference. First operand 3912 states and 5530 transitions. Second operand 10 states. [2019-09-08 06:29:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:08,150 INFO L93 Difference]: Finished difference Result 14116 states and 22076 transitions. [2019-09-08 06:29:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:29:08,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-09-08 06:29:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:08,256 INFO L225 Difference]: With dead ends: 14116 [2019-09-08 06:29:08,256 INFO L226 Difference]: Without dead ends: 10297 [2019-09-08 06:29:08,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:29:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10297 states. [2019-09-08 06:29:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10297 to 9363. [2019-09-08 06:29:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9363 states. [2019-09-08 06:29:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9363 states to 9363 states and 13240 transitions. [2019-09-08 06:29:09,178 INFO L78 Accepts]: Start accepts. Automaton has 9363 states and 13240 transitions. Word has length 131 [2019-09-08 06:29:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:09,179 INFO L475 AbstractCegarLoop]: Abstraction has 9363 states and 13240 transitions. [2019-09-08 06:29:09,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:29:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 9363 states and 13240 transitions. [2019-09-08 06:29:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 06:29:09,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:09,233 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:09,234 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1887648738, now seen corresponding path program 1 times [2019-09-08 06:29:09,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:09,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:09,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:29:09,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:09,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:09,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:09,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 06:29:09,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:29:09,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:29:09,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 06:29:09,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:29:09,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:29:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:29:09,532 INFO L87 Difference]: Start difference. First operand 9363 states and 13240 transitions. Second operand 10 states. [2019-09-08 06:29:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:10,144 INFO L93 Difference]: Finished difference Result 19073 states and 26834 transitions. [2019-09-08 06:29:10,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:29:10,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-09-08 06:29:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:10,238 INFO L225 Difference]: With dead ends: 19073 [2019-09-08 06:29:10,238 INFO L226 Difference]: Without dead ends: 9995 [2019-09-08 06:29:10,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 06:29:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9995 states. [2019-09-08 06:29:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9995 to 9643. [2019-09-08 06:29:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9643 states. [2019-09-08 06:29:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9643 states to 9643 states and 13544 transitions. [2019-09-08 06:29:11,034 INFO L78 Accepts]: Start accepts. Automaton has 9643 states and 13544 transitions. Word has length 131 [2019-09-08 06:29:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:11,036 INFO L475 AbstractCegarLoop]: Abstraction has 9643 states and 13544 transitions. [2019-09-08 06:29:11,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:29:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 9643 states and 13544 transitions. [2019-09-08 06:29:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 06:29:11,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:11,095 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:11,096 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:11,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:11,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1510346216, now seen corresponding path program 1 times [2019-09-08 06:29:11,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:11,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:11,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 06:29:11,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:11,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:11,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:11,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:29:11,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:29:11,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:29:11,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 06:29:11,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:29:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:29:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:29:11,500 INFO L87 Difference]: Start difference. First operand 9643 states and 13544 transitions. Second operand 7 states. [2019-09-08 06:29:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:12,695 INFO L93 Difference]: Finished difference Result 21958 states and 32022 transitions. [2019-09-08 06:29:12,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 06:29:12,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-08 06:29:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:13,360 INFO L225 Difference]: With dead ends: 21958 [2019-09-08 06:29:13,360 INFO L226 Difference]: Without dead ends: 12632 [2019-09-08 06:29:13,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:29:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12632 states. [2019-09-08 06:29:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12632 to 12008. [2019-09-08 06:29:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12008 states. [2019-09-08 06:29:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12008 states to 12008 states and 16542 transitions. [2019-09-08 06:29:14,209 INFO L78 Accepts]: Start accepts. Automaton has 12008 states and 16542 transitions. Word has length 131 [2019-09-08 06:29:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:14,210 INFO L475 AbstractCegarLoop]: Abstraction has 12008 states and 16542 transitions. [2019-09-08 06:29:14,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:29:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 12008 states and 16542 transitions. [2019-09-08 06:29:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 06:29:14,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:14,267 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:14,268 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash 489277862, now seen corresponding path program 1 times [2019-09-08 06:29:14,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:14,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:14,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 06:29:14,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:14,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:29:14,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:29:14,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:29:14,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:29:14,342 INFO L87 Difference]: Start difference. First operand 12008 states and 16542 transitions. Second operand 6 states. [2019-09-08 06:29:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:15,042 INFO L93 Difference]: Finished difference Result 23388 states and 31654 transitions. [2019-09-08 06:29:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:29:15,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-08 06:29:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:15,116 INFO L225 Difference]: With dead ends: 23388 [2019-09-08 06:29:15,117 INFO L226 Difference]: Without dead ends: 12104 [2019-09-08 06:29:15,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:29:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12104 states. [2019-09-08 06:29:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12104 to 12008. [2019-09-08 06:29:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12008 states. [2019-09-08 06:29:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12008 states to 12008 states and 16510 transitions. [2019-09-08 06:29:15,879 INFO L78 Accepts]: Start accepts. Automaton has 12008 states and 16510 transitions. Word has length 131 [2019-09-08 06:29:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:15,881 INFO L475 AbstractCegarLoop]: Abstraction has 12008 states and 16510 transitions. [2019-09-08 06:29:15,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:29:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 12008 states and 16510 transitions. [2019-09-08 06:29:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 06:29:15,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:15,930 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:15,930 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1190342440, now seen corresponding path program 1 times [2019-09-08 06:29:15,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:15,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:15,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:15,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:15,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:29:16,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:16,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:16,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:16,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 06:29:16,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:29:16,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:16,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-09-08 06:29:16,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:29:16,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:29:16,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:29:16,254 INFO L87 Difference]: Start difference. First operand 12008 states and 16510 transitions. Second operand 9 states. [2019-09-08 06:29:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:17,696 INFO L93 Difference]: Finished difference Result 27852 states and 38357 transitions. [2019-09-08 06:29:17,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 06:29:17,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 06:29:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:17,778 INFO L225 Difference]: With dead ends: 27852 [2019-09-08 06:29:17,779 INFO L226 Difference]: Without dead ends: 16142 [2019-09-08 06:29:17,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:29:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16142 states. [2019-09-08 06:29:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16142 to 12497. [2019-09-08 06:29:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12497 states. [2019-09-08 06:29:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12497 states to 12497 states and 17248 transitions. [2019-09-08 06:29:18,916 INFO L78 Accepts]: Start accepts. Automaton has 12497 states and 17248 transitions. Word has length 131 [2019-09-08 06:29:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:18,917 INFO L475 AbstractCegarLoop]: Abstraction has 12497 states and 17248 transitions. [2019-09-08 06:29:18,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:29:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 12497 states and 17248 transitions. [2019-09-08 06:29:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 06:29:18,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:18,951 INFO L399 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] [2019-09-08 06:29:18,951 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1943460818, now seen corresponding path program 1 times [2019-09-08 06:29:18,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:18,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:18,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:18,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:18,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 06:29:19,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:19,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:19,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:19,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 06:29:19,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:29:19,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:19,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-09-08 06:29:19,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:29:19,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:29:19,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:29:19,317 INFO L87 Difference]: Start difference. First operand 12497 states and 17248 transitions. Second operand 10 states. [2019-09-08 06:29:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:21,899 INFO L93 Difference]: Finished difference Result 36592 states and 50786 transitions. [2019-09-08 06:29:21,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 06:29:21,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 06:29:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:22,011 INFO L225 Difference]: With dead ends: 36592 [2019-09-08 06:29:22,011 INFO L226 Difference]: Without dead ends: 24543 [2019-09-08 06:29:22,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-08 06:29:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24543 states. [2019-09-08 06:29:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24543 to 22983. [2019-09-08 06:29:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22983 states. [2019-09-08 06:29:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22983 states to 22983 states and 31413 transitions. [2019-09-08 06:29:23,422 INFO L78 Accepts]: Start accepts. Automaton has 22983 states and 31413 transitions. Word has length 140 [2019-09-08 06:29:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:23,422 INFO L475 AbstractCegarLoop]: Abstraction has 22983 states and 31413 transitions. [2019-09-08 06:29:23,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:29:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 22983 states and 31413 transitions. [2019-09-08 06:29:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 06:29:23,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:23,481 INFO L399 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] [2019-09-08 06:29:23,482 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash -629503792, now seen corresponding path program 1 times [2019-09-08 06:29:23,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:23,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:23,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:23,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:23,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 06:29:24,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:24,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:24,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:24,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 06:29:24,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-08 06:29:24,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:29:24,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-09-08 06:29:24,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 06:29:24,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 06:29:24,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:29:24,759 INFO L87 Difference]: Start difference. First operand 22983 states and 31413 transitions. Second operand 18 states. [2019-09-08 06:29:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:28,234 INFO L93 Difference]: Finished difference Result 46734 states and 67199 transitions. [2019-09-08 06:29:28,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 06:29:28,234 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 140 [2019-09-08 06:29:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:28,334 INFO L225 Difference]: With dead ends: 46734 [2019-09-08 06:29:28,335 INFO L226 Difference]: Without dead ends: 24155 [2019-09-08 06:29:28,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 06:29:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24155 states. [2019-09-08 06:29:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24155 to 21611. [2019-09-08 06:29:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21611 states. [2019-09-08 06:29:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21611 states to 21611 states and 29493 transitions. [2019-09-08 06:29:29,618 INFO L78 Accepts]: Start accepts. Automaton has 21611 states and 29493 transitions. Word has length 140 [2019-09-08 06:29:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:29,619 INFO L475 AbstractCegarLoop]: Abstraction has 21611 states and 29493 transitions. [2019-09-08 06:29:29,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 06:29:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 21611 states and 29493 transitions. [2019-09-08 06:29:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 06:29:29,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:29,662 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:29,662 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:29,663 INFO L82 PathProgramCache]: Analyzing trace with hash 357513590, now seen corresponding path program 1 times [2019-09-08 06:29:29,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:29,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:29,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:29,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:29,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:29:29,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:29,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:29:29,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:29,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 06:29:29,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:29:30,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:30,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-08 06:29:30,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 06:29:30,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 06:29:30,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 06:29:30,013 INFO L87 Difference]: Start difference. First operand 21611 states and 29493 transitions. Second operand 11 states. [2019-09-08 06:29:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:31,538 INFO L93 Difference]: Finished difference Result 38971 states and 54264 transitions. [2019-09-08 06:29:31,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:29:31,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 141 [2019-09-08 06:29:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:31,598 INFO L225 Difference]: With dead ends: 38971 [2019-09-08 06:29:31,598 INFO L226 Difference]: Without dead ends: 17590 [2019-09-08 06:29:31,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:29:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17590 states. [2019-09-08 06:29:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17590 to 17064. [2019-09-08 06:29:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17064 states. [2019-09-08 06:29:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17064 states to 17064 states and 22179 transitions. [2019-09-08 06:29:32,397 INFO L78 Accepts]: Start accepts. Automaton has 17064 states and 22179 transitions. Word has length 141 [2019-09-08 06:29:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:32,397 INFO L475 AbstractCegarLoop]: Abstraction has 17064 states and 22179 transitions. [2019-09-08 06:29:32,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 06:29:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 17064 states and 22179 transitions. [2019-09-08 06:29:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 06:29:32,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:32,423 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:32,423 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:32,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:32,424 INFO L82 PathProgramCache]: Analyzing trace with hash -49919681, now seen corresponding path program 1 times [2019-09-08 06:29:32,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:32,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:32,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 06:29:32,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:32,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:32,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:32,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:29:32,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:29:32,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:29:32,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-08 06:29:32,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:29:32,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:29:32,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:29:32,847 INFO L87 Difference]: Start difference. First operand 17064 states and 22179 transitions. Second operand 4 states. [2019-09-08 06:29:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:33,515 INFO L93 Difference]: Finished difference Result 33184 states and 43544 transitions. [2019-09-08 06:29:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:29:33,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-08 06:29:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:33,595 INFO L225 Difference]: With dead ends: 33184 [2019-09-08 06:29:33,596 INFO L226 Difference]: Without dead ends: 16616 [2019-09-08 06:29:33,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:29:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16616 states. [2019-09-08 06:29:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16616 to 16616. [2019-09-08 06:29:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16616 states. [2019-09-08 06:29:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16616 states to 16616 states and 21309 transitions. [2019-09-08 06:29:34,531 INFO L78 Accepts]: Start accepts. Automaton has 16616 states and 21309 transitions. Word has length 146 [2019-09-08 06:29:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:34,532 INFO L475 AbstractCegarLoop]: Abstraction has 16616 states and 21309 transitions. [2019-09-08 06:29:34,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:29:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 16616 states and 21309 transitions. [2019-09-08 06:29:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 06:29:34,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:34,563 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:34,563 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:34,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1635279743, now seen corresponding path program 1 times [2019-09-08 06:29:34,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:34,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:34,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:34,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:34,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:29:34,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:34,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:29:34,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:34,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 06:29:34,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:29:34,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:34,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-08 06:29:34,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 06:29:34,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 06:29:34,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 06:29:34,954 INFO L87 Difference]: Start difference. First operand 16616 states and 21309 transitions. Second operand 11 states. [2019-09-08 06:29:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:36,778 INFO L93 Difference]: Finished difference Result 30679 states and 39892 transitions. [2019-09-08 06:29:36,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:29:36,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 146 [2019-09-08 06:29:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:36,824 INFO L225 Difference]: With dead ends: 30679 [2019-09-08 06:29:36,824 INFO L226 Difference]: Without dead ends: 14666 [2019-09-08 06:29:36,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:29:36,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14666 states. [2019-09-08 06:29:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14666 to 14346. [2019-09-08 06:29:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14346 states. [2019-09-08 06:29:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14346 states to 14346 states and 17816 transitions. [2019-09-08 06:29:37,504 INFO L78 Accepts]: Start accepts. Automaton has 14346 states and 17816 transitions. Word has length 146 [2019-09-08 06:29:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:37,505 INFO L475 AbstractCegarLoop]: Abstraction has 14346 states and 17816 transitions. [2019-09-08 06:29:37,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 06:29:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 14346 states and 17816 transitions. [2019-09-08 06:29:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 06:29:37,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:37,525 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:37,526 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:37,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1687786672, now seen corresponding path program 1 times [2019-09-08 06:29:37,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:37,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:37,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:37,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:37,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 06:29:37,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:37,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:37,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:37,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:29:37,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:29:37,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:29:37,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-08 06:29:37,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:29:37,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:29:37,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:29:37,748 INFO L87 Difference]: Start difference. First operand 14346 states and 17816 transitions. Second operand 4 states. [2019-09-08 06:29:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:38,518 INFO L93 Difference]: Finished difference Result 26948 states and 33821 transitions. [2019-09-08 06:29:38,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:29:38,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-08 06:29:38,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:38,562 INFO L225 Difference]: With dead ends: 26948 [2019-09-08 06:29:38,562 INFO L226 Difference]: Without dead ends: 13506 [2019-09-08 06:29:38,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:29:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13506 states. [2019-09-08 06:29:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13506 to 13506. [2019-09-08 06:29:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13506 states. [2019-09-08 06:29:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13506 states to 13506 states and 16476 transitions. [2019-09-08 06:29:39,190 INFO L78 Accepts]: Start accepts. Automaton has 13506 states and 16476 transitions. Word has length 151 [2019-09-08 06:29:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:39,190 INFO L475 AbstractCegarLoop]: Abstraction has 13506 states and 16476 transitions. [2019-09-08 06:29:39,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:29:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 13506 states and 16476 transitions. [2019-09-08 06:29:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 06:29:39,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:39,209 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:39,209 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:39,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:39,209 INFO L82 PathProgramCache]: Analyzing trace with hash -986212080, now seen corresponding path program 1 times [2019-09-08 06:29:39,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:39,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:39,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:39,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:39,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 06:29:39,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:39,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:29:39,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:29:39,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:29:39,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:29:39,314 INFO L87 Difference]: Start difference. First operand 13506 states and 16476 transitions. Second operand 5 states. [2019-09-08 06:29:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:41,896 INFO L93 Difference]: Finished difference Result 47447 states and 58234 transitions. [2019-09-08 06:29:41,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 06:29:41,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-08 06:29:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:42,003 INFO L225 Difference]: With dead ends: 47447 [2019-09-08 06:29:42,003 INFO L226 Difference]: Without dead ends: 36077 [2019-09-08 06:29:42,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:29:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36077 states. [2019-09-08 06:29:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36077 to 36071. [2019-09-08 06:29:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36071 states. [2019-09-08 06:29:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36071 states to 36071 states and 43919 transitions. [2019-09-08 06:29:45,125 INFO L78 Accepts]: Start accepts. Automaton has 36071 states and 43919 transitions. Word has length 151 [2019-09-08 06:29:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:45,126 INFO L475 AbstractCegarLoop]: Abstraction has 36071 states and 43919 transitions. [2019-09-08 06:29:45,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:29:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 36071 states and 43919 transitions. [2019-09-08 06:29:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 06:29:45,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:45,165 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:45,165 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:45,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:45,165 INFO L82 PathProgramCache]: Analyzing trace with hash -54559700, now seen corresponding path program 1 times [2019-09-08 06:29:45,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:45,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:45,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:45,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:45,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 06:29:45,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:45,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:29:45,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:45,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:29:45,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:29:45,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:45,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-08 06:29:45,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:29:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:29:45,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:29:45,436 INFO L87 Difference]: Start difference. First operand 36071 states and 43919 transitions. Second operand 9 states. [2019-09-08 06:29:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:49,526 INFO L93 Difference]: Finished difference Result 101303 states and 124183 transitions. [2019-09-08 06:29:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:29:49,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 156 [2019-09-08 06:29:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:49,771 INFO L225 Difference]: With dead ends: 101303 [2019-09-08 06:29:49,772 INFO L226 Difference]: Without dead ends: 65364 [2019-09-08 06:29:49,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:29:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65364 states. [2019-09-08 06:29:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65364 to 54716. [2019-09-08 06:29:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54716 states. [2019-09-08 06:29:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54716 states to 54716 states and 64910 transitions. [2019-09-08 06:29:54,454 INFO L78 Accepts]: Start accepts. Automaton has 54716 states and 64910 transitions. Word has length 156 [2019-09-08 06:29:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:54,455 INFO L475 AbstractCegarLoop]: Abstraction has 54716 states and 64910 transitions. [2019-09-08 06:29:54,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:29:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 54716 states and 64910 transitions. [2019-09-08 06:29:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 06:29:54,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:54,485 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:54,486 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:54,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:54,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1934183041, now seen corresponding path program 1 times [2019-09-08 06:29:54,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:54,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:54,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 06:29:54,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:54,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:29:54,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:54,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:29:54,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:29:54,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:29:54,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:29:54,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:29:54,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:29:54,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:29:54,783 INFO L87 Difference]: Start difference. First operand 54716 states and 64910 transitions. Second operand 7 states. [2019-09-08 06:29:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:56,639 INFO L93 Difference]: Finished difference Result 82142 states and 98113 transitions. [2019-09-08 06:29:56,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:29:56,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2019-09-08 06:29:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:56,717 INFO L225 Difference]: With dead ends: 82142 [2019-09-08 06:29:56,718 INFO L226 Difference]: Without dead ends: 28215 [2019-09-08 06:29:56,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-08 06:29:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28215 states. [2019-09-08 06:29:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28215 to 21017. [2019-09-08 06:29:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21017 states. [2019-09-08 06:29:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21017 states to 21017 states and 24840 transitions. [2019-09-08 06:29:57,938 INFO L78 Accepts]: Start accepts. Automaton has 21017 states and 24840 transitions. Word has length 174 [2019-09-08 06:29:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:57,939 INFO L475 AbstractCegarLoop]: Abstraction has 21017 states and 24840 transitions. [2019-09-08 06:29:57,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:29:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 21017 states and 24840 transitions. [2019-09-08 06:29:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:29:57,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:57,959 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:57,960 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:57,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:57,960 INFO L82 PathProgramCache]: Analyzing trace with hash -329914361, now seen corresponding path program 1 times [2019-09-08 06:29:57,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:57,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:57,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:57,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:57,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 06:29:58,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:29:58,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:29:58,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:29:58,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:29:58,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:29:58,015 INFO L87 Difference]: Start difference. First operand 21017 states and 24840 transitions. Second operand 3 states. [2019-09-08 06:29:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:59,979 INFO L93 Difference]: Finished difference Result 41552 states and 49304 transitions. [2019-09-08 06:29:59,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:29:59,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 06:29:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:30:00,032 INFO L225 Difference]: With dead ends: 41552 [2019-09-08 06:30:00,032 INFO L226 Difference]: Without dead ends: 21191 [2019-09-08 06:30:00,057 INFO L628 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 [2019-09-08 06:30:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21191 states. [2019-09-08 06:30:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21191 to 21017. [2019-09-08 06:30:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21017 states. [2019-09-08 06:30:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21017 states to 21017 states and 24666 transitions. [2019-09-08 06:30:01,120 INFO L78 Accepts]: Start accepts. Automaton has 21017 states and 24666 transitions. Word has length 176 [2019-09-08 06:30:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:30:01,121 INFO L475 AbstractCegarLoop]: Abstraction has 21017 states and 24666 transitions. [2019-09-08 06:30:01,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:30:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 21017 states and 24666 transitions. [2019-09-08 06:30:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:30:01,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:30:01,142 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:30:01,142 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:30:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:30:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2089741846, now seen corresponding path program 1 times [2019-09-08 06:30:01,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:30:01,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:30:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:01,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:30:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 06:30:01,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:30:01,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:30:01,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:30:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:01,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:30:01,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:30:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:30:01,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:30:01,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 06:30:01,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:30:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:30:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:30:01,547 INFO L87 Difference]: Start difference. First operand 21017 states and 24666 transitions. Second operand 12 states. [2019-09-08 06:30:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:30:03,714 INFO L93 Difference]: Finished difference Result 35197 states and 41654 transitions. [2019-09-08 06:30:03,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 06:30:03,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 176 [2019-09-08 06:30:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:30:03,759 INFO L225 Difference]: With dead ends: 35197 [2019-09-08 06:30:03,759 INFO L226 Difference]: Without dead ends: 14629 [2019-09-08 06:30:03,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2019-09-08 06:30:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14629 states. [2019-09-08 06:30:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14629 to 7120. [2019-09-08 06:30:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7120 states. [2019-09-08 06:30:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7120 states to 7120 states and 8011 transitions. [2019-09-08 06:30:04,337 INFO L78 Accepts]: Start accepts. Automaton has 7120 states and 8011 transitions. Word has length 176 [2019-09-08 06:30:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:30:04,337 INFO L475 AbstractCegarLoop]: Abstraction has 7120 states and 8011 transitions. [2019-09-08 06:30:04,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:30:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 7120 states and 8011 transitions. [2019-09-08 06:30:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 06:30:04,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:30:04,342 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:30:04,342 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:30:04,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:30:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1194521643, now seen corresponding path program 1 times [2019-09-08 06:30:04,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:30:04,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:30:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:04,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:30:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 06:30:04,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:30:04,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:30:04,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:30:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:04,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:30:04,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:30:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:30:04,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:30:04,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 06:30:04,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:30:04,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:30:04,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:30:04,631 INFO L87 Difference]: Start difference. First operand 7120 states and 8011 transitions. Second operand 8 states. [2019-09-08 06:30:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:30:05,182 INFO L93 Difference]: Finished difference Result 11078 states and 12479 transitions. [2019-09-08 06:30:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:30:05,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 177 [2019-09-08 06:30:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:30:05,195 INFO L225 Difference]: With dead ends: 11078 [2019-09-08 06:30:05,195 INFO L226 Difference]: Without dead ends: 4452 [2019-09-08 06:30:05,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:30:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2019-09-08 06:30:05,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 4404. [2019-09-08 06:30:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2019-09-08 06:30:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 4891 transitions. [2019-09-08 06:30:05,496 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 4891 transitions. Word has length 177 [2019-09-08 06:30:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:30:05,496 INFO L475 AbstractCegarLoop]: Abstraction has 4404 states and 4891 transitions. [2019-09-08 06:30:05,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:30:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 4891 transitions. [2019-09-08 06:30:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 06:30:05,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:30:05,499 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:30:05,500 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:30:05,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:30:05,500 INFO L82 PathProgramCache]: Analyzing trace with hash -532977228, now seen corresponding path program 1 times [2019-09-08 06:30:05,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:30:05,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:30:05,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:05,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:30:05,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 06:30:05,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:30:05,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:30:05,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:30:05,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:30:05,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:30:05,566 INFO L87 Difference]: Start difference. First operand 4404 states and 4891 transitions. Second operand 5 states. [2019-09-08 06:30:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:30:06,739 INFO L93 Difference]: Finished difference Result 13589 states and 15493 transitions. [2019-09-08 06:30:06,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:30:06,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-09-08 06:30:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:30:06,769 INFO L225 Difference]: With dead ends: 13589 [2019-09-08 06:30:06,769 INFO L226 Difference]: Without dead ends: 11006 [2019-09-08 06:30:06,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:30:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11006 states. [2019-09-08 06:30:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11006 to 9755. [2019-09-08 06:30:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9755 states. [2019-09-08 06:30:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9755 states to 9755 states and 11008 transitions. [2019-09-08 06:30:07,596 INFO L78 Accepts]: Start accepts. Automaton has 9755 states and 11008 transitions. Word has length 178 [2019-09-08 06:30:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:30:07,597 INFO L475 AbstractCegarLoop]: Abstraction has 9755 states and 11008 transitions. [2019-09-08 06:30:07,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:30:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 9755 states and 11008 transitions. [2019-09-08 06:30:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 06:30:07,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:30:07,601 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:30:07,601 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:30:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:30:07,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1590815306, now seen corresponding path program 1 times [2019-09-08 06:30:07,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:30:07,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:30:07,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:07,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:30:07,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:30:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 06:30:07,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:30:07,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:30:07,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:30:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:30:07,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:30:07,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:30:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:30:07,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:30:07,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-08 06:30:07,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:30:07,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:30:07,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:30:07,855 INFO L87 Difference]: Start difference. First operand 9755 states and 11008 transitions. Second operand 8 states. [2019-09-08 06:30:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:30:08,047 INFO L93 Difference]: Finished difference Result 11064 states and 12422 transitions. [2019-09-08 06:30:08,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:30:08,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-08 06:30:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:30:08,049 INFO L225 Difference]: With dead ends: 11064 [2019-09-08 06:30:08,050 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 06:30:08,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:30:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 06:30:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 06:30:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 06:30:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 06:30:08,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2019-09-08 06:30:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:30:08,067 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 06:30:08,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:30:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 06:30:08,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 06:30:08,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 06:30:08,367 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 134 [2019-09-08 06:30:08,701 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 191 [2019-09-08 06:30:09,435 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 375 DAG size of output: 233 [2019-09-08 06:30:10,045 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 191 [2019-09-08 06:30:11,019 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 397 DAG size of output: 255 [2019-09-08 06:30:11,682 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-08 06:30:13,013 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 397 DAG size of output: 255 [2019-09-08 06:30:16,406 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 226 [2019-09-08 06:30:18,328 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 276 [2019-09-08 06:30:18,525 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 229 [2019-09-08 06:30:19,585 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 227 [2019-09-08 06:30:23,943 WARN L188 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 109 [2019-09-08 06:30:24,928 WARN L188 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 115 [2019-09-08 06:30:26,329 WARN L188 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 227 DAG size of output: 130 [2019-09-08 06:30:26,448 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-08 06:30:27,899 WARN L188 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 233 DAG size of output: 117 [2019-09-08 06:30:31,965 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 290 DAG size of output: 118 [2019-09-08 06:30:32,932 WARN L188 SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 115 [2019-09-08 06:30:33,046 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 06:30:39,145 WARN L188 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 350 DAG size of output: 103 [2019-09-08 06:30:39,468 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 107 [2019-09-08 06:30:41,765 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 255 DAG size of output: 132 [2019-09-08 06:30:42,247 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 111 [2019-09-08 06:30:46,706 WARN L188 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 332 DAG size of output: 111 [2019-09-08 06:30:51,548 WARN L188 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 353 DAG size of output: 95 [2019-09-08 06:30:53,747 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 255 DAG size of output: 132 [2019-09-08 06:30:54,215 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 1 [2019-09-08 06:30:54,557 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 73 [2019-09-08 06:30:56,899 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 296 DAG size of output: 70 [2019-09-08 06:31:03,156 WARN L188 SmtUtils]: Spent 6.24 s on a formula simplification. DAG size of input: 350 DAG size of output: 103 [2019-09-08 06:31:03,476 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2019-09-08 06:31:06,042 WARN L188 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 392 DAG size of output: 89 [2019-09-08 06:31:08,671 WARN L188 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 246 DAG size of output: 92 [2019-09-08 06:31:10,924 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 186 DAG size of output: 132 [2019-09-08 06:31:15,820 WARN L188 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 379 DAG size of output: 118 [2019-09-08 06:31:17,345 WARN L188 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 231 DAG size of output: 120 [2019-09-08 06:31:20,275 WARN L188 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 222 DAG size of output: 107 [2019-09-08 06:31:25,002 WARN L188 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 333 DAG size of output: 120 [2019-09-08 06:31:25,379 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 348 DAG size of output: 1 [2019-09-08 06:31:25,698 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 107 [2019-09-08 06:31:25,992 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2019-09-08 06:31:29,421 WARN L188 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 294 DAG size of output: 98 [2019-09-08 06:31:29,726 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 108 [2019-09-08 06:31:45,704 WARN L188 SmtUtils]: Spent 15.96 s on a formula simplification. DAG size of input: 608 DAG size of output: 307 [2019-09-08 06:31:46,022 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 109 [2019-09-08 06:31:47,856 WARN L188 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 185 DAG size of output: 125 [2019-09-08 06:31:48,177 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 108 [2019-09-08 06:31:54,647 WARN L188 SmtUtils]: Spent 6.45 s on a formula simplification. DAG size of input: 372 DAG size of output: 122 [2019-09-08 06:31:56,245 WARN L188 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 235 DAG size of output: 119 [2019-09-08 06:31:56,706 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 1 [2019-09-08 06:31:57,199 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 1 [2019-09-08 06:32:03,352 WARN L188 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 348 DAG size of output: 147 [2019-09-08 06:32:08,234 WARN L188 SmtUtils]: Spent 4.87 s on a formula simplification. DAG size of input: 337 DAG size of output: 120 [2019-09-08 06:32:11,740 WARN L188 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 294 DAG size of output: 144 [2019-09-08 06:32:12,048 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 104 [2019-09-08 06:32:13,329 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 222 DAG size of output: 129 [2019-09-08 06:32:15,837 WARN L188 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 249 DAG size of output: 97 [2019-09-08 06:32:19,098 WARN L188 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 302 DAG size of output: 147 [2019-09-08 06:32:19,594 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 111 [2019-09-08 06:32:24,478 WARN L188 SmtUtils]: Spent 4.87 s on a formula simplification. DAG size of input: 379 DAG size of output: 118 [2019-09-08 06:32:24,484 INFO L439 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 373 388) the Hoare annotation is: (let ((.cse30 (= 1 ~b0_ev~0))) (let ((.cse25 (not (= 1 ~d0_ev~0))) (.cse6 (not (= 1 ~d1_ev~0))) (.cse27 (not .cse30)) (.cse26 (not (= ~z_val~0 ~z_val_t~0))) (.cse29 (not (<= 2 ~d0_ev~0))) (.cse31 (not (<= 2 ~b0_ev~0))) (.cse0 (= ~b1_ev~0 0)) (.cse24 (not (<= ~d1_ev~0 1))) (.cse1 (= 1 ~b0_req_up~0)) (.cse2 (not (<= ~comp_m1_i~0 0))) (.cse3 (not (<= 1 ~b1_val_t~0))) (.cse4 (not (<= ~d0_ev~0 0))) (.cse5 (= 0 ~d0_ev~0)) (.cse22 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (= 0 ~b0_ev~0)) (.cse9 (not (<= 1 ~d0_val_t~0))) (.cse23 (not (<= ~z_req_up~0 0))) (.cse10 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse11 (not (<= ~b0_ev~0 0))) (.cse12 (= 1 ~b1_req_up~0)) (.cse13 (not (<= 2 |old(~comp_m1_st~0)|))) (.cse14 (not (<= 1 ~b0_val_t~0))) (.cse15 (not (<= 1 ~d1_val_t~0))) (.cse16 (not (<= 2 ~z_ev~0))) (.cse18 (not (<= ~z_val~0 0))) (.cse28 (not (= 0 ~z_val_t~0))) (.cse17 (= ~b1_ev~0 1)) (.cse19 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse21 (not (<= 0 ~z_val~0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22) (or .cse22 (or .cse8 .cse9 .cse23 .cse10 .cse11 .cse24 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse25 .cse20 .cse21) .cse19 .cse7 .cse3 .cse26) (or .cse19 .cse7 (or .cse23 .cse10 .cse24 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse25 .cse21 .cse27) .cse20 .cse3 .cse9 .cse22 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21) (or .cse22 (or .cse19 .cse7 .cse3 (and (or .cse8 .cse9 .cse10 .cse12 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse29 .cse1 .cse2 .cse30 .cse20 .cse21 .cse6) (or (or .cse10 (or .cse31 .cse12 .cse0 .cse13 .cse15 .cse17 .cse16 .cse18 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6) .cse14) .cse20 .cse9)))) (or .cse22 (or .cse23 .cse10 .cse24 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse21 .cse27 .cse4 .cse5) .cse19 .cse7 .cse20 .cse3 .cse9 .cse26) (or .cse19 .cse7 .cse3 .cse26 .cse22 (and (or .cse8 .cse9 .cse10 .cse12 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse29 .cse1 .cse2 .cse30 .cse20 .cse21) (or (or .cse31 .cse10 .cse12 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse1 .cse2 .cse21 .cse4 .cse5) .cse20 .cse9))) (or .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse7 .cse8 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse28 (not .cse17) .cse19 .cse20 .cse21)))) [2019-09-08 06:32:24,484 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2019-09-08 06:32:24,484 INFO L443 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 373 388) no Hoare annotation was computed. [2019-09-08 06:32:24,485 INFO L439 ceAbstractionStarter]: At program point L378(line 378) the Hoare annotation is: (let ((.cse30 (= 1 ~b0_ev~0))) (let ((.cse25 (not (= 1 ~d0_ev~0))) (.cse6 (not (= 1 ~d1_ev~0))) (.cse27 (not .cse30)) (.cse26 (not (= ~z_val~0 ~z_val_t~0))) (.cse29 (not (<= 2 ~d0_ev~0))) (.cse31 (not (<= 2 ~b0_ev~0))) (.cse0 (= ~b1_ev~0 0)) (.cse24 (not (<= ~d1_ev~0 1))) (.cse1 (= 1 ~b0_req_up~0)) (.cse2 (not (<= ~comp_m1_i~0 0))) (.cse3 (not (<= 1 ~b1_val_t~0))) (.cse4 (not (<= ~d0_ev~0 0))) (.cse5 (= 0 ~d0_ev~0)) (.cse22 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (= 0 ~b0_ev~0)) (.cse9 (not (<= 1 ~d0_val_t~0))) (.cse23 (not (<= ~z_req_up~0 0))) (.cse10 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse11 (not (<= ~b0_ev~0 0))) (.cse12 (= 1 ~b1_req_up~0)) (.cse13 (not (<= 2 |old(~comp_m1_st~0)|))) (.cse14 (not (<= 1 ~b0_val_t~0))) (.cse15 (not (<= 1 ~d1_val_t~0))) (.cse16 (not (<= 2 ~z_ev~0))) (.cse18 (not (<= ~z_val~0 0))) (.cse28 (not (= 0 ~z_val_t~0))) (.cse17 (= ~b1_ev~0 1)) (.cse19 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse21 (not (<= 0 ~z_val~0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22) (or .cse22 (or .cse8 .cse9 .cse23 .cse10 .cse11 .cse24 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse25 .cse20 .cse21) .cse19 .cse7 .cse3 .cse26) (or .cse19 .cse7 (or .cse23 .cse10 .cse24 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse25 .cse21 .cse27) .cse20 .cse3 .cse9 .cse22 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21) (or .cse22 (or .cse19 .cse7 .cse3 (and (or .cse8 .cse9 .cse10 .cse12 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse29 .cse1 .cse2 .cse30 .cse20 .cse21 .cse6) (or (or .cse10 (or .cse31 .cse12 .cse0 .cse13 .cse15 .cse17 .cse16 .cse18 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6) .cse14) .cse20 .cse9)))) (or .cse22 (or .cse23 .cse10 .cse24 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse21 .cse27 .cse4 .cse5) .cse19 .cse7 .cse20 .cse3 .cse9 .cse26) (or .cse19 .cse7 .cse3 .cse26 .cse22 (and (or .cse8 .cse9 .cse10 .cse12 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse29 .cse1 .cse2 .cse30 .cse20 .cse21) (or (or .cse31 .cse10 .cse12 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse1 .cse2 .cse21 .cse4 .cse5) .cse20 .cse9))) (or .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse7 .cse8 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse28 (not .cse17) .cse19 .cse20 .cse21)))) [2019-09-08 06:32:24,485 INFO L443 ceAbstractionStarter]: For program point L380-2(lines 373 388) no Hoare annotation was computed. [2019-09-08 06:32:24,485 INFO L443 ceAbstractionStarter]: For program point L378-1(line 378) no Hoare annotation was computed. [2019-09-08 06:32:24,485 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 254 268) no Hoare annotation was computed. [2019-09-08 06:32:24,486 INFO L439 ceAbstractionStarter]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse26 (not (= ~z_val~0 ~z_val_t~0))) (.cse27 (= exists_runnable_thread_~__retres1~1 0)) (.cse28 (not (<= 2 ~comp_m1_st~0))) (.cse11 (not (<= 2 ~d0_ev~0))) (.cse20 (not (<= ~b0_ev~0 0))) (.cse22 (not (<= 2 ~b0_ev~0))) (.cse6 (= ~b1_ev~0 0)) (.cse8 (= ~b1_ev~0 1)) (.cse31 (not (<= 2 ~d1_ev~0))) (.cse12 (= 1 ~b0_req_up~0)) (.cse13 (not (<= ~comp_m1_i~0 0))) (.cse15 (not (= 0 ~comp_m1_st~0))) (.cse3 (not (<= 1 ~b1_val_t~0))) (.cse24 (not (<= ~d0_ev~0 0))) (.cse25 (= 0 ~d0_ev~0)) (.cse0 (<= 1 exists_runnable_thread_~__retres1~1)) (.cse2 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse4 (= 0 ~b0_ev~0)) (.cse18 (not (<= 1 ~d0_val_t~0))) (.cse23 (not (<= ~z_req_up~0 0))) (.cse19 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse5 (= 1 ~b1_req_up~0)) (.cse21 (not (<= 1 ~b0_val_t~0))) (.cse7 (not (<= 1 ~d1_val_t~0))) (.cse9 (not (<= 2 ~z_ev~0))) (.cse10 (not (<= ~z_val~0 0))) (.cse30 (not (= 0 ~z_val_t~0))) (.cse1 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse29 (= 1 ~b0_ev~0)) (.cse17 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse14 (not (<= 0 ~z_val~0))) (.cse16 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 (and (or (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse17 .cse18 (or (or .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse19 .cse21)) (or (or .cse22 .cse23 .cse19 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse24 .cse25 .cse16) .cse17 .cse18)) .cse26) (or .cse1 .cse2 .cse27 .cse3 .cse26 (and (or .cse4 .cse18 .cse19 .cse5 .cse6 .cse28 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse17 .cse14 .cse16) (or (or .cse22 .cse19 .cse5 .cse6 .cse28 .cse21 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse24 .cse25 .cse16) .cse17 .cse18))) (or .cse6 .cse12 .cse13 .cse3 .cse24 .cse25 .cse2 .cse4 .cse18 .cse19 .cse20 .cse5 .cse27 .cse28 .cse21 .cse7 .cse9 .cse8 .cse10 .cse30 .cse1 .cse17 .cse14 .cse16) (or .cse0 (or .cse1 .cse2 .cse17 .cse3 .cse18 .cse19 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse31 .cse24 .cse25) .cse20 .cse21)) (or (or .cse1 .cse2 .cse3 (and (or .cse17 .cse18 (or .cse19 (or .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse31) .cse21)) (or .cse17 .cse18 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse31) .cse19 .cse20 .cse21) (or .cse17 .cse18 (or .cse19 (or .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse31 .cse24 .cse25) .cse21)))) .cse0) (or .cse12 .cse13 .cse15 .cse3 .cse24 .cse25 (not (<= 2 ~b1_ev~0)) .cse0 .cse2 .cse4 .cse18 .cse23 .cse19 .cse5 .cse21 .cse7 .cse9 .cse10 .cse30 .cse1 .cse29 .cse17 .cse14 .cse16))) [2019-09-08 06:32:24,486 INFO L446 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 254 268) the Hoare annotation is: true [2019-09-08 06:32:24,486 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2019-09-08 06:32:24,486 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 254 268) no Hoare annotation was computed. [2019-09-08 06:32:24,486 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-09-08 06:32:24,486 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-09-08 06:32:24,486 INFO L443 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2019-09-08 06:32:24,486 INFO L443 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2019-09-08 06:32:24,487 INFO L439 ceAbstractionStarter]: At program point method1ENTRY(lines 36 92) the Hoare annotation is: (let ((.cse30 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse31 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|))) (let ((.cse24 (not (<= ~b0_ev~0 0))) (.cse6 (not (<= 2 ~b0_ev~0))) (.cse9 (= ~b1_ev~0 0)) (.cse11 (= ~b1_ev~0 1)) (.cse14 (not (<= 2 ~d0_ev~0))) (.cse28 (not (<= 2 ~d1_ev~0))) (.cse1 (and .cse30 .cse31)) (.cse5 (= 0 |old(~comp_m1_st~0)|)) (.cse7 (not (<= ~d1_ev~0 1))) (.cse0 (= ~z_val~0 ~z_val_t~0)) (.cse15 (= 1 ~b0_req_up~0)) (.cse16 (not (<= ~comp_m1_i~0 0))) (.cse4 (not (<= 1 ~b1_val_t~0))) (.cse26 (not (<= ~d0_ev~0 0))) (.cse27 (= 0 ~d0_ev~0)) (.cse3 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse23 (= 0 ~b0_ev~0)) (.cse22 (not (<= 1 ~d0_val_t~0))) (.cse25 (not (<= |old(~z_req_up~0)| 0))) (.cse19 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse8 (= 1 ~b1_req_up~0)) (.cse20 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= 1 ~d1_val_t~0))) (.cse12 (not (<= 2 ~z_ev~0))) (.cse13 (not (<= ~z_val~0 0))) (.cse2 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse29 (= 1 ~b0_ev~0)) (.cse21 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse17 (not (<= 0 ~z_val~0))) (.cse18 (= 1 ~d1_ev~0))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4 (and (or (or (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse20) .cse21 .cse22) (or (or .cse5 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse21 .cse22 .cse19 .cse24 .cse20) (or (or .cse5 .cse6 .cse25 .cse19 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse26 .cse27 .cse18) .cse21 .cse22)) (not (= ~z_val~0 |old(~z_val_t~0)|))) (or .cse1 (or .cse2 .cse3 .cse21 .cse4 .cse22 .cse19 (or .cse5 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse26 .cse27) .cse24 .cse20)) (or (or .cse2 .cse3 .cse4 (and (or .cse21 .cse22 (or (or .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse26 .cse27) .cse19 .cse20)) (or .cse21 .cse22 .cse19 (or .cse5 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse28) .cse20))) .cse1) (or .cse5 .cse7 (and .cse30 .cse0 .cse31) .cse15 .cse16 .cse4 .cse26 .cse27 (not (<= 2 ~b1_ev~0)) .cse3 .cse23 .cse22 .cse25 .cse19 .cse8 .cse20 .cse10 .cse12 .cse13 (not (= 0 |old(~z_val_t~0)|)) .cse2 .cse29 .cse21 .cse17 .cse18)))) [2019-09-08 06:32:24,487 INFO L443 ceAbstractionStarter]: For program point method1FINAL(lines 36 92) no Hoare annotation was computed. [2019-09-08 06:32:24,487 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2019-09-08 06:32:24,487 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2019-09-08 06:32:24,487 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2019-09-08 06:32:24,488 INFO L443 ceAbstractionStarter]: For program point method1EXIT(lines 36 92) no Hoare annotation was computed. [2019-09-08 06:32:24,488 INFO L443 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2019-09-08 06:32:24,488 INFO L443 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2019-09-08 06:32:24,488 INFO L443 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2019-09-08 06:32:24,488 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-09-08 06:32:24,488 INFO L443 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2019-09-08 06:32:24,489 INFO L439 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 340 372) the Hoare annotation is: (let ((.cse5 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse33 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse7 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse9 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse8 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse35 (= 1 |old(~b0_ev~0)|)) (.cse39 (= 1 |old(~d1_ev~0)|))) (let ((.cse6 (= 1 ~d0_ev~0)) (.cse21 (not (= 1 |old(~d0_ev~0)|))) (.cse32 (= 1 ~d1_ev~0)) (.cse30 (not .cse39)) (.cse34 (not (<= 2 |old(~d0_ev~0)|))) (.cse36 (not (<= 2 |old(~b0_ev~0)|))) (.cse25 (not (= ~z_val~0 ~z_val_t~0))) (.cse24 (not .cse35)) (.cse12 (not (<= |old(~d1_ev~0)| 1))) (.cse23 (not (= 0 ~comp_m1_st~0))) (.cse10 (not (<= ~z_req_up~0 0))) (.cse14 (= |old(~b1_ev~0)| 0)) (.cse19 (= 1 ~b0_req_up~0)) (.cse20 (not (<= ~comp_m1_i~0 0))) (.cse3 (not (<= 1 ~b1_val_t~0))) (.cse28 (not (<= |old(~d0_ev~0)| 0))) (.cse29 (= 0 |old(~d0_ev~0)|)) (.cse1 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse26 (= 0 |old(~b0_ev~0)|)) (.cse4 (not (<= 1 ~d0_val_t~0))) (.cse11 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse27 (not (<= |old(~b0_ev~0)| 0))) (.cse37 (and .cse5 .cse33 .cse7 .cse9 .cse8)) (.cse13 (= 1 ~b1_req_up~0)) (.cse38 (not (<= 2 ~comp_m1_st~0))) (.cse15 (not (<= 1 ~b0_val_t~0))) (.cse16 (not (<= 1 ~d1_val_t~0))) (.cse17 (not (<= 2 |old(~z_ev~0)|))) (.cse31 (= |old(~b1_ev~0)| 1)) (.cse18 (not (<= ~z_val~0 0))) (.cse40 (not (= 0 ~z_val_t~0))) (.cse0 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse2 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse22 (not (<= 0 ~z_val~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (and .cse5 .cse6 .cse7 .cse8) .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (or .cse0 .cse1 .cse3 .cse25 (and .cse5 .cse6 .cse7 .cse9 .cse8) (or .cse26 .cse4 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse2 .cse22 .cse23)) (or (or .cse14 .cse19 .cse20 .cse23 .cse3 .cse28 .cse29 .cse30 .cse1 .cse26 .cse4 .cse11 .cse27 .cse13 .cse15 .cse16 .cse17 .cse31 .cse18 .cse0 .cse2 .cse22) (and .cse32 .cse33 .cse7 .cse9 .cse8)) (or (and (and .cse32 .cse33 .cse7 .cse8) .cse9) (or .cse0 .cse1 .cse3 (and (or .cse26 .cse4 .cse11 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse34 .cse19 .cse20 .cse35 .cse2 .cse22 .cse23 .cse30) (or .cse2 (or .cse11 (or .cse36 .cse13 .cse14 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse28 .cse29 .cse30) .cse15) .cse4)))) (or .cse0 .cse1 .cse3 .cse25 .cse37 (and (or .cse26 .cse4 .cse11 .cse13 .cse14 .cse38 .cse15 .cse16 .cse31 .cse17 .cse18 .cse34 .cse19 .cse20 .cse35 .cse2 .cse22 .cse39) (or (or .cse36 .cse11 .cse13 .cse14 .cse38 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse20 .cse22 .cse28 .cse29 .cse39) .cse2 .cse4))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse28 .cse29) .cse37) (or .cse12 .cse19 .cse20 .cse23 .cse3 .cse28 .cse29 .cse1 .cse26 .cse4 .cse10 .cse11 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse40 (not .cse31) .cse37 .cse0 .cse2 .cse22) (or .cse14 .cse19 .cse20 .cse3 .cse28 .cse29 .cse1 .cse26 .cse4 .cse11 .cse27 .cse37 .cse13 .cse38 .cse15 .cse16 .cse17 .cse31 .cse18 .cse40 .cse0 .cse2 .cse22 .cse39)))) [2019-09-08 06:32:24,489 INFO L443 ceAbstractionStarter]: For program point L364-1(lines 340 372) no Hoare annotation was computed. [2019-09-08 06:32:24,489 INFO L443 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2019-09-08 06:32:24,489 INFO L443 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2019-09-08 06:32:24,489 INFO L443 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 340 372) no Hoare annotation was computed. [2019-09-08 06:32:24,489 INFO L443 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2019-09-08 06:32:24,489 INFO L443 ceAbstractionStarter]: For program point init_threadsEXIT(lines 241 253) no Hoare annotation was computed. [2019-09-08 06:32:24,490 INFO L439 ceAbstractionStarter]: At program point init_threadsENTRY(lines 241 253) the Hoare annotation is: (or (not (<= ~d1_ev~0 1)) (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (= 1 ~b0_req_up~0) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= ~d0_ev~0 0)) (not (<= ~b1_val_t~0 ~b1_val~0)) (not (<= 1 ~d0_val_t~0)) (not (<= ~z_req_up~0 0)) (not (<= ~b0_val_t~0 ~b0_val~0)) (not (<= ~b0_ev~0 0)) (= 1 ~b1_req_up~0) (not (<= 1 ~b0_val_t~0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 ~z_ev~0)) (= ~b1_ev~0 1) (not (<= ~z_val~0 0)) (not (= 0 ~z_val_t~0)) (not (<= ~d1_val_t~0 ~d1_val~0)) (not (= ~d0_val_t~0 ~d0_val~0)) (not (<= 0 ~z_val~0)) (= 1 ~d1_ev~0)) [2019-09-08 06:32:24,490 INFO L443 ceAbstractionStarter]: For program point L245-1(lines 241 253) no Hoare annotation was computed. [2019-09-08 06:32:24,490 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 483 501) the Hoare annotation is: (or (not (<= |old(~d1_ev~0)| 1)) (and (= ~d0_val_t~0 ~d0_val~0) (<= ~b0_val_t~0 ~b0_val~0) (= |old(~z_req_up~0)| ~z_req_up~0) (= ~d1_ev~0 |old(~d1_ev~0)|) (= ~z_val~0 ~z_val_t~0) (= |old(~z_val~0)| ~z_val~0) (= 0 ~b0_val~0) (<= ~d1_val_t~0 ~d1_val~0) (= |old(~d0_req_up~0)| ~d0_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~b0_ev~0 |old(~b0_ev~0)|) (<= ~d1_req_up~0 ~b0_req_up~0) (= ~b1_req_up~0 ~d1_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (<= |old(~z_ev~0)| ~z_ev~0)) (not (<= |old(~comp_m1_i~0)| 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= |old(~d0_ev~0)| 0)) (not (<= |old(~b1_ev~0)| 1)) (not (<= |old(~d1_val~0)| 0)) (not (<= |old(~z_req_up~0)| 0)) (not (<= |old(~b0_val_t~0)| |old(~b0_val~0)|)) (not (<= |old(~b0_ev~0)| 0)) (not (= |old(~b0_val~0)| 0)) (= 1 |old(~b1_req_up~0)|) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= |old(~d1_val_t~0)| |old(~d1_val~0)|)) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (= 1 |old(~d1_ev~0)|)) [2019-09-08 06:32:24,490 INFO L439 ceAbstractionStarter]: At program point L493(line 493) the Hoare annotation is: (or (not (<= |old(~d1_ev~0)| 1)) (not (<= |old(~comp_m1_i~0)| 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= |old(~d0_ev~0)| 0)) (not (<= |old(~b1_ev~0)| 1)) (not (<= |old(~d1_val~0)| 0)) (not (<= |old(~z_req_up~0)| 0)) (not (<= |old(~b0_val_t~0)| |old(~b0_val~0)|)) (not (<= |old(~b0_ev~0)| 0)) (not (= |old(~b0_val~0)| 0)) (= 1 |old(~b1_req_up~0)|) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= |old(~d1_val_t~0)| |old(~d1_val~0)|)) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (= 1 |old(~d1_ev~0)|)) [2019-09-08 06:32:24,490 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 483 501) no Hoare annotation was computed. [2019-09-08 06:32:24,491 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 497) no Hoare annotation was computed. [2019-09-08 06:32:24,491 INFO L443 ceAbstractionStarter]: For program point L489(lines 486 500) no Hoare annotation was computed. [2019-09-08 06:32:24,491 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 483 501) no Hoare annotation was computed. [2019-09-08 06:32:24,491 INFO L439 ceAbstractionStarter]: At program point L488(line 488) the Hoare annotation is: (or (not (<= |old(~d1_ev~0)| 1)) (and (= ~d0_val_t~0 ~d0_val~0) (<= ~b0_val_t~0 ~b0_val~0) (= |old(~z_req_up~0)| ~z_req_up~0) (= ~d1_ev~0 |old(~d1_ev~0)|) (= ~z_val~0 ~z_val_t~0) (= |old(~z_val~0)| ~z_val~0) (= 0 ~b0_val~0) (<= ~d1_val_t~0 ~d1_val~0) (= |old(~d0_req_up~0)| ~d0_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~b0_ev~0 |old(~b0_ev~0)|) (<= ~d1_req_up~0 ~b0_req_up~0) (= ~b1_req_up~0 ~d1_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (<= |old(~z_ev~0)| ~z_ev~0)) (not (<= |old(~comp_m1_i~0)| 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= |old(~d0_ev~0)| 0)) (not (<= |old(~b1_ev~0)| 1)) (not (<= |old(~d1_val~0)| 0)) (not (<= |old(~z_req_up~0)| 0)) (not (<= |old(~b0_val_t~0)| |old(~b0_val~0)|)) (not (<= |old(~b0_ev~0)| 0)) (not (= |old(~b0_val~0)| 0)) (= 1 |old(~b1_req_up~0)|) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= |old(~d1_val_t~0)| |old(~d1_val~0)|)) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (= 1 |old(~d1_ev~0)|)) [2019-09-08 06:32:24,491 INFO L439 ceAbstractionStarter]: At program point L488-1(line 488) the Hoare annotation is: (or (not (<= |old(~d1_ev~0)| 1)) (and (<= 2 ~d0_ev~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 ~z_val_t~0) (= |old(~z_val~0)| ~z_val~0) (= 0 ~b0_val~0) (= 0 ~d0_val~0) (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (<= 1 ~b0_val_t~0) (<= 2 ~d1_ev~0) (<= ~d1_val~0 0) (<= ~z_req_up~0 0) (<= 2 ~b1_ev~0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 1) (<= 1 ~d0_val_t~0) (<= ~d1_req_up~0 ~b0_req_up~0) (<= 2 ~z_ev~0) (= ~b1_req_up~0 ~d1_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~d0_req_up~0 1)) (not (<= |old(~comp_m1_i~0)| 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= |old(~d0_ev~0)| 0)) (not (<= |old(~b1_ev~0)| 1)) (not (<= |old(~d1_val~0)| 0)) (not (<= |old(~z_req_up~0)| 0)) (not (<= |old(~b0_val_t~0)| |old(~b0_val~0)|)) (not (<= |old(~b0_ev~0)| 0)) (not (= |old(~b0_val~0)| 0)) (= 1 |old(~b1_req_up~0)|) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= |old(~d1_val_t~0)| |old(~d1_val~0)|)) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (= 1 |old(~d1_ev~0)|)) [2019-09-08 06:32:24,491 INFO L443 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2019-09-08 06:32:24,492 INFO L443 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-09-08 06:32:24,492 INFO L446 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2019-09-08 06:32:24,492 INFO L443 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2019-09-08 06:32:24,492 INFO L443 ceAbstractionStarter]: For program point L187-1(lines 187 192) no Hoare annotation was computed. [2019-09-08 06:32:24,492 INFO L443 ceAbstractionStarter]: For program point update_zEXIT(lines 183 197) no Hoare annotation was computed. [2019-09-08 06:32:24,493 INFO L439 ceAbstractionStarter]: At program point update_zENTRY(lines 183 197) the Hoare annotation is: (let ((.cse12 (= 0 ~d0_ev~0)) (.cse1 (not (<= 1 ~d0_val_t~0))) (.cse9 (not (<= 2 |old(~z_ev~0)|))) (.cse10 (not (<= ~comp_m1_i~0 0))) (.cse11 (= 0 ~b0_ev~0)) (.cse13 (= ~b1_ev~0 0)) (.cse14 (not (<= 2 ~comp_m1_st~0))) (.cse15 (= 1 ~d1_ev~0)) (.cse2 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse3 (= 1 ~b1_req_up~0)) (.cse4 (not (<= 1 ~b0_val_t~0))) (.cse5 (not (<= 1 ~d1_val_t~0))) (.cse6 (= ~b1_ev~0 1)) (.cse8 (= 1 ~b0_req_up~0)) (.cse17 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse20 (not (<= 1 |old(~z_req_up~0)|))) (.cse16 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse0 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse18 (not (<= 1 ~b1_val_t~0))) (.cse7 (and (= |old(~z_req_up~0)| ~z_req_up~0) (= |old(~z_val~0)| ~z_val~0) (<= |old(~z_ev~0)| ~z_ev~0))) (.cse19 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or .cse0 .cse1 .cse2 (not (<= ~b0_ev~0 0)) .cse3 .cse4 .cse5 .cse6 (not (= 0 ~z_val_t~0)) .cse7 .cse8 (or .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 (not (<= ~d0_ev~0 0)) .cse19 .cse20) (or (let ((.cse21 (not (<= |old(~z_val~0)| 0))) (.cse22 (not (<= 0 |old(~z_val~0)|)))) (and (or .cse17 .cse1 (or (or (= 1 ~d0_ev~0) .cse9 .cse10 (not (<= 2 ~b0_ev~0)) .cse12 .cse13 .cse14 .cse15) .cse5 .cse6 .cse21 .cse8 .cse22 .cse2 .cse3 .cse20 .cse4)) (or .cse1 (or .cse9 (not (<= 2 ~d0_ev~0)) .cse10 .cse11 .cse13 .cse14 .cse15) .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 (= 1 ~b0_ev~0) .cse17 .cse22 .cse20))) .cse16 .cse0 .cse18 .cse7 .cse19))) [2019-09-08 06:32:24,493 INFO L443 ceAbstractionStarter]: For program point update_zFINAL(lines 183 197) no Hoare annotation was computed. [2019-09-08 06:32:24,493 INFO L439 ceAbstractionStarter]: At program point update_d1ENTRY(lines 168 182) the Hoare annotation is: (let ((.cse18 (not (<= ~z_val~0 0))) (.cse20 (not (<= 0 ~z_val~0))) (.cse2 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse5 (not (<= 1 ~d0_val_t~0))) (.cse6 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse24 (not (<= ~b0_ev~0 0))) (.cse7 (= 1 ~b1_req_up~0)) (.cse8 (not (<= 1 ~b0_val_t~0))) (.cse9 (not (<= 2 ~z_ev~0))) (.cse10 (not (<= ~comp_m1_i~0 0))) (.cse22 (= 0 ~b0_ev~0)) (.cse11 (= 0 ~d0_ev~0)) (.cse12 (not (= 1 |old(~d1_req_up~0)|))) (.cse13 (= ~b1_ev~0 0)) (.cse14 (not (<= 2 ~comp_m1_st~0))) (.cse15 (= 1 |old(~d1_ev~0)|)) (.cse16 (not (<= 1 ~d1_val_t~0))) (.cse17 (= ~b1_ev~0 1)) (.cse25 (not (= 0 ~z_val_t~0))) (.cse19 (= 1 ~b0_req_up~0)) (.cse1 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse4 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse3 (not (<= 1 ~b1_val_t~0))) (.cse0 (and (= ~d1_ev~0 |old(~d1_ev~0)|) (= |old(~d1_val~0)| ~d1_val~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (.cse21 (not (<= ~d0_ev~0 0))) (.cse23 (not (= ~z_val~0 ~z_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (or .cse4 .cse5 (or .cse6 .cse7 .cse8 (or .cse9 .cse10 (not (<= 2 ~b0_ev~0)) .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or .cse5 (or .cse9 (not (<= 2 ~d0_ev~0)) .cse10 .cse22 .cse12 .cse13 .cse14 .cse15) .cse6 .cse7 .cse8 .cse16 .cse17 .cse18 .cse19 (= 1 ~b0_ev~0) .cse4 .cse20)) .cse23) (or .cse19 .cse10 (not (= 0 ~comp_m1_st~0)) .cse3 (not (<= 2 |old(~d1_ev~0)|)) .cse21 (not (<= |old(~d1_val~0)| 0)) .cse2 .cse5 (not (<= ~z_req_up~0 0)) .cse6 .cse24 .cse0 .cse7 .cse8 .cse16 .cse9 .cse17 .cse18 .cse25 .cse4 .cse20 .cse12) (or .cse2 .cse5 .cse6 .cse24 .cse7 .cse8 (or .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse25 .cse19 .cse1 .cse4 .cse3 .cse0 .cse21 .cse23))) [2019-09-08 06:32:24,493 INFO L443 ceAbstractionStarter]: For program point L172-1(lines 172 177) no Hoare annotation was computed. [2019-09-08 06:32:24,493 INFO L443 ceAbstractionStarter]: For program point update_d1FINAL(lines 168 182) no Hoare annotation was computed. [2019-09-08 06:32:24,493 INFO L443 ceAbstractionStarter]: For program point update_d1EXIT(lines 168 182) no Hoare annotation was computed. [2019-09-08 06:32:24,493 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 06:32:24,494 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~d0_req_up~0)| ~d0_req_up~0) (= |old(~d1_val~0)| ~d1_val~0) (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (= ~b0_req_up~0 |old(~b0_req_up~0)|) (= |old(~z_req_up~0)| ~z_req_up~0) (= |old(~d0_ev~0)| ~d0_ev~0) (= ~d1_ev~0 |old(~d1_ev~0)|) (= |old(~b1_req_up~0)| ~b1_req_up~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~b0_ev~0 |old(~b0_ev~0)|) (= |old(~z_val~0)| ~z_val~0) (<= |old(~z_ev~0)| ~z_ev~0)) [2019-09-08 06:32:24,494 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 06:32:24,494 INFO L439 ceAbstractionStarter]: At program point update_d0ENTRY(lines 153 167) the Hoare annotation is: (let ((.cse24 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse25 (= ~d0_req_up~0 1))) (let ((.cse7 (= 0 ~b0_ev~0)) (.cse1 (= ~b1_ev~0 0)) (.cse11 (not (<= 2 ~comp_m1_st~0))) (.cse19 (= 1 ~b0_ev~0)) (.cse20 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse22 (= 1 ~d1_ev~0)) (.cse18 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse2 (and (= ~d0_val_t~0 ~d0_val~0) .cse24 .cse25)) (.cse0 (not (= |old(~d0_req_up~0)| 1))) (.cse23 (not (<= 2 |old(~d0_ev~0)|))) (.cse3 (= 1 ~b0_req_up~0)) (.cse4 (not (<= ~comp_m1_i~0 0))) (.cse5 (not (<= 1 ~b1_val_t~0))) (.cse6 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (not (<= 1 ~d0_val_t~0))) (.cse9 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse10 (= 1 ~b1_req_up~0)) (.cse12 (not (<= 1 ~b0_val_t~0))) (.cse13 (not (<= 1 ~d1_val_t~0))) (.cse14 (not (<= 2 ~z_ev~0))) (.cse15 (= ~b1_ev~0 1)) (.cse16 (not (<= ~z_val~0 0))) (.cse17 (not (= 0 ~z_val_t~0))) (.cse21 (not (<= 0 ~z_val~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= |old(~d0_ev~0)| 0)) (= 0 |old(~d0_ev~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or (or .cse0 .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse23 .cse3 .cse4 .cse19 .cse20 .cse21 .cse22) .cse18 .cse6 .cse5 .cse2 (not (= ~z_val~0 ~z_val_t~0))) (or .cse0 .cse23 .cse3 .cse4 (not (= 0 ~comp_m1_st~0)) .cse5 (not (<= 2 ~d1_ev~0)) (not (<= ~d1_val~0 0)) (and (= 0 ~d0_val~0) .cse24 .cse25) .cse6 .cse8 (not (<= ~z_req_up~0 0)) .cse9 (not (<= ~b0_ev~0 0)) .cse10 .cse12 (not (= |old(~d0_val~0)| 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse21 (not (= 1 ~d1_req_up~0)))))) [2019-09-08 06:32:24,494 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 157 162) no Hoare annotation was computed. [2019-09-08 06:32:24,494 INFO L443 ceAbstractionStarter]: For program point update_d0FINAL(lines 153 167) no Hoare annotation was computed. [2019-09-08 06:32:24,494 INFO L443 ceAbstractionStarter]: For program point update_d0EXIT(lines 153 167) no Hoare annotation was computed. [2019-09-08 06:32:24,495 INFO L439 ceAbstractionStarter]: At program point evalENTRY(lines 269 306) the Hoare annotation is: (let ((.cse34 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse0 (= ~z_val~0 ~z_val_t~0)) (.cse35 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|))) (let ((.cse29 (not (<= 2 ~d1_ev~0))) (.cse6 (not (<= ~d1_ev~0 1))) (.cse17 (not (= 0 |old(~comp_m1_st~0)|))) (.cse25 (not (<= |old(~z_req_up~0)| 0))) (.cse22 (not (<= ~b0_ev~0 0))) (.cse30 (and .cse34 .cse0 .cse35)) (.cse31 (not (= 0 |old(~z_val_t~0)|))) (.cse2 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse3 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse4 (not (<= 1 ~b1_val_t~0))) (.cse28 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse1 (and .cse34 .cse35)) (.cse5 (= 0 ~b0_ev~0)) (.cse13 (not (<= 2 ~d0_ev~0))) (.cse32 (= 1 ~b0_ev~0)) (.cse24 (not (<= 2 ~b0_ev~0))) (.cse21 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse7 (= 1 ~b1_req_up~0)) (.cse8 (= ~b1_ev~0 0)) (.cse33 (not (<= 2 |old(~comp_m1_st~0)|))) (.cse23 (not (<= 1 ~b0_val_t~0))) (.cse9 (not (<= 1 ~d1_val_t~0))) (.cse10 (= ~b1_ev~0 1)) (.cse11 (not (<= 2 ~z_ev~0))) (.cse12 (not (<= ~z_val~0 0))) (.cse14 (= 1 ~b0_req_up~0)) (.cse15 (not (<= ~comp_m1_i~0 0))) (.cse16 (not (<= 0 ~z_val~0))) (.cse26 (not (<= ~d0_ev~0 0))) (.cse27 (= 0 ~d0_ev~0)) (.cse18 (= 1 ~d1_ev~0)) (.cse19 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse20 (not (<= 1 ~d0_val_t~0)))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4 (and (or (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse19 .cse20 (or (or .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse21 .cse23)) (or (or .cse24 .cse25 .cse21 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse26 .cse27 .cse18) .cse19 .cse20)) .cse28) (or .cse1 (or .cse2 .cse3 .cse19 .cse4 .cse20 .cse21 (or .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse29 .cse26 .cse27) .cse22 .cse23)) (or .cse1 (or .cse2 .cse3 .cse4 (and (or .cse19 .cse20 (or .cse21 (or .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29) .cse23)) (or .cse19 .cse20 (or .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29) .cse21 .cse22 .cse23) (or .cse19 .cse20 (or .cse21 (or .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse29 .cse26 .cse27) .cse23))))) (or .cse6 .cse30 .cse14 .cse15 .cse17 .cse4 .cse26 .cse27 (not (<= 2 ~b1_ev~0)) .cse3 .cse5 .cse20 .cse25 .cse21 .cse7 .cse23 .cse9 .cse11 .cse12 .cse31 .cse2 .cse32 .cse19 .cse16 .cse18) (or .cse8 .cse14 .cse15 .cse4 .cse26 .cse27 .cse3 .cse5 .cse20 .cse21 .cse22 .cse30 .cse7 .cse33 .cse23 .cse9 .cse11 .cse10 .cse12 .cse31 .cse2 .cse19 .cse16 .cse18) (or .cse2 .cse3 .cse4 .cse28 (and .cse1 .cse0) (and (or .cse5 .cse20 .cse21 .cse7 .cse8 .cse33 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse19 .cse16 .cse18) (or (or .cse24 .cse21 .cse7 .cse8 .cse33 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse26 .cse27 .cse18) .cse19 .cse20)))))) [2019-09-08 06:32:24,495 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2019-09-08 06:32:24,496 INFO L439 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse36 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse37 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|))) (let ((.cse33 (and .cse36 .cse37)) (.cse35 (= ~z_val~0 ~z_val_t~0))) (let ((.cse29 (not (<= 2 ~b0_ev~0))) (.cse34 (not (<= 2 ~d1_ev~0))) (.cse25 (not (<= ~d1_ev~0 1))) (.cse1 (and .cse36 .cse35 .cse37)) (.cse27 (not (= 0 |old(~comp_m1_st~0)|))) (.cse5 (not (<= ~d0_ev~0 0))) (.cse6 (= 0 ~d0_ev~0)) (.cse30 (not (<= |old(~z_req_up~0)| 0))) (.cse28 (not (<= ~b0_ev~0 0))) (.cse24 (and (<= 2 ~comp_m1_st~0) .cse35)) (.cse18 (not (= 0 |old(~z_val_t~0)|))) (.cse19 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse4 (not (<= 1 ~b1_val_t~0))) (.cse32 (and .cse35 .cse33)) (.cse31 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse8 (= 0 ~b0_ev~0)) (.cse9 (not (<= 1 ~d0_val_t~0))) (.cse10 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse11 (= 1 ~b1_req_up~0)) (.cse0 (= ~b1_ev~0 0)) (.cse12 (not (<= 2 |old(~comp_m1_st~0)|))) (.cse13 (not (<= 1 ~b0_val_t~0))) (.cse14 (not (<= 1 ~d1_val_t~0))) (.cse16 (= ~b1_ev~0 1)) (.cse15 (not (<= 2 ~z_ev~0))) (.cse17 (not (<= ~z_val~0 0))) (.cse26 (not (<= 2 ~d0_ev~0))) (.cse2 (= 1 ~b0_req_up~0)) (.cse3 (not (<= ~comp_m1_i~0 0))) (.cse20 (= 1 ~b0_ev~0)) (.cse21 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse22 (not (<= 0 ~z_val~0))) (.cse23 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse19 .cse7 .cse4 (and (or (or .cse8 .cse25 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse26 .cse2 .cse3 .cse22 .cse27 .cse23) .cse21 .cse9 .cse10 .cse28 .cse13) (or .cse21 .cse9 (or (or .cse29 .cse25 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse26 .cse2 .cse3 .cse22 .cse27 .cse23) .cse10 .cse13)) (or (or .cse29 .cse30 .cse10 .cse25 .cse11 .cse0 .cse13 .cse14 .cse16 .cse15 .cse17 .cse2 .cse3 .cse22 .cse27 .cse5 .cse6 .cse23) .cse21 .cse9)) .cse31 .cse32) (or .cse24 .cse33 (or .cse19 .cse7 .cse4 (and (or .cse21 .cse9 (or .cse10 (or .cse29 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse26 .cse2 .cse3 .cse22 .cse27 .cse34) .cse13)) (or .cse21 .cse9 (or .cse8 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse26 .cse2 .cse3 .cse22 .cse27 .cse34) .cse10 .cse28 .cse13) (or .cse21 .cse9 (or .cse10 (or .cse29 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse2 .cse3 .cse22 .cse27 .cse34 .cse5 .cse6) .cse13))))) (or .cse24 .cse33 (or .cse19 .cse7 .cse21 .cse4 .cse9 .cse10 (or .cse8 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse2 .cse3 .cse22 .cse27 .cse34 .cse5 .cse6) .cse28 .cse13)) (or .cse25 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse6 (not (<= 2 ~b1_ev~0)) .cse7 .cse8 .cse9 .cse30 .cse10 .cse28 .cse11 .cse13 .cse24 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23) (or .cse19 .cse7 .cse4 .cse32 .cse31 (or .cse8 .cse9 .cse10 .cse11 .cse0 .cse12 .cse13 .cse14 .cse16 .cse15 .cse17 .cse26 .cse2 .cse3 .cse20 .cse21 .cse22 .cse23)))))) [2019-09-08 06:32:24,496 INFO L439 ceAbstractionStarter]: At program point L292(line 292) the Hoare annotation is: (let ((.cse33 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse34 (not (= 0 ~comp_m1_st~0))) (.cse35 (<= |old(~comp_m1_st~0)| ~comp_m1_st~0))) (let ((.cse26 (and .cse33 .cse34 .cse35)) (.cse25 (not (<= ~b0_ev~0 0))) (.cse30 (not (<= 2 ~b0_ev~0))) (.cse24 (not (<= 2 ~d1_ev~0))) (.cse32 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse0 (= ~b1_ev~0 0)) (.cse11 (not (<= 2 |old(~comp_m1_st~0)|))) (.cse15 (= ~b1_ev~0 1)) (.cse29 (not (<= 2 ~d0_ev~0))) (.cse28 (not (<= ~d1_ev~0 1))) (.cse1 (= 1 ~b0_req_up~0)) (.cse2 (not (<= ~comp_m1_i~0 0))) (.cse23 (not (= 0 |old(~comp_m1_st~0)|))) (.cse3 (not (<= 1 ~b1_val_t~0))) (.cse4 (not (<= ~d0_ev~0 0))) (.cse5 (= 0 ~d0_ev~0)) (.cse27 (= ~z_val~0 ~z_val_t~0)) (.cse6 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse7 (= 0 ~b0_ev~0)) (.cse8 (not (<= 1 ~d0_val_t~0))) (.cse31 (not (<= |old(~z_req_up~0)| 0))) (.cse9 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse10 (= 1 ~b1_req_up~0)) (.cse12 (not (<= 1 ~b0_val_t~0))) (.cse13 (not (<= 1 ~d1_val_t~0))) (.cse14 (not (<= 2 ~z_ev~0))) (.cse16 (not (<= ~z_val~0 0))) (.cse17 (not (= 0 |old(~z_val_t~0)|))) (.cse18 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse19 (= 1 ~b0_ev~0)) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse21 (not (<= 0 ~z_val~0))) (.cse22 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or (or .cse18 .cse6 .cse20 .cse3 .cse8 .cse9 (or .cse7 .cse10 .cse0 .cse13 .cse15 .cse14 .cse16 .cse1 .cse2 .cse21 .cse23 .cse24 .cse4 .cse5) .cse25 .cse12) .cse26) (or (and .cse27 .cse26) .cse18 .cse6 .cse3 (and (or (or .cse7 .cse28 .cse10 .cse0 .cse13 .cse15 .cse14 .cse16 .cse29 .cse1 .cse2 .cse21 .cse23 .cse22) .cse20 .cse8 .cse9 .cse25 .cse12) (or .cse20 .cse8 (or (or .cse30 .cse28 .cse10 .cse0 .cse13 .cse15 .cse14 .cse16 .cse29 .cse1 .cse2 .cse21 .cse23 .cse22) .cse9 .cse12)) (or (or .cse30 .cse31 .cse9 .cse28 .cse10 .cse0 .cse12 .cse13 .cse15 .cse14 .cse16 .cse1 .cse2 .cse21 .cse23 .cse4 .cse5 .cse22) .cse20 .cse8)) .cse32) (or .cse26 (or .cse18 .cse6 .cse3 (and (or .cse20 .cse8 (or .cse9 (or .cse30 .cse10 .cse0 .cse13 .cse15 .cse14 .cse16 .cse29 .cse1 .cse2 .cse21 .cse23 .cse24) .cse12)) (or .cse20 .cse8 (or .cse7 .cse10 .cse0 .cse13 .cse15 .cse14 .cse16 .cse29 .cse1 .cse2 .cse21 .cse23 .cse24) .cse9 .cse25 .cse12) (or .cse20 .cse8 (or .cse9 (or .cse30 .cse10 .cse0 .cse13 .cse15 .cse14 .cse16 .cse1 .cse2 .cse21 .cse23 .cse24 .cse4 .cse5) .cse12))))) (or .cse18 .cse6 .cse3 .cse32 (or .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse29 .cse1 .cse2 .cse19 .cse20 .cse21 .cse22)) (or .cse28 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 (not (<= 2 ~b1_ev~0)) (and .cse33 .cse34 .cse27 .cse35) .cse6 .cse7 .cse8 .cse31 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2019-09-08 06:32:24,496 INFO L443 ceAbstractionStarter]: For program point evalEXIT(lines 269 306) no Hoare annotation was computed. [2019-09-08 06:32:24,496 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-09-08 06:32:24,497 INFO L443 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2019-09-08 06:32:24,497 INFO L443 ceAbstractionStarter]: For program point L278(line 278) no Hoare annotation was computed. [2019-09-08 06:32:24,497 INFO L439 ceAbstractionStarter]: At program point L276(line 276) the Hoare annotation is: (let ((.cse36 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse37 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|))) (let ((.cse33 (and .cse36 .cse37)) (.cse35 (= ~z_val~0 ~z_val_t~0))) (let ((.cse29 (not (<= 2 ~b0_ev~0))) (.cse34 (not (<= 2 ~d1_ev~0))) (.cse25 (not (<= ~d1_ev~0 1))) (.cse1 (and .cse36 .cse35 .cse37)) (.cse27 (not (= 0 |old(~comp_m1_st~0)|))) (.cse5 (not (<= ~d0_ev~0 0))) (.cse6 (= 0 ~d0_ev~0)) (.cse30 (not (<= |old(~z_req_up~0)| 0))) (.cse28 (not (<= ~b0_ev~0 0))) (.cse24 (and (<= 2 ~comp_m1_st~0) .cse35)) (.cse18 (not (= 0 |old(~z_val_t~0)|))) (.cse19 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse4 (not (<= 1 ~b1_val_t~0))) (.cse32 (and .cse35 .cse33)) (.cse31 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse8 (= 0 ~b0_ev~0)) (.cse9 (not (<= 1 ~d0_val_t~0))) (.cse10 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse11 (= 1 ~b1_req_up~0)) (.cse0 (= ~b1_ev~0 0)) (.cse12 (not (<= 2 |old(~comp_m1_st~0)|))) (.cse13 (not (<= 1 ~b0_val_t~0))) (.cse14 (not (<= 1 ~d1_val_t~0))) (.cse16 (= ~b1_ev~0 1)) (.cse15 (not (<= 2 ~z_ev~0))) (.cse17 (not (<= ~z_val~0 0))) (.cse26 (not (<= 2 ~d0_ev~0))) (.cse2 (= 1 ~b0_req_up~0)) (.cse3 (not (<= ~comp_m1_i~0 0))) (.cse20 (= 1 ~b0_ev~0)) (.cse21 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse22 (not (<= 0 ~z_val~0))) (.cse23 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse19 .cse7 .cse4 (and (or (or .cse8 .cse25 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse26 .cse2 .cse3 .cse22 .cse27 .cse23) .cse21 .cse9 .cse10 .cse28 .cse13) (or .cse21 .cse9 (or (or .cse29 .cse25 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse26 .cse2 .cse3 .cse22 .cse27 .cse23) .cse10 .cse13)) (or (or .cse29 .cse30 .cse10 .cse25 .cse11 .cse0 .cse13 .cse14 .cse16 .cse15 .cse17 .cse2 .cse3 .cse22 .cse27 .cse5 .cse6 .cse23) .cse21 .cse9)) .cse31 .cse32) (or .cse24 .cse33 (or .cse19 .cse7 .cse4 (and (or .cse21 .cse9 (or .cse10 (or .cse29 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse26 .cse2 .cse3 .cse22 .cse27 .cse34) .cse13)) (or .cse21 .cse9 (or .cse8 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse26 .cse2 .cse3 .cse22 .cse27 .cse34) .cse10 .cse28 .cse13) (or .cse21 .cse9 (or .cse10 (or .cse29 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse2 .cse3 .cse22 .cse27 .cse34 .cse5 .cse6) .cse13))))) (or .cse24 .cse33 (or .cse19 .cse7 .cse21 .cse4 .cse9 .cse10 (or .cse8 .cse11 .cse0 .cse14 .cse16 .cse15 .cse17 .cse2 .cse3 .cse22 .cse27 .cse34 .cse5 .cse6) .cse28 .cse13)) (or .cse25 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse6 (not (<= 2 ~b1_ev~0)) .cse7 .cse8 .cse9 .cse30 .cse10 .cse28 .cse11 .cse13 .cse24 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23) (or .cse19 .cse7 .cse4 .cse32 .cse31 (or .cse8 .cse9 .cse10 .cse11 .cse0 .cse12 .cse13 .cse14 .cse16 .cse15 .cse17 .cse26 .cse2 .cse3 .cse20 .cse21 .cse22 .cse23)))))) [2019-09-08 06:32:24,498 INFO L439 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse34 (<= 2 ~comp_m1_st~0)) (.cse31 (= ~z_val~0 ~z_val_t~0))) (let ((.cse0 (and .cse34 .cse31)) (.cse23 (not (<= |old(~z_req_up~0)| 0))) (.cse17 (not (= 0 |old(~comp_m1_st~0)|))) (.cse18 (not (<= 2 ~d1_ev~0))) (.cse29 (and .cse31 .cse34)) (.cse21 (not (<= ~b0_ev~0 0))) (.cse24 (not (= 0 |old(~z_val_t~0)|))) (.cse1 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse2 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse4 (not (<= 1 ~b1_val_t~0))) (.cse28 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse30 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse32 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse7 (= 0 ~b0_ev~0)) (.cse26 (not (<= 2 ~d0_ev~0))) (.cse27 (not (<= 2 ~b0_ev~0))) (.cse6 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse8 (= 1 ~b1_req_up~0)) (.cse9 (= ~b1_ev~0 0)) (.cse33 (not (<= 2 |old(~comp_m1_st~0)|))) (.cse22 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= 1 ~d1_val_t~0))) (.cse11 (= ~b1_ev~0 1)) (.cse12 (not (<= 2 ~z_ev~0))) (.cse13 (not (<= ~z_val~0 0))) (.cse14 (= 1 ~b0_req_up~0)) (.cse15 (not (<= ~comp_m1_i~0 0))) (.cse16 (not (<= 0 ~z_val~0))) (.cse19 (not (<= ~d0_ev~0 0))) (.cse20 (= 0 ~d0_ev~0)) (.cse25 (= 1 ~d1_ev~0)) (.cse3 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse5 (not (<= 1 ~d0_val_t~0)))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse21 .cse22)) (or .cse14 .cse15 .cse17 .cse4 .cse19 .cse20 (not (<= 2 ~b1_ev~0)) .cse2 .cse7 .cse5 .cse23 .cse6 .cse21 .cse8 .cse22 .cse10 .cse12 .cse13 .cse24 .cse1 .cse3 .cse16 .cse0 .cse25) (or .cse1 .cse2 .cse4 (and (or (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse25) .cse3 .cse5 .cse6 .cse21 .cse22) (or .cse3 .cse5 (or (or .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse25) .cse6 .cse22)) (or (or .cse27 .cse23 .cse6 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse25) .cse3 .cse5)) .cse28 .cse29) (or (or .cse1 .cse2 .cse4 (and (or .cse3 .cse5 (or .cse6 (or .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18) .cse22)) (or .cse3 .cse5 (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18) .cse6 .cse21 .cse22) (or .cse3 .cse5 (or .cse6 (or .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse22)))) .cse29) (or .cse9 .cse14 .cse15 .cse4 .cse19 .cse20 .cse2 .cse7 .cse5 .cse6 .cse21 (and .cse30 .cse31 .cse32) .cse8 .cse33 .cse22 .cse10 .cse12 .cse11 .cse13 .cse24 .cse1 .cse3 .cse16 .cse25) (or .cse1 .cse2 .cse4 .cse28 (and (and .cse30 .cse32) .cse31) (and (or .cse7 .cse5 .cse6 .cse8 .cse9 .cse33 .cse22 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 (= 1 ~b0_ev~0) .cse3 .cse16 .cse25) (or (or .cse27 .cse6 .cse8 .cse9 .cse33 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20 .cse25) .cse3 .cse5)))))) [2019-09-08 06:32:24,498 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2019-09-08 06:32:24,498 INFO L446 ceAbstractionStarter]: At program point L395(line 395) the Hoare annotation is: true [2019-09-08 06:32:24,498 INFO L443 ceAbstractionStarter]: For program point L395-1(line 395) no Hoare annotation was computed. [2019-09-08 06:32:24,498 INFO L443 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 389 407) no Hoare annotation was computed. [2019-09-08 06:32:24,499 INFO L439 ceAbstractionStarter]: At program point L404(lines 393 406) the Hoare annotation is: (let ((.cse8 (= ~b1_ev~0 0)) (.cse15 (= 1 ~b0_req_up~0)) (.cse16 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~b1_val_t~0))) (.cse3 (= 0 stop_simulation_~tmp~2)) (.cse1 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse4 (= 0 ~b0_ev~0)) (.cse5 (not (<= 1 ~d0_val_t~0))) (.cse6 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse7 (= 1 ~b1_req_up~0)) (.cse9 (not (<= 2 ~comp_m1_st~0))) (.cse10 (not (<= 1 ~b0_val_t~0))) (.cse11 (not (<= 1 ~d1_val_t~0))) (.cse13 (not (<= 2 ~z_ev~0))) (.cse12 (= ~b1_ev~0 1)) (.cse14 (not (<= ~z_val~0 0))) (.cse0 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse17 (= 1 ~b0_ev~0)) (.cse18 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse19 (not (<= 0 ~z_val~0))) (.cse20 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~z_val~0 ~z_val_t~0)) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= 2 ~d0_ev~0)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse8 .cse15 .cse16 .cse2 (not (<= ~d0_ev~0 0)) (= 0 ~d0_ev~0) .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14 (not (= 0 ~z_val_t~0)) .cse0 .cse17 .cse18 .cse19 .cse20))) [2019-09-08 06:32:24,499 INFO L446 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 389 407) the Hoare annotation is: true [2019-09-08 06:32:24,499 INFO L443 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 389 407) no Hoare annotation was computed. [2019-09-08 06:32:24,499 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 142 147) no Hoare annotation was computed. [2019-09-08 06:32:24,499 INFO L443 ceAbstractionStarter]: For program point update_b1EXIT(lines 138 152) no Hoare annotation was computed. [2019-09-08 06:32:24,499 INFO L439 ceAbstractionStarter]: At program point update_b1ENTRY(lines 138 152) the Hoare annotation is: (or (not (= ~d0_req_up~0 1)) (and (= |old(~b1_ev~0)| ~b1_ev~0) (= ~b1_req_up~0 ~d1_req_up~0)) (not (<= 2 ~d0_ev~0)) (= 1 ~b0_req_up~0) (not (<= ~comp_m1_i~0 0)) (not (= 0 ~comp_m1_st~0)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 ~d1_ev~0)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= ~d1_val~0 0)) (not (<= 1 ~d0_val_t~0)) (not (<= ~z_req_up~0 0)) (not (<= ~b0_val_t~0 ~b0_val~0)) (not (<= ~b0_ev~0 0)) (not (<= 1 ~b0_val_t~0)) (not (= ~d0_val~0 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 ~z_ev~0)) (not (<= ~z_val~0 0)) (not (= 0 ~z_val_t~0)) (not (<= 0 ~z_val~0)) (not (= |old(~b1_req_up~0)| ~d1_req_up~0)) (not (= 1 ~d1_req_up~0))) [2019-09-08 06:32:24,499 INFO L443 ceAbstractionStarter]: For program point update_b1FINAL(lines 138 152) no Hoare annotation was computed. [2019-09-08 06:32:24,500 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 127 132) no Hoare annotation was computed. [2019-09-08 06:32:24,500 INFO L443 ceAbstractionStarter]: For program point update_b0EXIT(lines 123 137) no Hoare annotation was computed. [2019-09-08 06:32:24,500 INFO L439 ceAbstractionStarter]: At program point update_b0ENTRY(lines 123 137) the Hoare annotation is: (let ((.cse0 (+ ~d1_req_up~0 1))) (or (not (= ~d0_req_up~0 1)) (and (= 0 ~b0_val~0) (= ~b0_ev~0 |old(~b0_ev~0)|) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 .cse0)) (not (<= 2 ~d0_ev~0)) (not (<= ~comp_m1_i~0 0)) (not (= 0 ~comp_m1_st~0)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 ~d1_ev~0)) (not (<= 2 ~b1_ev~0)) (not (<= ~d1_val~0 0)) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= ~z_req_up~0 0)) (not (= |old(~b0_val~0)| 0)) (not (<= ~d1_req_up~0 |old(~b0_req_up~0)|)) (not (<= 1 ~b0_val_t~0)) (not (= ~d0_val~0 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 ~z_ev~0)) (not (<= ~z_val~0 0)) (not (= 0 ~z_val_t~0)) (not (< |old(~b0_req_up~0)| .cse0)) (not (<= 0 ~z_val~0)) (not (= ~b1_req_up~0 ~d1_req_up~0)) (not (= 1 ~d1_req_up~0)))) [2019-09-08 06:32:24,500 INFO L443 ceAbstractionStarter]: For program point update_b0FINAL(lines 123 137) no Hoare annotation was computed. [2019-09-08 06:32:24,500 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2019-09-08 06:32:24,500 INFO L443 ceAbstractionStarter]: For program point is_method1_triggeredFINAL(lines 93 122) no Hoare annotation was computed. [2019-09-08 06:32:24,501 INFO L439 ceAbstractionStarter]: At program point L119(lines 96 121) the Hoare annotation is: (let ((.cse29 (= 1 ~b0_ev~0)) (.cse30 (= 1 ~d1_ev~0))) (let ((.cse11 (not (<= ~b0_ev~0 0))) (.cse28 (not (<= 2 ~d0_ev~0))) (.cse31 (not .cse30)) (.cse27 (= 0 is_method1_triggered_~__retres1~0)) (.cse7 (= 0 ~b0_ev~0)) (.cse20 (= ~b1_ev~0 1)) (.cse19 (not (= 0 ~z_val_t~0))) (.cse25 (not (= 1 ~d0_ev~0))) (.cse9 (not (<= ~z_req_up~0 0))) (.cse10 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse0 (not (<= ~d1_ev~0 1))) (.cse12 (= 1 ~b1_req_up~0)) (.cse24 (= ~b1_ev~0 0)) (.cse13 (not (<= 2 ~comp_m1_st~0))) (.cse14 (not (<= 1 ~b0_val_t~0))) (.cse16 (not (<= 1 ~d1_val_t~0))) (.cse17 (not (<= 2 ~z_ev~0))) (.cse18 (not (<= ~z_val~0 0))) (.cse1 (= 1 ~b0_req_up~0)) (.cse2 (not (<= ~comp_m1_i~0 0))) (.cse23 (not (<= 0 ~z_val~0))) (.cse32 (not .cse29)) (.cse4 (not (<= ~d0_ev~0 0))) (.cse5 (= 0 ~d0_ev~0)) (.cse21 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse6 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse15 (= 1 is_method1_triggered_~__retres1~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse3 (not (<= 1 ~b1_val_t~0))) (.cse8 (not (<= 1 ~d0_val_t~0))) (.cse26 (not (= ~z_val~0 ~z_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not .cse20) .cse21 .cse22 .cse23) (or (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse0 .cse12 .cse24 .cse13 .cse14 .cse16 .cse17 .cse18 .cse1 .cse2 .cse25 .cse22 .cse23) .cse21 .cse6 .cse15 .cse3 .cse26) (or .cse27 .cse21 .cse6 .cse3 .cse26 (or .cse7 .cse8 .cse10 .cse12 .cse24 .cse13 .cse14 .cse16 .cse20 .cse17 .cse18 .cse28 .cse1 .cse2 .cse29 .cse22 .cse23 .cse30)) (or .cse15 (or .cse21 .cse6 .cse3 (or .cse7 .cse8 .cse10 .cse12 .cse24 .cse13 .cse14 .cse16 .cse20 .cse17 .cse18 .cse28 .cse1 .cse2 .cse29 .cse22 .cse23 .cse31))) (or .cse15 (or .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse31 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse20 .cse18 .cse21 .cse29 .cse22 .cse23)) (or .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse20 .cse18 .cse19 .cse21 .cse29 .cse22 .cse23 .cse30) (or .cse15 .cse21 .cse6 (or .cse9 .cse10 .cse0 .cse12 .cse24 .cse13 .cse14 .cse16 .cse17 .cse18 .cse1 .cse2 .cse25 .cse23 .cse32) .cse22 .cse3 .cse8 .cse26) (or (or .cse9 .cse10 .cse0 .cse12 .cse24 .cse13 .cse14 .cse16 .cse17 .cse18 .cse1 .cse2 .cse23 .cse32 .cse4 .cse5) .cse21 .cse6 .cse15 .cse22 .cse3 .cse8 .cse26)))) [2019-09-08 06:32:24,501 INFO L443 ceAbstractionStarter]: For program point is_method1_triggeredEXIT(lines 93 122) no Hoare annotation was computed. [2019-09-08 06:32:24,501 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-09-08 06:32:24,501 INFO L446 ceAbstractionStarter]: At program point is_method1_triggeredENTRY(lines 93 122) the Hoare annotation is: true [2019-09-08 06:32:24,501 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2019-09-08 06:32:24,501 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2019-09-08 06:32:24,502 INFO L439 ceAbstractionStarter]: At program point L225(line 225) the Hoare annotation is: (let ((.cse0 (= |old(~d0_req_up~0)| 1)) (.cse8 (= |old(~d1_val~0)| ~d1_val~0)) (.cse6 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse13 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse14 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse15 (not (<= 2 |old(~d0_ev~0)|))) (.cse34 (= |old(~b1_ev~0)| 0)) (.cse37 (= 1 |old(~b0_req_up~0)|)) (.cse16 (not (<= ~comp_m1_i~0 0))) (.cse17 (not (<= 1 ~b1_val_t~0))) (.cse30 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse25 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse5 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse26 (let ((.cse41 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse42 (= ~d1_req_up~0 1))) (or (and .cse8 .cse41 .cse0 .cse42 .cse6 .cse13 .cse14) (and (= |old(~d0_req_up~0)| ~d0_req_up~0) .cse8 .cse41 .cse42 .cse6 .cse13 .cse14)))) (.cse27 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse7 (= |old(~z_val~0)| ~z_val~0)) (.cse11 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse12 (<= ~b1_val_t~0 ~b1_val~0)) (.cse28 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse31 (= 0 |old(~b0_ev~0)|)) (.cse18 (not (<= 1 ~d0_val_t~0))) (.cse32 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse33 (= 1 |old(~b1_req_up~0)|)) (.cse35 (not (<= 2 ~comp_m1_st~0))) (.cse19 (not (<= 1 ~b0_val_t~0))) (.cse20 (not (<= 1 ~d1_val_t~0))) (.cse21 (not (<= 2 |old(~z_ev~0)|))) (.cse36 (= |old(~b1_ev~0)| 1)) (.cse22 (not (<= |old(~z_val~0)| 0))) (.cse23 (not (= 0 ~z_val_t~0))) (.cse29 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse38 (= 1 |old(~b0_ev~0)|)) (.cse39 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse24 (not (<= 0 |old(~z_val~0)|))) (.cse40 (= 1 |old(~d1_ev~0)|))) (and (let ((.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse9 (<= ~d0_ev~0 0)) (.cse10 (<= ~b0_ev~0 0))) (or (not .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16 (not (= 0 ~comp_m1_st~0)) .cse17 (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (not (<= 2 |old(~b0_ev~0)|)) .cse18 (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) .cse19 (not (= |old(~d0_val~0)| 0)) .cse20 .cse21 .cse22 .cse23 (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) .cse24 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~b1_ev~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~b1_ev~0 1) .cse14) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|)))) (or (and .cse12 (and .cse1 .cse25 .cse4 .cse5 .cse26 .cse27 .cse11 .cse28 .cse7)) .cse29 .cse30 .cse17 (not (= |old(~z_val~0)| ~z_val_t~0)) (or .cse31 .cse18 .cse32 .cse33 .cse34 .cse35 .cse19 .cse20 .cse36 .cse21 .cse22 .cse15 .cse37 .cse16 .cse38 .cse39 .cse24 .cse40)) (or .cse34 .cse37 .cse16 .cse17 (not (<= |old(~d0_ev~0)| 0)) (= 0 |old(~d0_ev~0)|) .cse30 (and .cse1 .cse25 .cse4 .cse5 .cse26 .cse27 .cse7 .cse11 .cse12 .cse28) .cse31 .cse18 .cse32 .cse33 .cse35 .cse19 .cse20 .cse21 .cse36 .cse22 .cse23 .cse29 .cse38 .cse39 .cse24 .cse40)))) [2019-09-08 06:32:24,502 INFO L443 ceAbstractionStarter]: For program point L223(lines 201 239) no Hoare annotation was computed. [2019-09-08 06:32:24,502 INFO L439 ceAbstractionStarter]: At program point L211(line 211) the Hoare annotation is: (let ((.cse0 (not (<= 2 |old(~d0_ev~0)|))) (.cse15 (= |old(~b1_ev~0)| 0)) (.cse18 (= 1 |old(~b0_req_up~0)|)) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~b1_val_t~0))) (.cse11 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse12 (= 0 |old(~b0_ev~0)|)) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse13 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse14 (= 1 |old(~b1_req_up~0)|)) (.cse16 (not (<= 2 ~comp_m1_st~0))) (.cse4 (not (<= 1 ~b0_val_t~0))) (.cse5 (not (<= 1 ~d1_val_t~0))) (.cse6 (not (<= 2 |old(~z_ev~0)|))) (.cse17 (= |old(~b1_ev~0)| 1)) (.cse7 (not (<= |old(~z_val~0)| 0))) (.cse8 (not (= 0 ~z_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse19 (= 1 |old(~b0_ev~0)|)) (.cse20 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse9 (not (<= 0 |old(~z_val~0)|))) (.cse21 (= 1 |old(~d1_ev~0)|))) (and (or (not (= |old(~d0_req_up~0)| 1)) .cse0 .cse1 (not (= 0 ~comp_m1_st~0)) .cse2 (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (and (not (= ~b0_req_up~0 1)) (<= ~b0_val_t~0 ~b0_val~0) (= |old(~z_req_up~0)| ~z_req_up~0) (= ~d1_ev~0 |old(~d1_ev~0)|) (= |old(~z_val~0)| ~z_val~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_ev~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~b1_req_up~0 ~d1_req_up~0) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) (not (<= 2 |old(~b0_ev~0)|)) .cse3 (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) .cse4 (not (= |old(~d0_val~0)| 0)) .cse5 .cse6 .cse7 .cse8 (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) .cse9 (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|))) (or .cse10 .cse11 .cse2 (not (= |old(~z_val~0)| ~z_val_t~0)) (or .cse12 .cse3 .cse13 .cse14 .cse15 .cse16 .cse4 .cse5 .cse17 .cse6 .cse7 .cse0 .cse18 .cse1 .cse19 .cse20 .cse9 .cse21)) (or .cse15 .cse18 .cse1 .cse2 (not (<= |old(~d0_ev~0)| 0)) (= 0 |old(~d0_ev~0)|) .cse11 .cse12 .cse3 .cse13 .cse14 .cse16 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse19 .cse20 .cse9 .cse21))) [2019-09-08 06:32:24,502 INFO L443 ceAbstractionStarter]: For program point L209(lines 201 239) no Hoare annotation was computed. [2019-09-08 06:32:24,504 INFO L439 ceAbstractionStarter]: At program point L232(line 232) the Hoare annotation is: (let ((.cse61 (<= 1 ~d1_val_t~0)) (.cse58 (<= 2 ~comp_m1_st~0)) (.cse18 (<= ~comp_m1_i~0 0)) (.cse13 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse52 (<= ~d1_ev~0 1)) (.cse15 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse16 (= |old(~d0_req_up~0)| 1)) (.cse53 (not (= 1 ~d1_ev~0))) (.cse20 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse22 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse55 (not (= 1 ~b1_req_up~0))) (.cse60 (<= 2 ~d1_ev~0)) (.cse19 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse31 (and .cse52 .cse15 .cse16 .cse53 .cse20 .cse22)) (.cse30 (and .cse13 .cse52 .cse15 .cse53 .cse20 .cse22)) (.cse76 (= ~z_val~0 ~z_val_t~0)) (.cse63 (not (= ~b0_ev~0 0))) (.cse77 (not (<= |old(~b1_ev~0)| 1))) (.cse71 (not (= ~b1_ev~0 0))) (.cse75 (<= ~b1_ev~0 1)) (.cse47 (not (<= 2 |old(~b0_ev~0)|))) (.cse51 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse50 (not (<= 2 |old(~d0_ev~0)|))) (.cse48 (= |old(~b1_ev~0)| 0)) (.cse25 (not (<= 2 |old(~d1_ev~0)|))) (.cse94 (not (<= |old(~z_req_up~0)| 0))) (.cse49 (= |old(~b1_ev~0)| 1)) (.cse89 (not (<= |old(~d1_ev~0)| 1))) (.cse9 (not (= |old(~d1_req_up~0)| |old(~b0_req_up~0)|))) (.cse12 (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|))) (.cse0 (= 1 |old(~b0_req_up~0)|)) (.cse1 (not .cse18)) (.cse2 (not (<= 1 ~b1_val_t~0))) (.cse26 (not (<= |old(~d0_ev~0)| 0))) (.cse27 (= 0 |old(~d0_ev~0)|)) (.cse28 (not (<= 2 |old(~b1_ev~0)|))) (.cse17 (= |old(~d1_val~0)| ~d1_val~0)) (.cse87 (not (= 1 |old(~d1_req_up~0)|))) (.cse85 (= ~d1_val_t~0 |old(~d1_val~0)|)) (.cse86 (<= ~d1_val~0 |old(~d1_val~0)|)) (.cse11 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse7 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse8 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse3 (= ~d0_val_t~0 ~d0_val~0)) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse5 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse81 (<= 1 |old(~z_req_up~0)|)) (.cse23 (<= ~b1_val_t~0 ~b1_val~0)) (.cse24 (= |old(~z_val~0)| ~z_val~0)) (.cse29 (<= ~d1_val_t~0 ~d1_val~0)) (.cse32 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse33 (= 0 |old(~b0_ev~0)|)) (.cse34 (not (<= 1 ~d0_val_t~0))) (.cse35 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse36 (= 1 |old(~b1_req_up~0)|)) (.cse37 (not .cse58)) (.cse38 (not (<= 1 ~b0_val_t~0))) (.cse39 (not .cse61)) (.cse40 (not (<= 2 |old(~z_ev~0)|))) (.cse41 (not (<= |old(~z_val~0)| 0))) (.cse42 (not (= 0 ~z_val_t~0))) (.cse43 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse44 (= 1 |old(~b0_ev~0)|)) (.cse45 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse46 (not (<= 0 |old(~z_val~0)|))) (.cse90 (= 1 |old(~d1_ev~0)|)) (.cse68 (not (= 0 ~d0_ev~0))) (.cse62 (<= 2 ~b1_ev~0)) (.cse69 (not (= 1 ~d0_ev~0))) (.cse91 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse70 (<= ~d0_ev~0 1)) (.cse21 (= ~b0_ev~0 |old(~b0_ev~0)|))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 (let ((.cse6 (let ((.cse10 (let ((.cse14 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))) (or (and .cse13 .cse14 .cse15) (and .cse14 .cse15 .cse16))))) (or (and .cse10 .cse11 .cse8) (and .cse10 .cse11 .cse12))))) (or (and .cse6 .cse7 .cse8) (and .cse9 .cse6 .cse7))) .cse23 .cse24) .cse25 .cse26 .cse27 .cse28 (and .cse3 .cse7 .cse4 .cse5 .cse11 .cse24 .cse29 .cse9 (or .cse30 .cse31) .cse23 .cse12 .cse21) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (or (and (or .cse45 .cse34 (or .cse47 .cse35 .cse36 .cse48 .cse37 .cse38 .cse39 .cse49 .cse40 .cse0 .cse1 .cse25 .cse26 .cse27)) (or .cse33 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse39 .cse49 .cse40 .cse50 .cse0 .cse1 .cse44 .cse45 .cse25)) .cse42 .cse43 .cse32 .cse2 .cse51 (and .cse23 (and .cse9 .cse3 .cse7 .cse4 .cse5 (or (and .cse13 .cse52 .cse15 .cse53 .cse20 .cse21 .cse22) (and .cse52 .cse15 .cse16 .cse53 .cse20 .cse21 .cse22)) .cse11 .cse12 .cse24) .cse29) (and (let ((.cse59 (<= 2 ~d0_ev~0)) (.cse64 (<= 2 ~z_ev~0))) (or (and .cse3 .cse4 .cse5 (let ((.cse54 (let ((.cse56 (let ((.cse57 (and .cse58 .cse17 .cse59 .cse60 .cse61 .cse62 .cse18 .cse19 .cse63 .cse20 .cse21 .cse64 .cse22))) (or (and .cse57 .cse15 .cse16) (and .cse57 .cse13 .cse15))))) (or (and .cse55 .cse11 .cse12 .cse56) (and .cse55 .cse11 .cse8 .cse56))))) (or (and .cse54 .cse7 .cse8) (and .cse9 .cse54 .cse7)))) (and .cse3 (and (let ((.cse65 (let ((.cse66 (let ((.cse67 (and .cse58 .cse17 (<= 2 ~b0_ev~0) .cse60 .cse68 .cse61 .cse18 .cse69 .cse19 .cse70 .cse71 .cse20 .cse21 .cse64 .cse22))) (or (and .cse13 .cse67 .cse15) (and .cse67 .cse15 .cse16))))) (or (and .cse55 .cse66 .cse11 .cse12) (and .cse55 .cse66 .cse11 .cse8))))) (or (and .cse65 .cse8) (and .cse9 .cse65))) .cse7 .cse4 .cse5)) (and .cse3 .cse4 .cse5 (let ((.cse72 (let ((.cse73 (let ((.cse74 (and .cse58 .cse17 .cse59 .cse60 .cse61 .cse18 .cse19 .cse71 .cse63 .cse20 .cse75 .cse64 .cse22))) (or (and .cse15 .cse74 .cse16) (and .cse13 .cse15 .cse74))))) (or (and .cse55 .cse73 .cse11 .cse8) (and .cse55 .cse73 .cse11 .cse12))))) (or (and .cse9 .cse7 .cse72) (and .cse7 .cse8 .cse72))) .cse21))) .cse76 .cse23)) (or .cse48 .cse0 .cse1 .cse2 .cse25 .cse26 .cse27 .cse77 .cse32 .cse33 .cse34 .cse35 (not (<= |old(~b0_ev~0)| 0)) .cse36 (and .cse3 .cse7 .cse4 .cse5 (let ((.cse78 (let ((.cse79 (let ((.cse80 (and .cse17 .cse60 .cse68 .cse18 .cse69 .cse19 .cse70 .cse71 .cse63 .cse20 .cse75 .cse22))) (or (and .cse15 .cse80 .cse16) (and .cse13 .cse15 .cse80))))) (or (and .cse55 .cse11 .cse12 .cse79) (and .cse55 .cse11 .cse8 .cse79))))) (or (and .cse8 .cse78) (and .cse9 .cse78))) .cse23 .cse21 .cse24) .cse37 .cse38 .cse39 .cse40 .cse49 .cse41 .cse42 .cse43 .cse45 .cse46 (and .cse3 .cse7 .cse4 .cse5 .cse11 .cse24 .cse29 .cse9 (or .cse31 .cse30) .cse23 .cse12 .cse21)) (let ((.cse82 (and .cse52 .cse62 .cse91 .cse53 .cse20 .cse22)) (.cse83 (and .cse52 .cse91 .cse53 .cse63 .cse20 .cse75 .cse22))) (or (and (or (and .cse9 .cse3 .cse7 .cse4 .cse5 .cse81 (or (and .cse82 .cse15 .cse16) (and .cse13 .cse82 .cse15)) .cse11 .cse12 .cse21) (and .cse9 .cse3 .cse7 .cse4 (or (and .cse83 .cse15 .cse16) (and .cse13 .cse83 .cse15)) .cse5 .cse81 .cse11 .cse12 .cse21)) .cse76 .cse23 .cse29) (and .cse23 (or (and .cse3 (and (and (let ((.cse84 (or (and .cse85 .cse86 .cse82) (and (and .cse82 .cse87) .cse17)))) (or (and .cse84 .cse15 .cse16) (and .cse13 .cse84 .cse15))) .cse11) .cse8) .cse7 .cse4 .cse5 .cse81 .cse21 .cse24) (and .cse3 .cse4 .cse5 .cse81 .cse21 (and .cse7 .cse8 (and .cse11 (let ((.cse88 (or (and .cse17 (and .cse8 .cse87 .cse83)) (and .cse85 .cse86 .cse83)))) (or (and .cse88 .cse15 .cse16) (and .cse13 .cse88 .cse15))))) .cse24)) .cse29) .cse43 .cse32 .cse2 .cse51 (or .cse33 .cse34 .cse35 .cse89 .cse36 .cse48 .cse37 .cse38 .cse39 .cse49 .cse40 .cse41 .cse50 .cse0 .cse1 .cse44 .cse45 .cse46 .cse90))) (let ((.cse92 (and .cse52 .cse68 .cse18 .cse69 .cse91 .cse70 .cse53 .cse71 .cse20 .cse75 .cse22))) (or (and .cse3 .cse7 .cse4 .cse5 .cse81 .cse11 .cse24 .cse29 .cse9 (or (and .cse13 .cse92 .cse15) (and .cse92 .cse15 .cse16)) .cse23 .cse12 .cse21) .cse89 .cse48 .cse0 .cse1 .cse2 .cse26 .cse27 .cse77 (and .cse3 .cse4 .cse5 .cse81 (and .cse7 .cse8 (and .cse11 (let ((.cse93 (or (and .cse17 (and .cse8 .cse87 .cse92)) (and .cse85 .cse86 .cse92)))) (or (and .cse13 .cse93 .cse15) (and .cse93 .cse15 .cse16))))) .cse23 .cse21 .cse24 .cse29) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse49 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse90)) (or (not .cse16) .cse50 .cse1 (not (= 0 ~comp_m1_st~0)) .cse2 .cse25 .cse28 (not (<= |old(~d1_val~0)| 0)) .cse47 .cse34 .cse94 (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) .cse38 (not (= |old(~d0_val~0)| 0)) .cse39 .cse40 .cse41 .cse42 (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) .cse46 .cse12 .cse87) (or .cse43 .cse32 .cse2 .cse51 (or .cse33 .cse34 .cse94 .cse35 .cse36 .cse48 .cse37 .cse38 .cse39 .cse49 .cse40 .cse41 .cse50 .cse0 .cse1 .cse44 .cse45 .cse46 .cse25)) (or .cse48 .cse0 .cse1 .cse2 .cse25 .cse26 .cse27 .cse32 .cse33 .cse34 .cse94 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse49 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (let ((.cse95 (and .cse52 .cse68 .cse15 .cse62 .cse18 .cse69 .cse91 .cse70 .cse53 .cse20 .cse21 .cse22))) (or .cse89 (and .cse9 .cse3 .cse7 .cse4 .cse5 .cse81 .cse11 .cse23 .cse12 .cse24 .cse29 (or (and .cse95 .cse13) (and .cse95 .cse16))) .cse0 .cse1 .cse2 .cse26 .cse27 .cse28 (and (and (and (let ((.cse96 (or (and .cse17 (and .cse87 .cse95)) (and .cse85 .cse95 .cse86)))) (or (and .cse96 .cse16) (and .cse13 .cse96))) .cse11) .cse7 .cse8) .cse3 .cse4 .cse5 .cse81 .cse23 .cse24 .cse29) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse90))))) [2019-09-08 06:32:24,504 INFO L443 ceAbstractionStarter]: For program point L230(lines 198 240) no Hoare annotation was computed. [2019-09-08 06:32:24,505 INFO L439 ceAbstractionStarter]: At program point L218(line 218) the Hoare annotation is: (let ((.cse32 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse20 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse2 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse6 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse14 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse21 (= 0 |old(~b0_ev~0)|)) (.cse23 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse24 (= 1 |old(~b1_req_up~0)|)) (.cse0 (= |old(~b1_ev~0)| 0)) (.cse25 (not (<= 2 ~comp_m1_st~0))) (.cse29 (= |old(~b1_ev~0)| 1)) (.cse17 (= 1 |old(~b0_req_up~0)|)) (.cse33 (= 1 |old(~b0_ev~0)|)) (.cse34 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse36 (= 1 |old(~d1_ev~0)|)) (.cse10 (= |old(~d0_req_up~0)| 1)) (.cse37 (not (<= 2 |old(~d0_ev~0)|))) (.cse18 (not (<= ~comp_m1_i~0 0))) (.cse13 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse19 (not (<= 1 ~b1_val_t~0))) (.cse3 (<= ~b0_val_t~0 ~b0_val~0)) (.cse4 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse5 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse7 (= |old(~z_val~0)| ~z_val~0)) (.cse8 (= |old(~d1_val~0)| ~d1_val~0)) (.cse9 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse11 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse12 (<= ~b1_val_t~0 ~b1_val~0)) (.cse15 (= ~d0_req_up~0 1)) (.cse16 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse22 (not (<= 1 ~d0_val_t~0))) (.cse26 (not (<= 1 ~b0_val_t~0))) (.cse27 (not (<= 1 ~d1_val_t~0))) (.cse28 (not (<= 2 |old(~z_ev~0)|))) (.cse30 (not (<= |old(~z_val~0)| 0))) (.cse31 (not (= 0 ~z_val_t~0))) (.cse35 (not (<= 0 |old(~z_val~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18 .cse19 (not (<= |old(~d0_ev~0)| 0)) (= 0 |old(~d0_ev~0)|) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse32 .cse20 .cse19 (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (= ~z_val~0 ~z_val_t~0) .cse12) (not (= |old(~z_val~0)| ~z_val_t~0)) (or .cse21 .cse22 .cse23 .cse24 .cse0 .cse25 .cse26 .cse27 .cse29 .cse28 .cse30 .cse37 .cse17 .cse18 .cse33 .cse34 .cse35 .cse36)) (let ((.cse38 (not (= 1 ~b1_req_up~0))) (.cse39 (not (= ~b0_req_up~0 1))) (.cse40 (= 0 ~d0_val~0)) (.cse41 (<= ~b0_ev~0 0))) (or (not .cse10) .cse37 .cse18 (and .cse38 .cse39 .cse3 .cse4 .cse5 .cse7 .cse40 .cse8 .cse9 .cse41 .cse11 .cse12 .cse13 .cse15 .cse16) (not (= 0 ~comp_m1_st~0)) .cse19 (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (and .cse38 .cse39 .cse3 .cse4 .cse5 (not (= ~b1_ev~0 1)) .cse7 .cse40 .cse8 .cse9 .cse41 .cse11 .cse12 (<= ~b1_ev~0 1) .cse15 .cse16) (not (<= 2 |old(~b0_ev~0)|)) .cse22 (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) .cse26 (not (= |old(~d0_val~0)| 0)) .cse27 .cse28 .cse30 .cse31 (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) .cse35 (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|)))))) [2019-09-08 06:32:24,505 INFO L443 ceAbstractionStarter]: For program point L216(lines 201 239) no Hoare annotation was computed. [2019-09-08 06:32:24,505 INFO L439 ceAbstractionStarter]: At program point update_channelsENTRY(lines 198 240) the Hoare annotation is: (let ((.cse16 (= |old(~z_val~0)| ~z_val~0)) (.cse32 (not (= 0 ~z_val_t~0))) (.cse33 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse6 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse3 (not (<= 1 ~b1_val_t~0))) (.cse10 (= ~d0_val_t~0 ~d0_val~0)) (.cse11 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse12 (<= ~b0_val_t~0 ~b0_val~0)) (.cse13 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse14 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse15 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse17 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse18 (= |old(~d1_val~0)| ~d1_val~0)) (.cse19 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse20 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse22 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse23 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse24 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse21 (<= ~b1_val_t~0 ~b1_val~0)) (.cse7 (= 0 |old(~b0_ev~0)|)) (.cse37 (not (<= 2 |old(~d0_ev~0)|))) (.cse38 (not (<= 2 |old(~b0_ev~0)|))) (.cse9 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse25 (= 1 |old(~b1_req_up~0)|)) (.cse0 (= |old(~b1_ev~0)| 0)) (.cse26 (not (<= 2 ~comp_m1_st~0))) (.cse27 (not (<= 1 ~b0_val_t~0))) (.cse28 (not (<= 1 ~d1_val_t~0))) (.cse30 (= |old(~b1_ev~0)| 1)) (.cse29 (not (<= 2 |old(~z_ev~0)|))) (.cse31 (not (<= |old(~z_val~0)| 0))) (.cse1 (= 1 |old(~b0_req_up~0)|)) (.cse2 (not (<= ~comp_m1_i~0 0))) (.cse35 (not (<= 0 |old(~z_val~0)|))) (.cse4 (not (<= |old(~d0_ev~0)| 0))) (.cse5 (= 0 |old(~d0_ev~0)|)) (.cse36 (= 1 |old(~d1_ev~0)|)) (.cse34 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse8 (not (<= 1 ~d0_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= |old(~b0_ev~0)| 0)) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (or (and .cse13 .cse14 .cse16 (= 0 ~b0_val~0) (= 0 ~d0_val~0) .cse18 .cse19 .cse20 .cse22 .cse23 (<= ~d1_req_up~0 ~b0_req_up~0) (= ~b1_req_up~0 ~d1_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~d0_req_up~0 1) .cse24) (not (= |old(~d0_req_up~0)| 1)) .cse37 .cse2 (not (= 0 ~comp_m1_st~0)) .cse3 (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) .cse38 .cse8 (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) .cse27 (not (= |old(~d0_val~0)| 0)) .cse28 .cse29 .cse31 .cse32 (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) .cse35 (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|))) (or .cse33 .cse6 .cse3 (not (= |old(~z_val~0)| ~z_val_t~0)) (and (and .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24)) (= ~z_val~0 ~z_val_t~0) .cse21) (and (or .cse7 .cse8 .cse9 .cse25 .cse0 .cse26 .cse27 .cse28 .cse30 .cse29 .cse31 .cse37 .cse1 .cse2 (= 1 |old(~b0_ev~0)|) .cse34 .cse35 .cse36) (or (or .cse38 .cse9 .cse25 .cse0 .cse26 .cse27 .cse28 .cse30 .cse29 .cse31 .cse1 .cse2 .cse35 .cse4 .cse5 .cse36) .cse34 .cse8))))) [2019-09-08 06:32:24,506 INFO L439 ceAbstractionStarter]: At program point L204(line 204) the Hoare annotation is: (let ((.cse0 (not (<= 2 |old(~d0_ev~0)|))) (.cse15 (= |old(~b1_ev~0)| 0)) (.cse18 (= 1 |old(~b0_req_up~0)|)) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~b1_val_t~0))) (.cse11 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse12 (= 0 |old(~b0_ev~0)|)) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse13 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse14 (= 1 |old(~b1_req_up~0)|)) (.cse16 (not (<= 2 ~comp_m1_st~0))) (.cse4 (not (<= 1 ~b0_val_t~0))) (.cse5 (not (<= 1 ~d1_val_t~0))) (.cse6 (not (<= 2 |old(~z_ev~0)|))) (.cse17 (= |old(~b1_ev~0)| 1)) (.cse7 (not (<= |old(~z_val~0)| 0))) (.cse8 (not (= 0 ~z_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse19 (= 1 |old(~b0_ev~0)|)) (.cse20 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse9 (not (<= 0 |old(~z_val~0)|))) (.cse21 (= 1 |old(~d1_ev~0)|))) (and (or (not (= |old(~d0_req_up~0)| 1)) (and (= |old(~z_req_up~0)| ~z_req_up~0) (= ~d1_ev~0 |old(~d1_ev~0)|) (= |old(~z_val~0)| ~z_val~0) (= 0 ~b0_val~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~d0_ev~0)| ~d0_ev~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~b0_ev~0 |old(~b0_ev~0)|) (<= ~d1_req_up~0 ~b0_req_up~0) (= ~b1_req_up~0 ~d1_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) .cse0 .cse1 (not (= 0 ~comp_m1_st~0)) .cse2 (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (not (<= 2 |old(~b0_ev~0)|)) .cse3 (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) .cse4 (not (= |old(~d0_val~0)| 0)) .cse5 .cse6 .cse7 .cse8 (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) .cse9 (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|))) (or .cse10 .cse11 .cse2 (not (= |old(~z_val~0)| ~z_val_t~0)) (or .cse12 .cse3 .cse13 .cse14 .cse15 .cse16 .cse4 .cse5 .cse17 .cse6 .cse7 .cse0 .cse18 .cse1 .cse19 .cse20 .cse9 .cse21)) (or .cse15 .cse18 .cse1 .cse2 (not (<= |old(~d0_ev~0)| 0)) (= 0 |old(~d0_ev~0)|) .cse11 .cse12 .cse3 .cse13 .cse14 .cse16 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse19 .cse20 .cse9 .cse21))) [2019-09-08 06:32:24,506 INFO L443 ceAbstractionStarter]: For program point update_channelsEXIT(lines 198 240) no Hoare annotation was computed. [2019-09-08 06:32:24,506 INFO L443 ceAbstractionStarter]: For program point L202(lines 201 239) no Hoare annotation was computed. [2019-09-08 06:32:24,506 INFO L439 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 307 339) the Hoare annotation is: (let ((.cse8 (= |old(~b1_ev~0)| 0)) (.cse15 (= 1 ~b0_req_up~0)) (.cse16 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~b1_val_t~0))) (.cse20 (not (<= |old(~d0_ev~0)| 0))) (.cse21 (= 0 |old(~d0_ev~0)|)) (.cse1 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse4 (= 0 |old(~b0_ev~0)|)) (.cse5 (not (<= 1 ~d0_val_t~0))) (.cse6 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse22 (not (<= |old(~b0_ev~0)| 0))) (.cse3 (and (= ~d1_ev~0 |old(~d1_ev~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~b0_ev~0 |old(~b0_ev~0)|) (<= |old(~z_ev~0)| ~z_ev~0))) (.cse7 (= 1 ~b1_req_up~0)) (.cse9 (not (<= 2 ~comp_m1_st~0))) (.cse10 (not (<= 1 ~b0_val_t~0))) (.cse11 (not (<= 1 ~d1_val_t~0))) (.cse13 (not (<= 2 |old(~z_ev~0)|))) (.cse12 (= |old(~b1_ev~0)| 1)) (.cse14 (not (<= ~z_val~0 0))) (.cse23 (not (= 0 ~z_val_t~0))) (.cse0 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse17 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse18 (not (<= 0 ~z_val~0))) (.cse19 (= 1 |old(~d1_ev~0)|))) (and (or .cse0 .cse1 .cse2 (not (= ~z_val~0 ~z_val_t~0)) .cse3 (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= 2 |old(~d0_ev~0)|)) .cse15 .cse16 (= 1 |old(~b0_ev~0)|) .cse17 .cse18 .cse19) (or (or (not (<= 2 |old(~b0_ev~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 .cse19) .cse17 .cse5))) (or .cse3 (not (<= |old(~d1_ev~0)| 1)) .cse15 .cse16 .cse2 .cse20 .cse1 .cse5 (not (<= ~z_req_up~0 0)) .cse6 .cse22 .cse7 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14 .cse23 .cse0 .cse17 .cse18 .cse19) (or .cse8 .cse15 .cse16 .cse2 .cse20 .cse21 .cse1 .cse4 .cse5 .cse6 .cse22 .cse3 .cse7 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14 .cse23 .cse0 .cse17 .cse18 .cse19))) [2019-09-08 06:32:24,506 INFO L443 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2019-09-08 06:32:24,506 INFO L443 ceAbstractionStarter]: For program point L331-1(lines 307 339) no Hoare annotation was computed. [2019-09-08 06:32:24,507 INFO L443 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2019-09-08 06:32:24,507 INFO L443 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2019-09-08 06:32:24,507 INFO L443 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 307 339) no Hoare annotation was computed. [2019-09-08 06:32:24,507 INFO L443 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2019-09-08 06:32:24,507 INFO L439 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse18 (not (= ~b0_ev~0 0))) (.cse19 (not (= 0 ~d0_ev~0))) (.cse20 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse11 (<= ~d0_ev~0 0)) (.cse12 (<= ~b0_ev~0 0)) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse6 (and (not (= ~b1_ev~0 0)) .cse18 (<= ~b1_ev~0 1) .cse19 .cse20)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~d1_ev~0 1)) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse7 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse15 (and (<= |old(~b1_ev~0)| ~b1_ev~0) .cse18 .cse19 (<= 2 ~b1_ev~0) .cse20)) (.cse9 (= |old(~z_val~0)| ~z_val~0)) (.cse8 (= ~z_val~0 ~z_val_t~0)) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (let ((.cse14 (= 1 ~d0_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse12 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse14 .cse12 .cse15 .cse9))) .cse8 .cse13 .cse10) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= 1 ~b0_val_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and .cse1 (let ((.cse16 (= ~b0_ev~0 1)) (.cse17 (<= ~d0_ev~0 1))) (or (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse17 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7 .cse17 .cse15 .cse9))) .cse8 .cse13 .cse10) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (not (<= |old(~d1_val~0)| 0)) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|))))) [2019-09-08 06:32:24,508 INFO L439 ceAbstractionStarter]: At program point L415(line 415) the Hoare annotation is: (or (and (= |old(~z_req_up~0)| ~z_req_up~0) (= ~d1_ev~0 |old(~d1_ev~0)|) (= ~z_val~0 ~z_val_t~0) (= |old(~z_val~0)| ~z_val~0) (= 0 ~b0_val~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~b0_ev~0 |old(~b0_ev~0)|) (<= ~d1_req_up~0 ~b0_req_up~0) (= ~b1_req_up~0 ~d1_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) (not (= |old(~d0_req_up~0)| 1)) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (<= 1 ~b0_val_t~0)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|))) [2019-09-08 06:32:24,508 INFO L439 ceAbstractionStarter]: At program point L415-1(line 415) the Hoare annotation is: (let ((.cse0 (= ~d0_val_t~0 ~d0_val~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (<= ~d1_ev~0 1)) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse5 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse6 (= ~z_val~0 ~z_val_t~0)) (.cse7 (= |old(~z_val~0)| ~z_val~0)) (.cse8 (<= ~d1_val_t~0 ~d1_val~0)) (.cse9 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (not (= 1 ~d1_ev~0))) (.cse12 (<= ~b0_ev~0 0)) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse14 (<= |old(~z_ev~0)| ~z_ev~0))) (or (not (= |old(~d0_req_up~0)| 1)) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |old(~b1_ev~0)| ~b1_ev~0) .cse14) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (<= 1 ~b0_val_t~0)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~b1_ev~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~b1_ev~0 1) .cse14))) [2019-09-08 06:32:24,508 INFO L443 ceAbstractionStarter]: For program point start_simulationEXIT(lines 408 450) no Hoare annotation was computed. [2019-09-08 06:32:24,509 INFO L439 ceAbstractionStarter]: At program point L436(line 436) the Hoare annotation is: (let ((.cse7 (= ~z_val~0 ~z_val_t~0)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse12 (not (= 1 ~d1_ev~0))) (.cse17 (<= 2 ~d0_ev~0)) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse5 (not (= 0 ~d0_ev~0))) (.cse19 (= 0 ~comp_m1_st~0)) (.cse6 (not (= ~b0_ev~0 0))) (.cse8 (not (= ~b1_ev~0 1))) (.cse9 (= |old(~z_val~0)| ~z_val~0)) (.cse10 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~d1_ev~0)) (.cse11 (<= ~d0_ev~0 0)) (.cse13 (not (= ~b1_ev~0 0))) (.cse14 (not (= ~b0_ev~0 1))) (.cse15 (<= ~b1_val_t~0 ~b1_val~0)) (.cse16 (<= 2 ~z_ev~0))) (or (not (= |old(~d0_req_up~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (and .cse7 .cse15 (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse12 .cse13 .cse6 .cse14 .cse8 .cse9 .cse16) .cse10) (and .cse15 (and .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse19 .cse13 .cse6 .cse14 .cse8 .cse9 .cse16) .cse10) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (<= 1 ~b0_val_t~0)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse18 .cse11 .cse13 .cse14 .cse15 .cse16) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|)))) [2019-09-08 06:32:24,509 INFO L439 ceAbstractionStarter]: At program point L434(line 434) the Hoare annotation is: (let ((.cse6 (= ~z_val~0 ~z_val_t~0)) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse10 (not (= 1 ~d1_ev~0))) (.cse11 (not (= ~b1_ev~0 0))) (.cse5 (not (= ~b0_ev~0 0))) (.cse12 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~b1_ev~0 1))) (.cse8 (= |old(~z_val~0)| ~z_val~0)) (.cse14 (<= 2 ~z_ev~0)) (.cse9 (<= ~d1_val_t~0 ~d1_val~0))) (or (not (= |old(~d0_req_up~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ~d0_ev~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~d0_ev~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (and .cse6 .cse13 (and .cse0 .cse1 .cse2 (<= 2 ~d0_ev~0) .cse3 .cse4 .cse10 .cse11 .cse5 .cse12 .cse7 .cse8 .cse14) .cse9) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (<= 1 ~b0_val_t~0)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|)))) [2019-09-08 06:32:24,509 INFO L439 ceAbstractionStarter]: At program point L434-1(line 434) the Hoare annotation is: (let ((.cse5 (not (= 0 ~d0_ev~0))) (.cse11 (<= ~d0_ev~0 0)) (.cse7 (= ~z_val~0 ~z_val_t~0)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse16 (= 1 ~d1_ev~0)) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse17 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (not (= ~b1_ev~0 0))) (.cse6 (not (= ~b0_ev~0 0))) (.cse13 (not (= ~b0_ev~0 1))) (.cse8 (not (= ~b1_ev~0 1))) (.cse9 (= |old(~z_val~0)| ~z_val~0)) (.cse15 (<= 2 ~z_ev~0)) (.cse14 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~d1_val_t~0 ~d1_val~0))) (or (not (= |old(~d0_req_up~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13 .cse14 .cse15) (not (<= |old(~d1_val~0)| 0)) (and .cse7 .cse14 (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse12 .cse6 .cse13 .cse8 .cse9 .cse15) .cse10) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (and (and .cse0 .cse16 .cse1 .cse2 .cse17 .cse3 .cse4 .cse12 .cse6 .cse13 .cse8 .cse9 .cse15) .cse14 .cse10) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (<= 1 ~b0_val_t~0)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|)))) [2019-09-08 06:32:24,510 INFO L439 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse6 (= ~z_val~0 ~z_val_t~0)) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse10 (not (= 1 ~d1_ev~0))) (.cse11 (not (= ~b1_ev~0 0))) (.cse5 (not (= ~b0_ev~0 0))) (.cse12 (not (= ~b0_ev~0 1))) (.cse7 (not (= ~b1_ev~0 1))) (.cse8 (= |old(~z_val~0)| ~z_val~0)) (.cse14 (<= 2 ~z_ev~0)) (.cse9 (<= ~d1_val_t~0 ~d1_val~0))) (or (not (= |old(~d0_req_up~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ~d0_ev~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~d0_ev~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (and .cse6 .cse13 (and .cse0 .cse1 .cse2 (<= 2 ~d0_ev~0) .cse3 .cse4 .cse10 .cse11 .cse5 .cse12 .cse7 .cse8 .cse14) .cse9) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (<= 1 ~b0_val_t~0)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|)))) [2019-09-08 06:32:24,510 INFO L443 ceAbstractionStarter]: For program point L430-1(line 430) no Hoare annotation was computed. [2019-09-08 06:32:24,510 INFO L439 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~comp_m1_st~0)) (.cse20 (<= 2 ~d1_ev~0)) (.cse14 (not (= ~b0_ev~0 1))) (.cse19 (<= 2 ~d0_ev~0)) (.cse6 (not (= ~b0_ev~0 0))) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse5 (not (= 0 ~d0_ev~0))) (.cse17 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse18 (= 0 ~comp_m1_st~0)) (.cse8 (not (= ~b1_ev~0 1))) (.cse9 (= |old(~z_val~0)| ~z_val~0)) (.cse11 (<= ~d0_ev~0 0)) (.cse12 (not (= 1 ~d1_ev~0))) (.cse13 (not (= ~b1_ev~0 0))) (.cse16 (<= 2 ~z_ev~0)) (.cse7 (= ~z_val~0 ~z_val_t~0)) (.cse15 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse18 .cse6 .cse7 .cse9 .cse10 (<= 2 ~b1_ev~0) .cse11 .cse12 .cse14 .cse15 .cse16) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (and .cse7 .cse15 (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse12 .cse13 .cse6 .cse14 .cse8 .cse9 .cse16) .cse10) (not (<= 1 ~b0_val_t~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse8 .cse9 .cse10 .cse20 .cse11 .cse13 .cse14 .cse15 .cse16) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and (and .cse1 .cse2 .cse3 .cse19 .cse4 .cse20 .cse18 .cse13 .cse6 .cse14 .cse8 .cse9 .cse16) .cse15 .cse10) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (not (<= |old(~d1_val~0)| 0)) (and (let ((.cse21 (<= 2 ~b0_ev~0))) (or (and .cse1 (and .cse2 .cse3 .cse19 .cse4 .cse21 .cse18 .cse12 .cse13 .cse8 .cse9 .cse16)) (and (and .cse2 .cse3 .cse19 .cse18 .cse12 .cse13 .cse6 .cse8 .cse9 .cse16) .cse1 (<= ~b0_ev~0 0) .cse4) (and .cse1 (and .cse2 .cse3 .cse4 .cse21 .cse5 .cse17 .cse18 .cse8 .cse9 .cse11 .cse12 .cse13 .cse16)))) .cse7 .cse15 .cse10) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)))) [2019-09-08 06:32:24,510 INFO L443 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2019-09-08 06:32:24,511 INFO L439 ceAbstractionStarter]: At program point L422-1(lines 419 444) the Hoare annotation is: (let ((.cse0 (<= 2 ~comp_m1_st~0)) (.cse20 (<= 2 ~d1_ev~0)) (.cse14 (not (= ~b0_ev~0 1))) (.cse19 (<= 2 ~d0_ev~0)) (.cse6 (not (= ~b0_ev~0 0))) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse5 (not (= 0 ~d0_ev~0))) (.cse17 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse18 (= 0 ~comp_m1_st~0)) (.cse8 (not (= ~b1_ev~0 1))) (.cse9 (= |old(~z_val~0)| ~z_val~0)) (.cse11 (<= ~d0_ev~0 0)) (.cse12 (not (= 1 ~d1_ev~0))) (.cse13 (not (= ~b1_ev~0 0))) (.cse16 (<= 2 ~z_ev~0)) (.cse7 (= ~z_val~0 ~z_val_t~0)) (.cse15 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse18 .cse6 .cse7 .cse9 .cse10 (<= 2 ~b1_ev~0) .cse11 .cse12 .cse14 .cse15 .cse16) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (and .cse7 .cse15 (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse12 .cse13 .cse6 .cse14 .cse8 .cse9 .cse16) .cse10) (not (<= 1 ~b0_val_t~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse8 .cse9 .cse10 .cse20 .cse11 .cse13 .cse14 .cse15 .cse16) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and (and .cse1 .cse2 .cse3 .cse19 .cse4 .cse20 .cse18 .cse13 .cse6 .cse14 .cse8 .cse9 .cse16) .cse15 .cse10) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (not (<= |old(~d1_val~0)| 0)) (and (let ((.cse21 (<= 2 ~b0_ev~0))) (or (and .cse1 (and .cse2 .cse3 .cse19 .cse4 .cse21 .cse18 .cse12 .cse13 .cse8 .cse9 .cse16)) (and (and .cse2 .cse3 .cse19 .cse18 .cse12 .cse13 .cse6 .cse8 .cse9 .cse16) .cse1 (<= ~b0_ev~0 0) .cse4) (and .cse1 (and .cse2 .cse3 .cse4 .cse21 .cse5 .cse17 .cse18 .cse8 .cse9 .cse11 .cse12 .cse13 .cse16)))) .cse7 .cse15 .cse10) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)))) [2019-09-08 06:32:24,511 INFO L439 ceAbstractionStarter]: At program point L418(line 418) the Hoare annotation is: (let ((.cse21 (<= ~comp_m1_i~0 0)) (.cse22 (not (= ~b0_ev~0 0))) (.cse23 (not (= 0 ~d0_ev~0))) (.cse24 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse17 (= 1 ~d1_ev~0))) (let ((.cse18 (= 1 ~d0_ev~0)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse13 (not .cse17)) (.cse9 (= ~b1_ev~0 1)) (.cse6 (and (not (= ~b1_ev~0 0)) .cse22 (<= ~b1_ev~0 1) .cse23 .cse24)) (.cse4 (<= ~d1_ev~0 1)) (.cse20 (= ~b0_ev~0 1)) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse7 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse16 (= 0 ~comp_m1_st~0)) (.cse19 (and (<= |old(~b1_ev~0)| ~b1_ev~0) .cse22 .cse23 (<= 2 ~b1_ev~0) .cse21 .cse24)) (.cse8 (= ~z_val~0 ~z_val_t~0)) (.cse10 (= |old(~z_val~0)| ~z_val~0)) (.cse11 (<= ~d1_val_t~0 ~d1_val~0)) (.cse12 (<= ~d0_ev~0 0)) (.cse14 (<= ~b0_ev~0 0)) (.cse15 (<= ~b1_val_t~0 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse17 .cse12 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse18 .cse14 .cse15) (and .cse8 .cse15 .cse11 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse16 .cse18 .cse14 .cse19 .cse10)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse18 .cse15) (not (<= 1 ~b0_val_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse15) (and .cse1 .cse8 .cse15 (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse7 .cse16 (<= ~d0_ev~0 1) .cse19 .cse10) .cse11) (not (<= 2 |old(~d0_ev~0)|)) (not .cse21) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (and .cse1 .cse2 .cse3 .cse5 .cse7 .cse16 .cse19 .cse8 .cse10 .cse11 .cse17 .cse12 .cse14 .cse15) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (not (<= |old(~d1_val~0)| 0)) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|))))) [2019-09-08 06:32:24,511 INFO L439 ceAbstractionStarter]: At program point start_simulationENTRY(lines 408 450) the Hoare annotation is: (or (and (= |old(~z_req_up~0)| ~z_req_up~0) (= ~d1_ev~0 |old(~d1_ev~0)|) (= ~z_val~0 ~z_val_t~0) (= |old(~z_val~0)| ~z_val~0) (= 0 ~b0_val~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~b0_ev~0 |old(~b0_ev~0)|) (<= ~d1_req_up~0 ~b0_req_up~0) (= ~b1_req_up~0 ~d1_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) (not (= |old(~d0_req_up~0)| 1)) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (<= 1 ~b0_val_t~0)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|))) [2019-09-08 06:32:24,511 INFO L439 ceAbstractionStarter]: At program point L416(line 416) the Hoare annotation is: (let ((.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~d1_ev~0 1)) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse6 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse7 (= ~z_val~0 ~z_val_t~0)) (.cse8 (= |old(~z_val~0)| ~z_val~0)) (.cse9 (<= ~d1_val_t~0 ~d1_val~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (not (= 1 ~d1_ev~0))) (.cse12 (<= ~b0_ev~0 0)) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse14 (<= |old(~z_ev~0)| ~z_ev~0))) (or (not (= |old(~d0_req_up~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~b1_ev~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~b1_ev~0 1) .cse14) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (<= 1 ~b0_val_t~0)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= 0 |old(~z_val~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |old(~b1_ev~0)| ~b1_ev~0) .cse14) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|)))) [2019-09-08 06:32:24,512 INFO L439 ceAbstractionStarter]: At program point L445(lines 408 450) the Hoare annotation is: (or (not (= |old(~d0_req_up~0)| 1)) (and (not (= 1 ~b1_req_up~0)) (not (= ~b0_req_up~0 1)) (let ((.cse0 (and (not (= 1 ~d1_ev~0)) (and (and (not (= 0 ~d0_ev~0)) (and (not (= ~b0_ev~0 0)) (not (= ~b1_ev~0 0)))) (not (= 1 ~d0_ev~0)))))) (or (and (<= 2 ~comp_m1_st~0) .cse0) (and .cse0 (= 0 ~comp_m1_st~0)))) (not (= ~b0_ev~0 1)) (not (= ~b1_ev~0 1)) (= |old(~z_val~0)| ~z_val~0)) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (<= 1 ~b0_val_t~0)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|))) [2019-09-08 06:32:24,512 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-09-08 06:32:24,512 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-09-08 06:32:24,512 INFO L439 ceAbstractionStarter]: At program point L435(line 435) the Hoare annotation is: (let ((.cse0 (= 1 ~d1_ev~0))) (let ((.cse17 (= ~z_val~0 ~z_val_t~0)) (.cse15 (<= 2 ~comp_m1_st~0)) (.cse4 (<= 2 ~d0_ev~0)) (.cse19 (not .cse0)) (.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse16 (not (= 0 ~d0_ev~0))) (.cse6 (= 0 ~comp_m1_st~0)) (.cse8 (not (= ~b0_ev~0 0))) (.cse10 (not (= ~b1_ev~0 1))) (.cse11 (= |old(~z_val~0)| ~z_val~0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= ~d0_ev~0 0)) (.cse7 (not (= ~b1_ev~0 0))) (.cse9 (not (= ~b0_ev~0 1))) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse12 (<= 2 ~z_ev~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) (not (= |old(~d0_req_up~0)| 1)) (and .cse15 .cse1 .cse2 .cse3 .cse5 .cse16 .cse8 .cse17 .cse10 .cse11 .cse14 .cse18 .cse19 .cse7 .cse9 .cse13 .cse12) (not (<= 2 |old(~d0_ev~0)|)) (not (<= ~comp_m1_i~0 0)) (not (= 0 |old(~comp_m1_st~0)|)) (not (<= 1 ~b1_val_t~0)) (not (<= 2 |old(~d1_ev~0)|)) (not (<= 2 |old(~b1_ev~0)|)) (not (<= |old(~d1_val~0)| 0)) (and .cse17 .cse13 (and .cse15 .cse1 .cse2 .cse4 .cse3 .cse5 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse14) (not (<= 2 |old(~b0_ev~0)|)) (not (<= 1 ~d0_val_t~0)) (not (<= |old(~z_req_up~0)| 0)) (not (= |old(~b0_val~0)| 0)) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (and .cse1 .cse2 .cse3 .cse5 .cse16 .cse6 .cse8 .cse10 .cse11 .cse14 .cse0 .cse18 .cse7 .cse9 .cse13 .cse12) (not (<= 1 ~b0_val_t~0)) (not (= |old(~d0_val~0)| 0)) (not (<= 1 ~d1_val_t~0)) (not (<= 2 |old(~z_ev~0)|)) (not (<= |old(~z_val~0)| 0)) (not (= 0 |old(~z_val_t~0)|)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (not (= 1 |old(~d1_req_up~0)|))))) [2019-09-08 06:32:24,512 INFO L443 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2019-09-08 06:32:24,512 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 06:32:24,512 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~d0_val~0) (= ~d0_val_t~0 ~d0_val~0) (not (= ~b0_req_up~0 1)) (<= ~d1_ev~0 1) (<= ~b0_val_t~0 ~b0_val~0) (= 0 ~comp_m1_st~0) (<= ~d1_val~0 0) (<= ~z_req_up~0 0) (<= ~comp_m1_i~0 0) (<= ~d0_ev~0 0) (= 0 ~z_val_t~0) (not (= 1 ~d1_ev~0)) (<= ~b0_ev~0 0) (= ~z_val~0 ~z_val_t~0) (<= ~b1_ev~0 1) (not (= ~b1_ev~0 1)) (= 0 ~b0_val~0) (<= ~d1_req_up~0 ~b0_req_up~0) (= ~b1_req_up~0 ~d1_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (<= ~d1_val_t~0 ~d1_val~0)) [2019-09-08 06:32:24,512 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 06:32:24,513 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 06:32:24,513 INFO L443 ceAbstractionStarter]: For program point init_modelFINAL(lines 451 482) no Hoare annotation was computed. [2019-09-08 06:32:24,513 INFO L443 ceAbstractionStarter]: For program point init_modelEXIT(lines 451 482) no Hoare annotation was computed. [2019-09-08 06:32:24,513 INFO L439 ceAbstractionStarter]: At program point init_modelENTRY(lines 451 482) the Hoare annotation is: (or (not (<= |old(~d1_ev~0)| 1)) (and (= ~d0_val_t~0 ~d0_val~0) (<= ~b0_val_t~0 ~b0_val~0) (= |old(~z_req_up~0)| ~z_req_up~0) (= ~d1_ev~0 |old(~d1_ev~0)|) (= |old(~z_val~0)| ~z_val~0) (= 0 ~b0_val~0) (<= ~d1_val_t~0 ~d1_val~0) (= |old(~d0_req_up~0)| ~d0_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~b0_ev~0 |old(~b0_ev~0)|) (<= ~d1_req_up~0 ~b0_req_up~0) (= ~b1_req_up~0 ~d1_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (<= |old(~z_ev~0)| ~z_ev~0)) (not (<= |old(~comp_m1_i~0)| 0)) (not (= 0 ~comp_m1_st~0)) (not (<= |old(~d0_ev~0)| 0)) (not (<= |old(~b1_ev~0)| 1)) (not (<= |old(~d1_val~0)| 0)) (not (<= |old(~z_req_up~0)| 0)) (not (<= |old(~b0_val_t~0)| |old(~b0_val~0)|)) (not (<= |old(~b0_ev~0)| 0)) (not (= |old(~b0_val~0)| 0)) (= 1 |old(~b1_req_up~0)|) (not (<= |old(~d1_req_up~0)| |old(~b0_req_up~0)|)) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (not (<= |old(~z_val~0)| 0)) (not (= 0 ~z_val_t~0)) (not (< |old(~b0_req_up~0)| (+ |old(~d1_req_up~0)| 1))) (not (<= |old(~d1_val_t~0)| |old(~d1_val~0)|)) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (not (<= 0 |old(~z_val~0)|)) (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|)) (= 1 |old(~d1_ev~0)|)) [2019-09-08 06:32:24,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:32:24 BoogieIcfgContainer [2019-09-08 06:32:24,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 06:32:24,576 INFO L168 Benchmark]: Toolchain (without parser) took 209381.22 ms. Allocated memory was 131.1 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 86.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-08 06:32:24,576 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 131.1 MB. Free memory is still 105.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-08 06:32:24,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.06 ms. Allocated memory was 131.1 MB in the beginning and 197.1 MB in the end (delta: 66.1 MB). Free memory was 86.4 MB in the beginning and 171.6 MB in the end (delta: -85.2 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-09-08 06:32:24,578 INFO L168 Benchmark]: Boogie Preprocessor took 45.40 ms. Allocated memory is still 197.1 MB. Free memory was 171.6 MB in the beginning and 168.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-09-08 06:32:24,578 INFO L168 Benchmark]: RCFGBuilder took 588.63 ms. Allocated memory is still 197.1 MB. Free memory was 168.8 MB in the beginning and 136.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. [2019-09-08 06:32:24,579 INFO L168 Benchmark]: TraceAbstraction took 208317.85 ms. Allocated memory was 197.1 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 136.8 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-08 06:32:24,582 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 131.1 MB. Free memory is still 105.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 425.06 ms. Allocated memory was 131.1 MB in the beginning and 197.1 MB in the end (delta: 66.1 MB). Free memory was 86.4 MB in the beginning and 171.6 MB in the end (delta: -85.2 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.40 ms. Allocated memory is still 197.1 MB. Free memory was 171.6 MB in the beginning and 168.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 588.63 ms. Allocated memory is still 197.1 MB. Free memory was 168.8 MB in the beginning and 136.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208317.85 ms. Allocated memory was 197.1 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 136.8 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(\old(d0_req_up) == 1) || (((((!(1 == b1_req_up) && !(b0_req_up == 1)) && ((2 <= comp_m1_st && !(1 == d1_ev) && (!(0 == d0_ev) && !(b0_ev == 0) && !(b1_ev == 0)) && !(1 == d0_ev)) || ((!(1 == d1_ev) && (!(0 == d0_ev) && !(b0_ev == 0) && !(b1_ev == 0)) && !(1 == d0_ev)) && 0 == comp_m1_st))) && !(b0_ev == 1)) && !(b1_ev == 1)) && \old(z_val) == z_val)) || !(2 <= \old(d0_ev))) || !(comp_m1_i <= 0)) || !(0 == \old(comp_m1_st))) || !(1 <= b1_val_t)) || !(2 <= \old(d1_ev))) || !(2 <= \old(b1_ev))) || !(\old(d1_val) <= 0)) || !(2 <= \old(b0_ev))) || !(1 <= d0_val_t)) || !(\old(z_req_up) <= 0)) || !(\old(b0_val) == 0)) || !(\old(d1_req_up) <= \old(b0_req_up))) || !(1 <= b0_val_t)) || !(\old(d0_val) == 0)) || !(1 <= d1_val_t)) || !(2 <= \old(z_ev))) || !(\old(z_val) <= 0)) || !(0 == \old(z_val_t))) || !(\old(b0_req_up) < \old(d1_req_up) + 1)) || !(0 <= \old(z_val))) || !(\old(b1_req_up) == \old(d1_req_up))) || !(1 == \old(d1_req_up)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((1 <= __retres1 || !(d1_val_t <= d1_val)) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || (((((((((((((((((((0 == b0_ev || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == comp_m1_st)) || 1 == d1_ev) || !(d0_val_t == d0_val)) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || !(1 <= b0_val_t)) && ((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (((((((((((((!(2 <= b0_ev) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == comp_m1_st)) || 1 == d1_ev) || !(b0_val_t <= b0_val)) || !(1 <= b0_val_t))) && ((((((((((((((((((!(2 <= b0_ev) || !(z_req_up <= 0)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == comp_m1_st)) || !(d0_ev <= 0)) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || !(1 <= d0_val_t)))) || !(z_val == z_val_t)) && (((((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || __retres1 == 0) || !(1 <= b1_val_t)) || !(z_val == z_val_t)) || ((((((((((((((((((0 == b0_ev || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev) && (((((((((((((((((!(2 <= b0_ev) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(d0_ev <= 0)) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || !(1 <= d0_val_t))))) && (((((((((((((((((((((((b1_ev == 0 || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(1 <= b1_val_t)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(b1_val_t <= b1_val)) || 0 == b0_ev) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || 1 == b1_req_up) || __retres1 == 0) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || b1_ev == 1) || !(z_val <= 0)) || !(0 == z_val_t)) || !(d1_val_t <= d1_val)) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev)) && (1 <= __retres1 || (((((((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(d0_val_t == d0_val)) || !(1 <= b1_val_t)) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || ((((((((((((0 == b0_ev || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == comp_m1_st)) || !(2 <= d1_ev)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(b0_ev <= 0)) || !(1 <= b0_val_t))) && ((((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || ((((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (!(b0_val_t <= b0_val) || (((((((((((!(2 <= b0_ev) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == comp_m1_st)) || !(2 <= d1_ev)) || !(1 <= b0_val_t)) && (((((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (((((((((((0 == b0_ev || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == comp_m1_st)) || !(2 <= d1_ev)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || !(1 <= b0_val_t))) && ((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (!(b0_val_t <= b0_val) || ((((((((((((!(2 <= b0_ev) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == comp_m1_st)) || !(2 <= d1_ev)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(1 <= b0_val_t)))) || 1 <= __retres1)) && (((((((((((((((((((((((1 == b0_req_up || !(comp_m1_i <= 0)) || !(0 == comp_m1_st)) || !(1 <= b1_val_t)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(2 <= b1_ev)) || 1 <= __retres1) || !(b1_val_t <= b1_val)) || 0 == b0_ev) || !(1 <= d0_val_t)) || !(z_req_up <= 0)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || !(z_val <= 0)) || !(0 == z_val_t)) || !(d1_val_t <= d1_val)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((((2 <= comp_m1_st && z_val == z_val_t) || (((((((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(d0_val_t == d0_val)) || !(1 <= b1_val_t)) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || ((((((((((((0 == b0_ev || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || !(2 <= d1_ev)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(b0_ev <= 0)) || !(1 <= b0_val_t)) && (((((((((((((((((((((((1 == b0_req_up || !(comp_m1_i <= 0)) || !(0 == \old(comp_m1_st))) || !(1 <= b1_val_t)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(2 <= b1_ev)) || !(b1_val_t <= b1_val)) || 0 == b0_ev) || !(1 <= d0_val_t)) || !(\old(z_req_up) <= 0)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || 1 == b1_req_up) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || !(z_val <= 0)) || !(0 == \old(z_val_t))) || !(d1_val_t <= d1_val)) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || (2 <= comp_m1_st && z_val == z_val_t)) || 1 == d1_ev)) && (((((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || (((((((((((((((((((0 == b0_ev || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || !(1 <= b0_val_t)) && ((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (((((((((((((!(2 <= b0_ev) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(b0_val_t <= b0_val)) || !(1 <= b0_val_t))) && ((((((((((((((((((!(2 <= b0_ev) || !(\old(z_req_up) <= 0)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || !(d0_ev <= 0)) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || !(1 <= d0_val_t)))) || !(z_val == \old(z_val_t))) || (z_val == z_val_t && 2 <= comp_m1_st))) && ((((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || ((((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (!(b0_val_t <= b0_val) || (((((((((((!(2 <= b0_ev) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || !(2 <= d1_ev)) || !(1 <= b0_val_t)) && (((((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (((((((((((0 == b0_ev || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || !(2 <= d1_ev)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || !(1 <= b0_val_t))) && ((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (!(b0_val_t <= b0_val) || ((((((((((((!(2 <= b0_ev) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || !(2 <= d1_ev)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(1 <= b0_val_t)))) || (z_val == z_val_t && 2 <= comp_m1_st))) && (((((((((((((((((((((((b1_ev == 0 || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(1 <= b1_val_t)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(b1_val_t <= b1_val)) || 0 == b0_ev) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || ((\old(z_req_up) == z_req_up && z_val == z_val_t) && comp_m1_st == \old(comp_m1_st))) || 1 == b1_req_up) || !(2 <= \old(comp_m1_st))) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || b1_ev == 1) || !(z_val <= 0)) || !(0 == \old(z_val_t))) || !(d1_val_t <= d1_val)) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev)) && (((((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || !(z_val == \old(z_val_t))) || ((\old(z_req_up) == z_req_up && comp_m1_st == \old(comp_m1_st)) && z_val == z_val_t)) || ((((((((((((((((((0 == b0_ev || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= \old(comp_m1_st))) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev) && (((((((((((((((((!(2 <= b0_ev) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= \old(comp_m1_st))) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(d0_ev <= 0)) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || !(1 <= d0_val_t)))) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((b1_ev == 0 || ((\old(z_req_up) == z_req_up && z_val == z_val_t) && comp_m1_st == \old(comp_m1_st))) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(1 <= b1_val_t)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(b1_val_t <= b1_val)) || 0 == b0_ev) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || !(2 <= \old(comp_m1_st))) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || b1_ev == 1) || !(z_val <= 0)) || !(0 == \old(z_val_t))) || !(d1_val_t <= d1_val)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev) && (((((((2 <= comp_m1_st && z_val == z_val_t) || !(d1_val_t <= d1_val)) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || ((((((((((((((((((((0 == b0_ev || !(d1_ev <= 1)) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || !(1 <= b0_val_t)) && ((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || ((((((((((((((!(2 <= b0_ev) || !(d1_ev <= 1)) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(b0_val_t <= b0_val)) || !(1 <= b0_val_t))) && (((((((((((((((((((!(2 <= b0_ev) || !(\old(z_req_up) <= 0)) || !(b0_val_t <= b0_val)) || !(d1_ev <= 1)) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || !(d0_ev <= 0)) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || !(1 <= d0_val_t)))) || !(z_val == \old(z_val_t))) || (z_val == z_val_t && \old(z_req_up) == z_req_up && comp_m1_st == \old(comp_m1_st)))) && (((2 <= comp_m1_st && z_val == z_val_t) || (\old(z_req_up) == z_req_up && comp_m1_st == \old(comp_m1_st))) || ((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || ((((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (!(b0_val_t <= b0_val) || (((((((((((!(2 <= b0_ev) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || !(2 <= d1_ev)) || !(1 <= b0_val_t)) && (((((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (((((((((((0 == b0_ev || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || !(2 <= d1_ev)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || !(1 <= b0_val_t))) && ((!(d0_val_t == d0_val) || !(1 <= d0_val_t)) || (!(b0_val_t <= b0_val) || ((((((((((((!(2 <= b0_ev) || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || !(2 <= d1_ev)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(1 <= b0_val_t))))) && (((2 <= comp_m1_st && z_val == z_val_t) || (\old(z_req_up) == z_req_up && comp_m1_st == \old(comp_m1_st))) || (((((((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(d0_val_t == d0_val)) || !(1 <= b1_val_t)) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || ((((((((((((0 == b0_ev || 1 == b1_req_up) || b1_ev == 0) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(0 == \old(comp_m1_st))) || !(2 <= d1_ev)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(b0_ev <= 0)) || !(1 <= b0_val_t))) && (((((((((((((((((((((((((!(d1_ev <= 1) || ((\old(z_req_up) == z_req_up && z_val == z_val_t) && comp_m1_st == \old(comp_m1_st))) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 == \old(comp_m1_st))) || !(1 <= b1_val_t)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(2 <= b1_ev)) || !(b1_val_t <= b1_val)) || 0 == b0_ev) || !(1 <= d0_val_t)) || !(\old(z_req_up) <= 0)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || 1 == b1_req_up) || !(1 <= b0_val_t)) || (2 <= comp_m1_st && z_val == z_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || !(z_val <= 0)) || !(0 == \old(z_val_t))) || !(d1_val_t <= d1_val)) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev)) && (((((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || (z_val == z_val_t && \old(z_req_up) == z_req_up && comp_m1_st == \old(comp_m1_st))) || !(z_val == \old(z_val_t))) || ((((((((((((((((0 == b0_ev || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= \old(comp_m1_st))) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(d1_ev <= 1) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(1 <= b1_val_t)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(b1_val_t <= b1_val)) || 0 == b0_ev) || !(1 <= d0_val_t)) || !(z_req_up <= 0)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || 1 == b1_req_up) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || 1 == __retres1) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || !(z_val <= 0)) || !(0 == z_val_t)) || !(b1_ev == 1)) || !(d1_val_t <= d1_val)) || !(d0_val_t == d0_val)) || !(0 <= z_val)) && ((((((((((((((((((((((0 == b0_ev || !(1 <= d0_val_t)) || !(z_req_up <= 0)) || !(b0_val_t <= b0_val)) || !(b0_ev <= 0)) || !(d1_ev <= 1)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(1 == d0_ev)) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || !(d1_val_t <= d1_val)) || !(b1_val_t <= b1_val)) || 1 == __retres1) || !(1 <= b1_val_t)) || !(z_val == z_val_t))) && (((((0 == __retres1 || !(d1_val_t <= d1_val)) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || !(z_val == z_val_t)) || ((((((((((((((((0 == b0_ev || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev)) && (1 == __retres1 || ((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || ((((((((((((((((0 == b0_ev || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || !(1 == d1_ev))) && (1 == __retres1 || ((((((((((((((((((((b1_ev == 0 || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(1 <= b1_val_t)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(1 == d1_ev)) || !(b1_val_t <= b1_val)) || 0 == b0_ev) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || b1_ev == 1) || !(z_val <= 0)) || !(d1_val_t <= d1_val)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val))) && (((((((((((((((((((((((b1_ev == 0 || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(1 <= b1_val_t)) || !(d0_ev <= 0)) || 0 == d0_ev) || 0 == __retres1) || !(b1_val_t <= b1_val)) || 0 == b0_ev) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || b1_ev == 1) || !(z_val <= 0)) || !(0 == z_val_t)) || !(d1_val_t <= d1_val)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev)) && (((((((1 == __retres1 || !(d1_val_t <= d1_val)) || !(b1_val_t <= b1_val)) || (((((((((((((!(z_req_up <= 0) || !(b0_val_t <= b0_val)) || !(d1_ev <= 1)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(1 == d0_ev)) || !(0 <= z_val)) || !(1 == b0_ev)) || !(d0_val_t == d0_val)) || !(1 <= b1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t))) && ((((((((((((((((((((((!(z_req_up <= 0) || !(b0_val_t <= b0_val)) || !(d1_ev <= 1)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || !(z_val <= 0)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(0 <= z_val)) || !(1 == b0_ev)) || !(d0_ev <= 0)) || 0 == d0_ev) || !(d1_val_t <= d1_val)) || !(b1_val_t <= b1_val)) || 1 == __retres1) || !(d0_val_t == d0_val)) || !(1 <= b1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((2 <= comp_m1_st && d0_val_t == d0_val) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && !(0 == d0_ev)) && !(b0_ev == 0)) && z_val == z_val_t) && !(b1_ev == 1)) && \old(z_val) == z_val) && d1_val_t <= d1_val) && d0_ev <= 0) && !(1 == d1_ev)) && !(b1_ev == 0)) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= z_ev) || ((((((((((((((((d0_val_t == d0_val && !(1 == b1_req_up)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && !(0 == d0_ev)) && \old(z_req_up) == z_req_up) && 0 == comp_m1_st) && !(b0_ev == 0)) && z_val == z_val_t) && \old(z_val) == z_val) && d1_val_t <= d1_val) && 2 <= b1_ev) && d0_ev <= 0) && !(1 == d1_ev)) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= z_ev)) || !(2 <= \old(d1_ev))) || !(2 <= \old(b1_ev))) || (((z_val == z_val_t && b1_val_t <= b1_val) && (((((((((((2 <= comp_m1_st && d0_val_t == d0_val) && !(1 == b1_req_up)) && 2 <= d0_ev) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && !(1 == d1_ev)) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b0_ev == 1)) && !(b1_ev == 1)) && \old(z_val) == z_val) && 2 <= z_ev) && d1_val_t <= d1_val)) || !(1 <= b0_val_t)) || (((((((((((((((d0_val_t == d0_val && !(1 == b1_req_up)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && !(0 == d0_ev)) && 0 == comp_m1_st) && !(b0_ev == 0)) && !(b1_ev == 1)) && \old(z_val) == z_val) && d1_val_t <= d1_val) && 2 <= d1_ev) && d0_ev <= 0) && !(b1_ev == 0)) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= z_ev)) || !(1 == \old(d1_req_up))) || !(\old(d0_req_up) == 1)) || ((((((((((((((d0_val_t == d0_val && !(1 == b1_req_up)) && !(b0_req_up == 1)) && 2 <= d0_ev) && b0_val_t <= b0_val) && 2 <= d1_ev) && 0 == comp_m1_st) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b0_ev == 1)) && !(b1_ev == 1)) && \old(z_val) == z_val) && 2 <= z_ev) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || !(2 <= \old(d0_ev))) || !(comp_m1_i <= 0)) || !(0 == \old(comp_m1_st))) || !(1 <= b1_val_t)) || !(\old(z_val) == \old(z_val_t))) || !(\old(d1_val) <= 0)) || ((((((d0_val_t == d0_val && (((((((((!(1 == b1_req_up) && !(b0_req_up == 1)) && 2 <= d0_ev) && b0_val_t <= b0_val) && 2 <= b0_ev) && 0 == comp_m1_st) && !(1 == d1_ev)) && !(b1_ev == 0)) && !(b1_ev == 1)) && \old(z_val) == z_val) && 2 <= z_ev) || ((((((((((((!(1 == b1_req_up) && !(b0_req_up == 1)) && 2 <= d0_ev) && 0 == comp_m1_st) && !(1 == d1_ev)) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b1_ev == 1)) && \old(z_val) == z_val) && 2 <= z_ev) && d0_val_t == d0_val) && b0_ev <= 0) && b0_val_t <= b0_val)) || (d0_val_t == d0_val && (((((((((((!(1 == b1_req_up) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 2 <= b0_ev) && !(0 == d0_ev)) && \old(z_req_up) == z_req_up) && 0 == comp_m1_st) && !(b1_ev == 1)) && \old(z_val) == z_val) && d0_ev <= 0) && !(1 == d1_ev)) && !(b1_ev == 0)) && 2 <= z_ev)) && z_val == z_val_t) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || !(2 <= \old(b0_ev))) || !(1 <= d0_val_t)) || !(\old(z_req_up) <= 0)) || !(\old(b0_val) == 0)) || !(\old(d1_req_up) <= \old(b0_req_up))) || !(\old(d0_val) == 0)) || !(1 <= d1_val_t)) || !(2 <= \old(z_ev))) || !(0 == \old(z_val_t))) || !(\old(b0_req_up) < \old(d1_req_up) + 1)) || !(\old(b1_req_up) == \old(d1_req_up)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((!(d1_val_t <= d1_val) || !(b1_val_t <= b1_val)) || !(1 <= b1_val_t)) || 0 == tmp) || !(z_val == z_val_t)) || ((((((((((((((((0 == b0_ev || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || b1_ev == 0) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || b1_ev == 1) || !(2 <= z_ev)) || !(z_val <= 0)) || !(2 <= d0_ev)) || 1 == b0_req_up) || !(comp_m1_i <= 0)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev) && (((((((((((((((((((((((b1_ev == 0 || 1 == b0_req_up) || !(comp_m1_i <= 0)) || !(1 <= b1_val_t)) || !(d0_ev <= 0)) || 0 == d0_ev) || 0 == tmp) || !(b1_val_t <= b1_val)) || 0 == b0_ev) || !(1 <= d0_val_t)) || !(b0_val_t <= b0_val)) || 1 == b1_req_up) || !(2 <= comp_m1_st)) || !(1 <= b0_val_t)) || !(1 <= d1_val_t)) || !(2 <= z_ev)) || b1_ev == 1) || !(z_val <= 0)) || !(0 == z_val_t)) || !(d1_val_t <= d1_val)) || 1 == b0_ev) || !(d0_val_t == d0_val)) || !(0 <= z_val)) || 1 == d1_ev) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 141 locations, 1 error locations. SAFE Result, 208.1s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 40.3s AutomataDifference, 0.0s DeadEndRemovalTime, 136.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 5274 SDtfs, 10871 SDslu, 9583 SDs, 0 SdLazy, 14376 SolverSat, 3951 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3163 GetRequests, 2865 SyntacticMatches, 4 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54716occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 22.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 38087 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 76859 PreInvPairs, 77200 NumberOfFragments, 22944 HoareAnnotationTreeSize, 76859 FomulaSimplifications, 2045356 FormulaSimplificationTreeSizeReduction, 14.6s HoareSimplificationTime, 52 FomulaSimplificationsInter, 3253473 FormulaSimplificationTreeSizeReductionInter, 120.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 6208 NumberOfCodeBlocks, 6208 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 6165 ConstructedInterpolants, 0 QuantifiedInterpolants, 1465012 SizeOfPredicates, 14 NumberOfNonLiveVariables, 17043 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 43 InterpolantComputations, 14 PerfectInterpolantSequences, 1437/1770 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...