/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 12:25:21,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 12:25:21,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 12:25:21,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 12:25:21,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 12:25:21,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 12:25:21,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 12:25:21,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 12:25:21,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 12:25:21,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 12:25:21,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 12:25:21,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 12:25:21,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 12:25:21,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 12:25:21,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 12:25:21,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 12:25:21,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 12:25:21,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 12:25:21,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 12:25:21,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 12:25:21,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 12:25:21,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 12:25:21,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 12:25:21,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 12:25:21,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 12:25:21,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 12:25:21,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 12:25:21,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 12:25:21,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 12:25:21,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 12:25:21,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 12:25:21,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 12:25:21,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 12:25:21,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 12:25:21,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 12:25:21,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 12:25:21,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 12:25:21,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 12:25:21,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 12:25:21,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 12:25:21,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 12:25:21,590 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 [2020-07-20 12:25:21,626 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 12:25:21,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 12:25:21,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 12:25:21,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 12:25:21,628 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 12:25:21,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 12:25:21,628 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 12:25:21,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 12:25:21,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 12:25:21,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 12:25:21,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 12:25:21,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 12:25:21,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 12:25:21,632 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 12:25:21,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 12:25:21,632 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 12:25:21,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 12:25:21,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 12:25:21,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 12:25:21,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 12:25:21,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 12:25:21,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 12:25:21,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 12:25:21,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 12:25:21,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 12:25:21,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 12:25:21,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:21,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 12:25:21,635 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 12:25:21,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-20 12:25:21,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 12:25:21,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 12:25:21,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 12:25:21,947 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 12:25:21,948 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 12:25:21,949 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-20 12:25:22,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ba18acd/6d56d95dc7b34daba39911c30085c709/FLAGaa8bddbda [2020-07-20 12:25:22,485 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 12:25:22,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-20 12:25:22,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ba18acd/6d56d95dc7b34daba39911c30085c709/FLAGaa8bddbda [2020-07-20 12:25:22,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ba18acd/6d56d95dc7b34daba39911c30085c709 [2020-07-20 12:25:22,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 12:25:22,885 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 12:25:22,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 12:25:22,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 12:25:22,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 12:25:22,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:25:22" (1/1) ... [2020-07-20 12:25:22,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dffb5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:22, skipping insertion in model container [2020-07-20 12:25:22,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:25:22" (1/1) ... [2020-07-20 12:25:22,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 12:25:22,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 12:25:23,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 12:25:23,169 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 12:25:23,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 12:25:23,346 INFO L208 MainTranslator]: Completed translation [2020-07-20 12:25:23,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:23 WrapperNode [2020-07-20 12:25:23,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 12:25:23,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 12:25:23,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 12:25:23,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 12:25:23,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:23" (1/1) ... [2020-07-20 12:25:23,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:23" (1/1) ... [2020-07-20 12:25:23,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:23" (1/1) ... [2020-07-20 12:25:23,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:23" (1/1) ... [2020-07-20 12:25:23,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:23" (1/1) ... [2020-07-20 12:25:23,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:23" (1/1) ... [2020-07-20 12:25:23,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:23" (1/1) ... [2020-07-20 12:25:23,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 12:25:23,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 12:25:23,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 12:25:23,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 12:25:23,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:23" (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 [2020-07-20 12:25:23,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 12:25:23,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 12:25:23,442 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 12:25:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 12:25:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 12:25:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 12:25:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 12:25:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 12:25:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 12:25:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 12:25:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 12:25:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 12:25:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 12:25:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 12:25:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 12:25:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 12:25:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 12:25:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 12:25:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 12:25:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 12:25:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 12:25:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 12:25:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 12:25:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 12:25:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 12:25:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 12:25:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 12:25:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 12:25:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 12:25:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 12:25:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 12:25:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 12:25:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 12:25:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 12:25:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 12:25:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 12:25:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 12:25:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 12:25:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 12:25:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 12:25:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 12:25:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 12:25:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 12:25:23,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 12:25:23,942 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 12:25:23,942 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 12:25:23,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:25:23 BoogieIcfgContainer [2020-07-20 12:25:23,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 12:25:23,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 12:25:23,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 12:25:23,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 12:25:23,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:25:22" (1/3) ... [2020-07-20 12:25:23,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d705fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:25:23, skipping insertion in model container [2020-07-20 12:25:23,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:23" (2/3) ... [2020-07-20 12:25:23,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d705fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:25:23, skipping insertion in model container [2020-07-20 12:25:23,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:25:23" (3/3) ... [2020-07-20 12:25:23,956 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-20 12:25:23,966 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 12:25:23,973 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 12:25:23,987 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 12:25:24,013 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 12:25:24,013 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 12:25:24,013 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 12:25:24,013 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 12:25:24,014 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 12:25:24,014 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 12:25:24,014 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 12:25:24,014 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 12:25:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-20 12:25:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 12:25:24,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:24,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:24,049 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-20 12:25:24,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:24,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1314646645] [2020-07-20 12:25:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:24,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 12:25:24,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:25:24,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:24,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1314646645] [2020-07-20 12:25:24,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:24,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:24,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497540575] [2020-07-20 12:25:24,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:24,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:24,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:24,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:24,385 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2020-07-20 12:25:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:24,506 INFO L93 Difference]: Finished difference Result 381 states and 537 transitions. [2020-07-20 12:25:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:24,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-20 12:25:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:24,538 INFO L225 Difference]: With dead ends: 381 [2020-07-20 12:25:24,539 INFO L226 Difference]: Without dead ends: 243 [2020-07-20 12:25:24,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-07-20 12:25:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2020-07-20 12:25:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-20 12:25:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2020-07-20 12:25:24,635 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 77 [2020-07-20 12:25:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:24,636 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2020-07-20 12:25:24,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2020-07-20 12:25:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 12:25:24,641 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:24,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:24,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:24,857 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1330878925, now seen corresponding path program 1 times [2020-07-20 12:25:24,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:24,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1500402979] [2020-07-20 12:25:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:24,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 12:25:24,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:25:25,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:25,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1500402979] [2020-07-20 12:25:25,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:25,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:25:25,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302931560] [2020-07-20 12:25:25,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:25:25,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:25,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:25:25,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:25:25,023 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand 5 states. [2020-07-20 12:25:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:25,467 INFO L93 Difference]: Finished difference Result 565 states and 793 transitions. [2020-07-20 12:25:25,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:25:25,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 12:25:25,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:25,472 INFO L225 Difference]: With dead ends: 565 [2020-07-20 12:25:25,473 INFO L226 Difference]: Without dead ends: 346 [2020-07-20 12:25:25,476 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:25:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-07-20 12:25:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 286. [2020-07-20 12:25:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-07-20 12:25:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 364 transitions. [2020-07-20 12:25:25,524 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 364 transitions. Word has length 77 [2020-07-20 12:25:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:25,524 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 364 transitions. [2020-07-20 12:25:25,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:25:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 364 transitions. [2020-07-20 12:25:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 12:25:25,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:25,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:25,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:25,742 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:25,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1640766093, now seen corresponding path program 1 times [2020-07-20 12:25:25,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:25,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [946832264] [2020-07-20 12:25:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:25,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 12:25:25,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:25:25,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:25,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [946832264] [2020-07-20 12:25:25,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:25,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:25:25,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516727236] [2020-07-20 12:25:25,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:25:25,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:25,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:25:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:25:25,896 INFO L87 Difference]: Start difference. First operand 286 states and 364 transitions. Second operand 5 states. [2020-07-20 12:25:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:26,469 INFO L93 Difference]: Finished difference Result 850 states and 1107 transitions. [2020-07-20 12:25:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:25:26,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 12:25:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:26,477 INFO L225 Difference]: With dead ends: 850 [2020-07-20 12:25:26,477 INFO L226 Difference]: Without dead ends: 583 [2020-07-20 12:25:26,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-20 12:25:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-07-20 12:25:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 534. [2020-07-20 12:25:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-20 12:25:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 679 transitions. [2020-07-20 12:25:26,541 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 679 transitions. Word has length 77 [2020-07-20 12:25:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:26,542 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 679 transitions. [2020-07-20 12:25:26,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:25:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 679 transitions. [2020-07-20 12:25:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 12:25:26,544 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:26,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:26,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:26,756 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:26,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:26,757 INFO L82 PathProgramCache]: Analyzing trace with hash -690298419, now seen corresponding path program 1 times [2020-07-20 12:25:26,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:26,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1015768568] [2020-07-20 12:25:26,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:26,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 12:25:26,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:25:26,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:26,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1015768568] [2020-07-20 12:25:26,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:26,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:25:26,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327771760] [2020-07-20 12:25:26,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:25:26,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:25:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:25:26,888 INFO L87 Difference]: Start difference. First operand 534 states and 679 transitions. Second operand 5 states. [2020-07-20 12:25:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:27,229 INFO L93 Difference]: Finished difference Result 1049 states and 1351 transitions. [2020-07-20 12:25:27,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:25:27,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 12:25:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:27,235 INFO L225 Difference]: With dead ends: 1049 [2020-07-20 12:25:27,235 INFO L226 Difference]: Without dead ends: 534 [2020-07-20 12:25:27,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:25:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-07-20 12:25:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2020-07-20 12:25:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-20 12:25:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 667 transitions. [2020-07-20 12:25:27,299 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 667 transitions. Word has length 77 [2020-07-20 12:25:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:27,299 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 667 transitions. [2020-07-20 12:25:27,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:25:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 667 transitions. [2020-07-20 12:25:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 12:25:27,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:27,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:27,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:27,524 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:27,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-20 12:25:27,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:27,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484466863] [2020-07-20 12:25:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:27,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 12:25:27,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:25:27,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:27,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484466863] [2020-07-20 12:25:27,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:27,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:25:27,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950950598] [2020-07-20 12:25:27,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:25:27,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:27,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:25:27,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:25:27,647 INFO L87 Difference]: Start difference. First operand 534 states and 667 transitions. Second operand 5 states. [2020-07-20 12:25:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:28,035 INFO L93 Difference]: Finished difference Result 1198 states and 1580 transitions. [2020-07-20 12:25:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:25:28,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 12:25:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:28,040 INFO L225 Difference]: With dead ends: 1198 [2020-07-20 12:25:28,040 INFO L226 Difference]: Without dead ends: 683 [2020-07-20 12:25:28,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-20 12:25:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2020-07-20 12:25:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 588. [2020-07-20 12:25:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-07-20 12:25:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 709 transitions. [2020-07-20 12:25:28,087 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 709 transitions. Word has length 77 [2020-07-20 12:25:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:28,088 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 709 transitions. [2020-07-20 12:25:28,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:25:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 709 transitions. [2020-07-20 12:25:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 12:25:28,089 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:28,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:28,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:28,303 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:28,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:28,304 INFO L82 PathProgramCache]: Analyzing trace with hash 899075215, now seen corresponding path program 1 times [2020-07-20 12:25:28,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:28,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1633726588] [2020-07-20 12:25:28,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:28,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 12:25:28,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:25:28,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:28,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1633726588] [2020-07-20 12:25:28,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:28,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:28,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498845387] [2020-07-20 12:25:28,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:28,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:28,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:28,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:28,412 INFO L87 Difference]: Start difference. First operand 588 states and 709 transitions. Second operand 3 states. [2020-07-20 12:25:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:28,486 INFO L93 Difference]: Finished difference Result 1698 states and 2106 transitions. [2020-07-20 12:25:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:28,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-20 12:25:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:28,493 INFO L225 Difference]: With dead ends: 1698 [2020-07-20 12:25:28,494 INFO L226 Difference]: Without dead ends: 1130 [2020-07-20 12:25:28,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:28,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2020-07-20 12:25:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1126. [2020-07-20 12:25:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2020-07-20 12:25:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1353 transitions. [2020-07-20 12:25:28,580 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1353 transitions. Word has length 77 [2020-07-20 12:25:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:28,581 INFO L479 AbstractCegarLoop]: Abstraction has 1126 states and 1353 transitions. [2020-07-20 12:25:28,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1353 transitions. [2020-07-20 12:25:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-20 12:25:28,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:28,584 INFO L422 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] [2020-07-20 12:25:28,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:28,798 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:28,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:28,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1699881733, now seen corresponding path program 1 times [2020-07-20 12:25:28,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:28,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [946052887] [2020-07-20 12:25:28,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:28,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:25:28,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-20 12:25:28,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:28,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [946052887] [2020-07-20 12:25:28,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:28,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:28,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642144561] [2020-07-20 12:25:28,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:28,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:28,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:28,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:28,930 INFO L87 Difference]: Start difference. First operand 1126 states and 1353 transitions. Second operand 3 states. [2020-07-20 12:25:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:29,048 INFO L93 Difference]: Finished difference Result 3067 states and 3792 transitions. [2020-07-20 12:25:29,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:29,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-20 12:25:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:29,062 INFO L225 Difference]: With dead ends: 3067 [2020-07-20 12:25:29,063 INFO L226 Difference]: Without dead ends: 1962 [2020-07-20 12:25:29,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-07-20 12:25:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-07-20 12:25:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-07-20 12:25:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2388 transitions. [2020-07-20 12:25:29,206 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2388 transitions. Word has length 121 [2020-07-20 12:25:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:29,207 INFO L479 AbstractCegarLoop]: Abstraction has 1962 states and 2388 transitions. [2020-07-20 12:25:29,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2388 transitions. [2020-07-20 12:25:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-20 12:25:29,212 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:29,213 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-20 12:25:29,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:29,428 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1985577124, now seen corresponding path program 1 times [2020-07-20 12:25:29,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:29,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1432447788] [2020-07-20 12:25:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:29,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:25:29,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-20 12:25:29,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:29,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1432447788] [2020-07-20 12:25:29,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:29,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:29,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707298714] [2020-07-20 12:25:29,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:29,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:29,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:29,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:29,654 INFO L87 Difference]: Start difference. First operand 1962 states and 2388 transitions. Second operand 3 states. [2020-07-20 12:25:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:29,749 INFO L93 Difference]: Finished difference Result 3486 states and 4236 transitions. [2020-07-20 12:25:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:29,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-20 12:25:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:29,760 INFO L225 Difference]: With dead ends: 3486 [2020-07-20 12:25:29,760 INFO L226 Difference]: Without dead ends: 1544 [2020-07-20 12:25:29,766 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2020-07-20 12:25:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2020-07-20 12:25:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-07-20 12:25:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1872 transitions. [2020-07-20 12:25:29,854 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1872 transitions. Word has length 174 [2020-07-20 12:25:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:29,855 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 1872 transitions. [2020-07-20 12:25:29,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1872 transitions. [2020-07-20 12:25:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-20 12:25:29,859 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:29,859 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-20 12:25:30,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:30,075 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash -114161306, now seen corresponding path program 1 times [2020-07-20 12:25:30,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:30,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084451637] [2020-07-20 12:25:30,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:30,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:25:30,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-07-20 12:25:30,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:30,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084451637] [2020-07-20 12:25:30,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:30,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:30,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664651643] [2020-07-20 12:25:30,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:30,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:30,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:30,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:30,249 INFO L87 Difference]: Start difference. First operand 1544 states and 1872 transitions. Second operand 3 states. [2020-07-20 12:25:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:30,384 INFO L93 Difference]: Finished difference Result 3171 states and 3898 transitions. [2020-07-20 12:25:30,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:30,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-20 12:25:30,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:30,394 INFO L225 Difference]: With dead ends: 3171 [2020-07-20 12:25:30,394 INFO L226 Difference]: Without dead ends: 1648 [2020-07-20 12:25:30,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2020-07-20 12:25:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1536. [2020-07-20 12:25:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2020-07-20 12:25:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1840 transitions. [2020-07-20 12:25:30,489 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 1840 transitions. Word has length 174 [2020-07-20 12:25:30,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:30,489 INFO L479 AbstractCegarLoop]: Abstraction has 1536 states and 1840 transitions. [2020-07-20 12:25:30,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1840 transitions. [2020-07-20 12:25:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 12:25:30,493 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:30,493 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:30,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:30,709 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:30,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:30,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1512674178, now seen corresponding path program 1 times [2020-07-20 12:25:30,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:30,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [654429017] [2020-07-20 12:25:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:30,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:25:30,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-20 12:25:30,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:30,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [654429017] [2020-07-20 12:25:30,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:30,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:30,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34858151] [2020-07-20 12:25:30,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:30,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:30,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:30,845 INFO L87 Difference]: Start difference. First operand 1536 states and 1840 transitions. Second operand 3 states. [2020-07-20 12:25:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:30,993 INFO L93 Difference]: Finished difference Result 4303 states and 5279 transitions. [2020-07-20 12:25:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:30,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 12:25:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:31,074 INFO L225 Difference]: With dead ends: 4303 [2020-07-20 12:25:31,074 INFO L226 Difference]: Without dead ends: 2788 [2020-07-20 12:25:31,083 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2020-07-20 12:25:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2785. [2020-07-20 12:25:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2020-07-20 12:25:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3365 transitions. [2020-07-20 12:25:31,297 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3365 transitions. Word has length 175 [2020-07-20 12:25:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:31,298 INFO L479 AbstractCegarLoop]: Abstraction has 2785 states and 3365 transitions. [2020-07-20 12:25:31,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3365 transitions. [2020-07-20 12:25:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 12:25:31,303 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:31,303 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:31,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:31,518 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1582450014, now seen corresponding path program 1 times [2020-07-20 12:25:31,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:31,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1219187424] [2020-07-20 12:25:31,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:31,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:25:31,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-20 12:25:31,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:31,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1219187424] [2020-07-20 12:25:31,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:31,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:31,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581653140] [2020-07-20 12:25:31,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:31,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:31,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:31,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:31,653 INFO L87 Difference]: Start difference. First operand 2785 states and 3365 transitions. Second operand 3 states. [2020-07-20 12:25:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:31,794 INFO L93 Difference]: Finished difference Result 4792 states and 5963 transitions. [2020-07-20 12:25:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:31,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 12:25:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:31,814 INFO L225 Difference]: With dead ends: 4792 [2020-07-20 12:25:31,815 INFO L226 Difference]: Without dead ends: 2793 [2020-07-20 12:25:31,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2020-07-20 12:25:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2785. [2020-07-20 12:25:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2020-07-20 12:25:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3321 transitions. [2020-07-20 12:25:32,059 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3321 transitions. Word has length 175 [2020-07-20 12:25:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:32,060 INFO L479 AbstractCegarLoop]: Abstraction has 2785 states and 3321 transitions. [2020-07-20 12:25:32,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3321 transitions. [2020-07-20 12:25:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 12:25:32,065 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:32,065 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:32,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:32,281 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash -557002881, now seen corresponding path program 1 times [2020-07-20 12:25:32,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:32,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [63002326] [2020-07-20 12:25:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:32,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:25:32,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-20 12:25:32,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:32,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [63002326] [2020-07-20 12:25:32,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:32,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:32,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892360647] [2020-07-20 12:25:32,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:32,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:32,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:32,418 INFO L87 Difference]: Start difference. First operand 2785 states and 3321 transitions. Second operand 3 states. [2020-07-20 12:25:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:32,546 INFO L93 Difference]: Finished difference Result 4289 states and 5279 transitions. [2020-07-20 12:25:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:32,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 12:25:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:32,562 INFO L225 Difference]: With dead ends: 4289 [2020-07-20 12:25:32,562 INFO L226 Difference]: Without dead ends: 2788 [2020-07-20 12:25:32,569 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2020-07-20 12:25:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2785. [2020-07-20 12:25:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2020-07-20 12:25:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3277 transitions. [2020-07-20 12:25:32,788 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3277 transitions. Word has length 175 [2020-07-20 12:25:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:32,790 INFO L479 AbstractCegarLoop]: Abstraction has 2785 states and 3277 transitions. [2020-07-20 12:25:32,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3277 transitions. [2020-07-20 12:25:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-20 12:25:32,795 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:32,795 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:33,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:33,011 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:33,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:33,012 INFO L82 PathProgramCache]: Analyzing trace with hash -264682041, now seen corresponding path program 1 times [2020-07-20 12:25:33,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:33,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [232487616] [2020-07-20 12:25:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:33,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 12:25:33,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-20 12:25:33,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 12:25:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-20 12:25:33,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [232487616] [2020-07-20 12:25:33,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 12:25:33,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2020-07-20 12:25:33,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261911275] [2020-07-20 12:25:33,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:25:33,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:33,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:25:33,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 12:25:33,384 INFO L87 Difference]: Start difference. First operand 2785 states and 3277 transitions. Second operand 6 states. [2020-07-20 12:25:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:34,347 INFO L93 Difference]: Finished difference Result 6953 states and 8283 transitions. [2020-07-20 12:25:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 12:25:34,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-07-20 12:25:34,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:34,376 INFO L225 Difference]: With dead ends: 6953 [2020-07-20 12:25:34,376 INFO L226 Difference]: Without dead ends: 5174 [2020-07-20 12:25:34,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-20 12:25:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2020-07-20 12:25:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 5091. [2020-07-20 12:25:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5091 states. [2020-07-20 12:25:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 6027 transitions. [2020-07-20 12:25:34,760 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 6027 transitions. Word has length 176 [2020-07-20 12:25:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:34,760 INFO L479 AbstractCegarLoop]: Abstraction has 5091 states and 6027 transitions. [2020-07-20 12:25:34,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:25:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 6027 transitions. [2020-07-20 12:25:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-07-20 12:25:34,770 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:34,771 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:34,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:34,984 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:34,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:34,984 INFO L82 PathProgramCache]: Analyzing trace with hash -125310296, now seen corresponding path program 1 times [2020-07-20 12:25:34,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:34,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1486116109] [2020-07-20 12:25:34,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:35,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:25:35,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-07-20 12:25:35,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:35,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1486116109] [2020-07-20 12:25:35,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:35,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:35,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317181630] [2020-07-20 12:25:35,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:35,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:35,164 INFO L87 Difference]: Start difference. First operand 5091 states and 6027 transitions. Second operand 3 states. [2020-07-20 12:25:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:35,505 INFO L93 Difference]: Finished difference Result 9712 states and 11700 transitions. [2020-07-20 12:25:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:35,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2020-07-20 12:25:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:35,555 INFO L225 Difference]: With dead ends: 9712 [2020-07-20 12:25:35,556 INFO L226 Difference]: Without dead ends: 5200 [2020-07-20 12:25:35,585 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2020-07-20 12:25:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5091. [2020-07-20 12:25:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5091 states. [2020-07-20 12:25:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 5995 transitions. [2020-07-20 12:25:35,932 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 5995 transitions. Word has length 202 [2020-07-20 12:25:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:35,933 INFO L479 AbstractCegarLoop]: Abstraction has 5091 states and 5995 transitions. [2020-07-20 12:25:35,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 5995 transitions. [2020-07-20 12:25:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-07-20 12:25:35,944 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:35,944 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:36,158 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:36,159 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:36,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:36,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1381777448, now seen corresponding path program 1 times [2020-07-20 12:25:36,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:36,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461067136] [2020-07-20 12:25:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:36,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:25:36,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-07-20 12:25:36,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:36,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [461067136] [2020-07-20 12:25:36,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:36,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:36,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555791102] [2020-07-20 12:25:36,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:36,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:36,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:36,352 INFO L87 Difference]: Start difference. First operand 5091 states and 5995 transitions. Second operand 3 states. [2020-07-20 12:25:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:36,635 INFO L93 Difference]: Finished difference Result 9604 states and 11310 transitions. [2020-07-20 12:25:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:36,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2020-07-20 12:25:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:36,657 INFO L225 Difference]: With dead ends: 9604 [2020-07-20 12:25:36,657 INFO L226 Difference]: Without dead ends: 4533 [2020-07-20 12:25:36,674 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2020-07-20 12:25:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4533. [2020-07-20 12:25:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4533 states. [2020-07-20 12:25:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 5338 transitions. [2020-07-20 12:25:36,935 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 5338 transitions. Word has length 202 [2020-07-20 12:25:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:36,936 INFO L479 AbstractCegarLoop]: Abstraction has 4533 states and 5338 transitions. [2020-07-20 12:25:36,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 5338 transitions. [2020-07-20 12:25:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2020-07-20 12:25:36,943 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:36,943 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:37,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:37,157 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:37,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash 662284003, now seen corresponding path program 1 times [2020-07-20 12:25:37,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:37,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1325656472] [2020-07-20 12:25:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:37,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 12:25:37,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-20 12:25:37,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:37,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1325656472] [2020-07-20 12:25:37,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:37,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 12:25:37,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487600068] [2020-07-20 12:25:37,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:25:37,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:37,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:25:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:25:37,319 INFO L87 Difference]: Start difference. First operand 4533 states and 5338 transitions. Second operand 6 states. [2020-07-20 12:25:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:37,542 INFO L93 Difference]: Finished difference Result 6923 states and 8208 transitions. [2020-07-20 12:25:37,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 12:25:37,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2020-07-20 12:25:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:37,553 INFO L225 Difference]: With dead ends: 6923 [2020-07-20 12:25:37,553 INFO L226 Difference]: Without dead ends: 2411 [2020-07-20 12:25:37,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 12:25:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2020-07-20 12:25:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2252. [2020-07-20 12:25:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2252 states. [2020-07-20 12:25:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 2604 transitions. [2020-07-20 12:25:37,689 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 2604 transitions. Word has length 203 [2020-07-20 12:25:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:37,690 INFO L479 AbstractCegarLoop]: Abstraction has 2252 states and 2604 transitions. [2020-07-20 12:25:37,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:25:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 2604 transitions. [2020-07-20 12:25:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-07-20 12:25:37,696 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:37,696 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:37,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:37,912 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:37,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:37,912 INFO L82 PathProgramCache]: Analyzing trace with hash 803385659, now seen corresponding path program 1 times [2020-07-20 12:25:37,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:37,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [7095523] [2020-07-20 12:25:37,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:38,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 12:25:38,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-07-20 12:25:38,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:38,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [7095523] [2020-07-20 12:25:38,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:38,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 12:25:38,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657272341] [2020-07-20 12:25:38,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:25:38,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:25:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:25:38,075 INFO L87 Difference]: Start difference. First operand 2252 states and 2604 transitions. Second operand 6 states. [2020-07-20 12:25:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:38,160 INFO L93 Difference]: Finished difference Result 3189 states and 3695 transitions. [2020-07-20 12:25:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:25:38,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2020-07-20 12:25:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:38,165 INFO L225 Difference]: With dead ends: 3189 [2020-07-20 12:25:38,165 INFO L226 Difference]: Without dead ends: 984 [2020-07-20 12:25:38,171 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 12:25:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2020-07-20 12:25:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2020-07-20 12:25:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2020-07-20 12:25:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1079 transitions. [2020-07-20 12:25:38,219 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1079 transitions. Word has length 210 [2020-07-20 12:25:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:38,220 INFO L479 AbstractCegarLoop]: Abstraction has 984 states and 1079 transitions. [2020-07-20 12:25:38,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:25:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1079 transitions. [2020-07-20 12:25:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-07-20 12:25:38,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:38,223 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:25:38,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:38,438 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:38,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:38,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1883728569, now seen corresponding path program 1 times [2020-07-20 12:25:38,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:38,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1348039569] [2020-07-20 12:25:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:38,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 12:25:38,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-07-20 12:25:38,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:38,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1348039569] [2020-07-20 12:25:38,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:38,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 12:25:38,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457442284] [2020-07-20 12:25:38,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:25:38,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:25:38,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:25:38,609 INFO L87 Difference]: Start difference. First operand 984 states and 1079 transitions. Second operand 6 states. [2020-07-20 12:25:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:38,660 INFO L93 Difference]: Finished difference Result 1602 states and 1782 transitions. [2020-07-20 12:25:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:25:38,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2020-07-20 12:25:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:38,661 INFO L225 Difference]: With dead ends: 1602 [2020-07-20 12:25:38,661 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 12:25:38,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 12:25:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 12:25:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 12:25:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 12:25:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 12:25:38,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 210 [2020-07-20 12:25:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:38,667 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 12:25:38,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:25:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 12:25:38,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 12:25:38,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:38,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 12:25:43,043 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-07-20 12:25:43,182 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-20 12:25:43,320 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-20 12:25:43,479 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-20 12:25:43,624 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-07-20 12:25:43,764 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-20 12:25:43,905 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-20 12:25:44,192 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2020-07-20 12:25:44,566 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-07-20 12:25:44,793 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-20 12:25:45,350 WARN L193 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2020-07-20 12:25:45,490 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-20 12:25:45,938 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2020-07-20 12:25:46,327 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-07-20 12:25:46,575 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-20 12:25:46,763 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2020-07-20 12:25:47,605 WARN L193 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2020-07-20 12:25:47,777 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2020-07-20 12:25:48,114 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-07-20 12:25:49,055 WARN L193 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2020-07-20 12:25:49,363 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-07-20 12:25:49,504 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-20 12:25:49,960 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2020-07-20 12:25:50,283 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2020-07-20 12:25:50,538 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-20 12:25:50,798 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2020-07-20 12:25:51,056 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2020-07-20 12:25:51,428 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2020-07-20 12:25:51,858 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2020-07-20 12:25:52,123 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-07-20 12:25:52,318 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2020-07-20 12:25:52,586 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-07-20 12:25:52,726 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-20 12:25:53,251 WARN L193 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2020-07-20 12:25:53,400 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-07-20 12:25:53,677 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-20 12:25:53,899 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-07-20 12:25:54,138 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-07-20 12:25:54,456 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-07-20 12:25:54,484 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-20 12:25:54,485 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (<= 2 ~t1_st~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 ~M_E~0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~token~0 ~local~0))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (<= 2 ~E_1~0)) (not (= ~token~0 (+ ~local~0 1))) .cse0 .cse10 .cse1 .cse4 .cse5 (not (<= 2 |old(~m_st~0)|)) .cse8 (<= 2 ~m_st~0)) (or .cse0 .cse2 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) .cse8 .cse9))) [2020-07-20 12:25:54,485 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-20 12:25:54,486 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse6 (not (= 1 ~m_pc~0))) (.cse4 (<= 2 ~m_st~0)) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse5 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse8 (not (<= 2 ~M_E~0))) (.cse9 (not (<= 2 ~T1_E~0))) (.cse13 (= 0 ~m_st~0)) (.cse2 (= ~token~0 ~local~0)) (.cse3 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (not (= |old(~token~0)| ~local~0))) (.cse12 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (= 1 ~t1_pc~0)) (.cse15 (<= 2 ~E_M~0)) (.cse16 (= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse5 .cse6 (and .cse13 .cse14 .cse15 .cse16) .cse8 .cse9 (and .cse14 .cse15 .cse16 .cse4) .cse10 .cse11 (not (= 1 |old(~t1_pc~0)|)) .cse12)) (or .cse0 .cse1 .cse5 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 (and .cse13 .cse2 .cse3) .cse10 .cse12 (not (<= ~m_pc~0 0))))) [2020-07-20 12:25:54,486 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-20 12:25:54,486 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse7 (not (= 1 ~m_pc~0))) (.cse5 (<= 2 ~m_st~0)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse2 (= ~token~0 ~local~0)) (.cse3 (<= |old(~E_M~0)| ~E_M~0)) (.cse4 (<= ~t1_pc~0 0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse6 (not (<= 2 |old(~E_M~0)|))) (.cse8 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (<= 2 ~M_E~0))) (.cse10 (not (<= 2 ~T1_E~0))) (.cse11 (not (= |old(~token~0)| ~local~0))) (.cse13 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse6 .cse7 (and (= 1 ~t1_pc~0) .cse2 .cse3 .cse5) .cse9 .cse10 .cse11 .cse12 (not (= 1 |old(~t1_pc~0)|)) .cse13) (or (and (= 0 ~m_st~0) .cse2 .cse3 .cse4) .cse0 .cse1 .cse6 .cse8 (not (= 0 |old(~m_st~0)|)) .cse9 .cse10 .cse11 .cse13 (not (<= ~m_pc~0 0))))) [2020-07-20 12:25:54,486 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-20 12:25:54,487 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse4 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= 1 ~m_pc~0))) (.cse5 (not (<= 2 ~M_E~0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse7 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse4 (not (= 0 |old(~m_st~0)|)) .cse5 .cse6 .cse7 .cse9 (not (<= ~m_pc~0 0))) (or .cse0 .cse1 .cse2 .cse3 (and (= 1 ~t1_pc~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= 2 ~m_st~0)) .cse5 .cse6 .cse7 .cse8 (not (= 1 |old(~t1_pc~0)|)) .cse9))) [2020-07-20 12:25:54,487 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-20 12:25:54,487 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse4 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (= ~token~0 ~local~0)) (.cse10 (<= |old(~E_M~0)| ~E_M~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= 1 ~m_pc~0))) (.cse15 (= 0 ~m_st~0)) (.cse5 (not (<= 2 ~M_E~0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse12 (not (= |old(~token~0)| ~local~0))) (.cse7 (= 1 ~t1_pc~0)) (.cse8 (<= 2 ~t1_st~0)) (.cse11 (<= 2 ~m_st~0)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse4 (not (= 0 |old(~m_st~0)|)) .cse5 .cse6 .cse12 .cse14 (and .cse15 .cse7 .cse8 .cse9 .cse10) (not (<= ~m_pc~0 0))) (let ((.cse16 (<= 2 ~E_M~0)) (.cse17 (= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse2 .cse3 (and .cse15 .cse7 .cse8 .cse16 .cse17) .cse5 .cse6 .cse12 (and .cse7 .cse8 .cse16 .cse17 .cse11) .cse13 (not (= 1 |old(~t1_pc~0)|)) .cse14)))) [2020-07-20 12:25:54,488 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= 1 ~m_pc~0))) (.cse5 (not (<= 2 ~M_E~0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse7 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse4 (not (= 0 |old(~m_st~0)|)) .cse5 .cse6 .cse7 .cse9 (not (<= ~m_pc~0 0))) (or .cse0 .cse1 .cse2 .cse3 (and (= 1 ~t1_pc~0) (= ~token~0 (+ ~local~0 1)) (<= 2 ~m_st~0)) .cse5 .cse6 .cse7 .cse8 (not (= 1 |old(~t1_pc~0)|)) .cse9))) [2020-07-20 12:25:54,488 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-20 12:25:54,488 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-20 12:25:54,488 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-20 12:25:54,488 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-20 12:25:54,488 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-20 12:25:54,489 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse7 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~m_st~0))) (let ((.cse4 (not (<= 2 ~M_E~0))) (.cse6 (not (= ~token~0 ~local~0))) (.cse16 (not (= 0 |old(~t1_st~0)|))) (.cse17 (not (<= ~t1_pc~0 0))) (.cse9 (not (<= ~m_pc~0 0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 (+ ~local~0 1)))) (.cse0 (not (= 1 ~t1_i~0))) (.cse11 (not (= 1 ~m_pc~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse13 (and .cse7 .cse15)) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse13 .cse8) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse10 .cse14 .cse0 .cse11 .cse1 .cse4 .cse5 .cse12 .cse8 .cse15) (or .cse10 (= 0 ~m_st~0) .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse4 .cse5 .cse6 .cse16 .cse17 .cse8 .cse9) (or .cse0 .cse2 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse16 .cse17 .cse8 .cse9) (or .cse10 .cse14 .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse12 .cse13 .cse8)))) [2020-07-20 12:25:54,489 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse7 (<= 2 ~m_st~0)) (.cse6 (= 0 activate_threads_~tmp~1)) (.cse20 (<= 2 ~t1_st~0))) (let ((.cse1 (= 0 ~m_st~0)) (.cse14 (not (= 0 |old(~t1_st~0)|))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse16 (not (<= ~m_pc~0 0))) (.cse18 (and .cse6 .cse20)) (.cse8 (not (<= 2 ~M_E~0))) (.cse13 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse2 (not (= ~token~0 (+ ~local~0 1)))) (.cse3 (not (= 1 ~t1_i~0))) (.cse19 (and .cse6 .cse20 .cse7)) (.cse4 (not (= 1 ~m_pc~0))) (.cse5 (not (= 1 ~t1_pc~0))) (.cse12 (not (<= 2 ~E_M~0))) (.cse17 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 (not (= 0 |old(~m_st~0)|)) .cse12 .cse8 .cse9 .cse13 .cse14 .cse15 .cse11 .cse16) (or .cse3 .cse5 .cse12 .cse17 .cse18 .cse8 .cse9 .cse13 .cse11 .cse16) (or .cse0 .cse3 .cse4 .cse19 .cse5 .cse12 .cse17 .cse9 .cse13 .cse10 .cse11) (or (and .cse6 (= 0 ~t1_st~0)) .cse3 .cse12 .cse8 .cse9 .cse13 .cse14 .cse15 .cse11 .cse16) (or .cse3 .cse4 .cse5 .cse12 .cse17 .cse18 .cse8 .cse9 .cse13 .cse11) (or .cse0 .cse2 .cse3 .cse19 .cse4 .cse5 .cse12 .cse17 .cse9 .cse10 .cse11)))) [2020-07-20 12:25:54,489 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-20 12:25:54,489 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse7 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~m_st~0))) (let ((.cse4 (not (<= 2 ~M_E~0))) (.cse6 (not (= ~token~0 ~local~0))) (.cse16 (not (= 0 |old(~t1_st~0)|))) (.cse17 (not (<= ~t1_pc~0 0))) (.cse9 (not (<= ~m_pc~0 0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 (+ ~local~0 1)))) (.cse0 (not (= 1 ~t1_i~0))) (.cse11 (not (= 1 ~m_pc~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse13 (and .cse7 .cse15)) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse13 .cse8) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse10 .cse14 .cse0 .cse11 .cse1 .cse4 .cse5 .cse12 .cse8 .cse15) (or .cse10 (= 0 ~m_st~0) .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse4 .cse5 .cse6 .cse16 .cse17 .cse8 .cse9) (or .cse0 .cse2 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse16 .cse17 .cse8 .cse9) (or .cse10 .cse14 .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse12 .cse13 .cse8)))) [2020-07-20 12:25:54,489 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-20 12:25:54,490 INFO L264 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse2 (not (= 1 ~m_pc~0))) (.cse11 (not (<= 2 ~m_st~0))) (.cse14 (not (<= ~t1_pc~0 0))) (.cse13 (not (= 0 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse4 (not (= 0 ~m_st~0))) (.cse5 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse8 (not (<= 2 ~M_E~0))) (.cse9 (not (<= 2 ~T1_E~0))) (.cse12 (not (= ~token~0 ~local~0))) (.cse10 (not (= 1 ~m_i~0))) (.cse15 (not (<= ~m_pc~0 0)))) (and (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse11 .cse8 .cse9 .cse12 .cse13 .cse10) (or .cse0 .cse1 .cse2 .cse5 .cse7 .cse11 .cse8 .cse9 .cse12 .cse14 .cse13 .cse10) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse12 .cse14 .cse13 .cse10 .cse15) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse15))) [2020-07-20 12:25:54,490 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-20 12:25:54,490 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-20 12:25:54,490 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-20 12:25:54,490 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-20 12:25:54,490 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-20 12:25:54,490 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-20 12:25:54,490 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-20 12:25:54,490 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-20 12:25:54,491 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse11 (not (= ~token~0 ~local~0))) (.cse10 (not (<= 2 ~E_M~0))) (.cse12 (not (<= 2 ~t1_st~0))) (.cse5 (not (<= 2 ~m_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= ~token~0 (+ ~local~0 1)))) (.cse2 (not (= 1 ~t1_i~0))) (.cse3 (not (= 1 ~m_pc~0))) (.cse4 (not (= 1 ~t1_pc~0))) (.cse6 (not (<= 2 ~M_E~0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse9 (not (= 1 ~m_i~0))) (.cse8 (= 0 is_transmit1_triggered_~__retres1~1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse6 .cse7 .cse11 (not (<= ~t1_pc~0 0)) (not (= 0 ~t1_st~0)) .cse8 .cse9 (not (<= ~m_pc~0 0))) (or .cse0 .cse2 .cse3 .cse4 .cse10 .cse12 .cse5 .cse7 .cse11 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse12 .cse5 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ~m_st~0)) .cse6 .cse7 .cse9 .cse8))) [2020-07-20 12:25:54,491 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-20 12:25:54,491 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-20 12:25:54,491 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-20 12:25:54,491 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 12:25:54,491 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 12:25:54,491 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 12:25:54,491 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse2 (not (= 1 ~m_pc~0))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse6 (not (<= 2 ~m_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~token~0 ~local~0))) (.cse7 (and (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse8 (not (<= 2 |old(~T1_E~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or (not (= ~token~0 (+ ~local~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 .cse9) (or .cse0 .cse1 (not (= 0 ~m_st~0)) .cse5 .cse10 .cse7 (not (<= ~t1_pc~0 0)) (not (<= 2 |old(~M_E~0)|)) (not (= 0 ~t1_st~0)) .cse8 .cse9 (not (<= ~m_pc~0 0))))) [2020-07-20 12:25:54,492 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-20 12:25:54,492 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-20 12:25:54,492 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-20 12:25:54,492 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-20 12:25:54,492 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 ~E_M~0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (= ~token~0 ~local~0)) (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) (not (= 1 ~m_i~0)) (not (<= ~m_pc~0 0))) [2020-07-20 12:25:54,492 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-20 12:25:54,492 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 12:25:54,492 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-20 12:25:54,492 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-20 12:25:54,492 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-20 12:25:54,493 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 12:25:54,493 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 1 ~t1_i~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (= 1 ~m_i~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 12:25:54,493 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-20 12:25:54,493 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-20 12:25:54,493 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-20 12:25:54,493 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-20 12:25:54,494 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-20 12:25:54,494 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-20 12:25:54,494 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= 2 ~M_E~0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) .cse8) (or .cse0 .cse1 (and (<= 2 ~t1_st~0) (not (= |old(~token~0)| ~local~0)) (<= |old(~E_1~0)| ~E_1~0) (= 1 ~m_pc~0) (= ~token~0 (+ ~local~0 1))) .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse3 .cse4 .cse6 .cse7 .cse8))) [2020-07-20 12:25:54,494 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse12 (= 0 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse20 (= 1 ~t1_i~0)) (.cse17 (<= 2 ~T1_E~0)) (.cse19 (<= 2 ~E_M~0)) (.cse13 (= 1 ~m_pc~0)) (.cse16 (= 1 ~m_i~0)) (.cse14 (= ~token~0 ~local~0)) (.cse18 (<= 2 ~M_E~0)) (.cse15 (<= 2 ~m_st~0)) (.cse21 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse21)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (and .cse11 .cse20 .cse17 .cse21 (<= 2 ~t1_st~0) .cse19 .cse13 .cse16 .cse14 .cse18 .cse15)) (.cse9 (and .cse11 .cse17 .cse12 .cse21 .cse19 .cse13 .cse16 .cse14 .cse18 .cse15)) (.cse0 (not .cse20)) (.cse2 (not .cse19)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= |old(~m_pc~0)| 0))) (.cse7 (not .cse18)) (.cse8 (not .cse17)) (.cse10 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (or (and .cse11 .cse12 .cse13 .cse14 .cse15) (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) .cse10)))) [2020-07-20 12:25:54,495 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= 2 ~M_E~0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) .cse8) (or .cse0 .cse1 .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse3 .cse4 .cse6 .cse7 .cse8))) [2020-07-20 12:25:54,495 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse10 (not (<= |old(~m_pc~0)| 0))) (.cse4 (<= ~m_pc~0 0)) (.cse1 (= ~token~0 ~local~0)) (.cse5 (not (= 1 ~t1_i~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~t1_st~0)) (.cse0 (not (= |old(~token~0)| ~local~0))) (.cse3 (<= |old(~E_1~0)| ~E_1~0)) (.cse7 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= 2 ~M_E~0))) (.cse12 (not (<= 2 ~T1_E~0))) (.cse13 (not (= 1 ~m_i~0)))) (and (or (and (or .cse0 .cse1) .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) (and (= 0 ~t1_st~0) .cse3 .cse4 .cse1) .cse13) (or .cse5 .cse6 (and .cse2 .cse0 .cse3 (= 1 ~m_pc~0) (= ~token~0 (+ ~local~0 1))) .cse7 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse8 .cse9 .cse11 .cse12 .cse13))) [2020-07-20 12:25:54,495 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse6 (<= ~m_pc~0 0)) (.cse3 (not (<= |old(~m_pc~0)| 0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse9 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~M_E~0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse11 (<= 2 ~t1_st~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (not (= 1 ~m_i~0)))) (and (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) (and (= 0 ~t1_st~0) .cse6 .cse7) .cse8) (or .cse0 .cse9 .cse1 .cse10 (and .cse11 .cse6 .cse7) .cse2 .cse3 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse10 .cse2 .cse4 .cse5 (and .cse11 (= 1 ~m_pc~0) .cse7) .cse8))) [2020-07-20 12:25:54,495 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-20 12:25:54,495 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse10 (not (<= |old(~m_pc~0)| 0))) (.cse4 (<= ~m_pc~0 0)) (.cse1 (= ~token~0 ~local~0)) (.cse5 (not (= 1 ~t1_i~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~t1_st~0)) (.cse0 (not (= |old(~token~0)| ~local~0))) (.cse3 (<= |old(~E_1~0)| ~E_1~0)) (.cse7 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= 2 ~M_E~0))) (.cse12 (not (<= 2 ~T1_E~0))) (.cse13 (not (= 1 ~m_i~0)))) (and (or (and (or .cse0 .cse1) .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) (and (= 0 ~t1_st~0) .cse3 .cse4 .cse1) .cse13) (or .cse5 .cse6 (and .cse2 .cse0 .cse3 (= 1 ~m_pc~0) (= ~token~0 (+ ~local~0 1))) .cse7 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse8 .cse9 .cse11 .cse12 .cse13))) [2020-07-20 12:25:54,495 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-20 12:25:54,495 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-20 12:25:54,496 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (= 1 ~m_pc~0))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse5 (not (<= 2 ~t1_st~0))) (.cse6 (not (<= 2 ~m_st~0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (<= |old(~M_E~0)| ~M_E~0)) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~token~0 ~local~0)) .cse8 .cse9))) [2020-07-20 12:25:54,496 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-20 12:25:54,496 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 12:25:54,496 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (or (not (= |old(~token~0)| ~local~0)) (= ~token~0 ~local~0)) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0)) [2020-07-20 12:25:54,496 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 12:25:54,496 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (= 1 |old(~m_pc~0)|))) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (= 1 |old(~t1_pc~0)|))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (= 1 ~t1_pc~0)) (.cse10 (<= 2 ~t1_st~0)) (.cse5 (<= |old(~E_1~0)| ~E_1~0)) (.cse11 (= 1 ~m_pc~0)) (.cse6 (= ~token~0 ~local~0)) (.cse7 (<= |old(~E_M~0)| ~E_M~0)) (.cse12 (<= 2 ~m_st~0))) (and (or .cse0 .cse1 .cse2 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) .cse3 (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse4 (and (= 0 ~m_st~0) (= 0 ~t1_st~0) .cse5 (<= ~m_pc~0 0) .cse6 .cse7 (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) .cse8) (or .cse1 .cse2 (and .cse9 .cse10 (not (= |old(~token~0)| ~local~0)) .cse5 .cse11 (= ~token~0 (+ ~local~0 1)) .cse7 .cse12) (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse13 .cse14 .cse3 .cse4 .cse15 .cse16 .cse8) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse3 .cse4 .cse15 .cse16 .cse8 (and .cse9 .cse10 .cse5 .cse11 .cse6 .cse7 .cse12)))) [2020-07-20 12:25:54,496 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-20 12:25:54,496 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-20 12:25:54,496 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-20 12:25:54,497 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-20 12:25:54,497 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse11 (<= 2 ~E_1~0)) (.cse13 (= 1 ~t1_pc~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= 1 ~m_pc~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse3 (and .cse11 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17)) (.cse1 (not (= 1 ~t1_i~0))) (.cse25 (not (= |old(~token~0)| ~local~0))) (.cse24 (= ~token~0 (+ ~local~0 1))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (= 1 |old(~m_pc~0)|))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (= 0 ~t1_st~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse19 (<= ~m_pc~0 0)) (.cse22 (<= 1 eval_~tmp~0)) (.cse18 (= 0 ~m_st~0))) (or .cse1 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse7 (not (= 0 |old(~t1_st~0)|)) (and .cse18 .cse11 .cse12 .cse19 .cse16 .cse20 .cse21) .cse10 .cse0 (and .cse11 .cse12 .cse15 .cse22 .cse16 .cse20 .cse21 .cse17) .cse2 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 (and .cse11 .cse13 .cse23 .cse14 .cse15 .cse24 .cse17) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse22 .cse19 .cse16) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse15 .cse24 .cse22) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse25 .cse15 .cse24))) (or .cse1 (and .cse11 .cse13 .cse23 .cse14 .cse25 .cse15 .cse24 .cse17) .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2020-07-20 12:25:54,497 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse16 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (= 1 |old(~m_pc~0)|))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (= 1 |old(~t1_pc~0)|))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (= 1 ~m_pc~0)) (.cse15 (<= 2 ~m_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse11 (<= 1 eval_~tmp~0)) (.cse12 (= ~token~0 ~local~0)) (.cse13 (<= |old(~E_M~0)| ~E_M~0)) (.cse14 (<= ~t1_pc~0 0))) (or .cse0 (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse5 (not (= 0 |old(~t1_st~0)|)) .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse1 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) .cse4 (and .cse9 (= 1 ~t1_pc~0) (<= 2 ~E_M~0) .cse10 .cse11 .cse12 .cse15) (and (= 0 ~m_st~0) .cse9 .cse11 (<= ~m_pc~0 0) .cse12 .cse13 .cse14))) (or .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-07-20 12:25:54,498 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse11 (<= 2 ~E_1~0)) (.cse13 (= 1 ~t1_pc~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= 1 ~m_pc~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse3 (and .cse11 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17)) (.cse1 (not (= 1 ~t1_i~0))) (.cse25 (not (= |old(~token~0)| ~local~0))) (.cse24 (= ~token~0 (+ ~local~0 1))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (= 1 |old(~m_pc~0)|))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (= 0 ~t1_st~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse19 (<= ~m_pc~0 0)) (.cse22 (<= 1 eval_~tmp~0)) (.cse18 (= 0 ~m_st~0))) (or .cse1 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse7 (not (= 0 |old(~t1_st~0)|)) (and .cse18 .cse11 .cse12 .cse19 .cse16 .cse20 .cse21) .cse10 .cse0 (and .cse11 .cse12 .cse15 .cse22 .cse16 .cse20 .cse21 .cse17) .cse2 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 (and .cse11 .cse13 .cse23 .cse14 .cse15 .cse24 .cse17) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse22 .cse19 .cse16) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse15 .cse24 .cse22) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse25 .cse15 .cse24))) (or .cse1 (and .cse11 .cse13 .cse23 .cse14 .cse25 .cse15 .cse24 .cse17) .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2020-07-20 12:25:54,498 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-20 12:25:54,498 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse17 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (= 1 |old(~m_pc~0)|))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (= 1 |old(~t1_pc~0)|))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse11 (= 1 ~t1_pc~0)) (.cse12 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_M~0)) (.cse10 (= ~token~0 (+ ~local~0 1))) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= 1 eval_~tmp~0)) (.cse14 (<= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0))) (or .cse0 (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse5 (not (= 0 |old(~t1_st~0)|)) .cse8 (and (or (and .cse9 (or (not (= |old(~token~0)| ~local~0)) .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse9 .cse11 .cse12 .cse13 .cse14 .cse15)) .cse16) .cse17 .cse1 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse9 .cse11 .cse12 .cse13 (= 1 ~m_pc~0) .cse10 .cse16) (and .cse9 (= 0 ~t1_st~0) .cse16 .cse14 .cse15 (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) .cse4)) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-07-20 12:25:54,498 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-20 12:25:54,499 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse11 (<= 2 ~E_1~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= 1 ~m_pc~0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse4 (not (= 1 |old(~m_pc~0)|))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (= 1 ~t1_i~0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse10 (not (= 1 ~m_i~0))) (.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (and .cse11 .cse12 .cse13 .cse14 .cse15 (= ~token~0 ~local~0) .cse17)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse16 (= ~token~0 (+ ~local~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 (and .cse11 .cse12 .cse13 .cse14 (not (= |old(~token~0)| ~local~0)) .cse15 .cse16 .cse17) .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse7 (not (= 0 |old(~t1_st~0)|)) .cse10 .cse0 .cse2 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2020-07-20 12:25:54,499 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-20 12:25:54,499 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-20 12:25:54,499 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-20 12:25:54,499 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-20 12:25:54,499 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-20 12:25:54,499 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-20 12:25:54,499 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-20 12:25:54,499 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-20 12:25:54,500 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-20 12:25:54,500 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-20 12:25:54,500 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse2 (not (= 1 ~m_pc~0))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse6 (not (<= 2 ~m_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~token~0 ~local~0))) (.cse7 (and (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse8 (not (<= 2 |old(~T1_E~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or (not (= ~token~0 (+ ~local~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 .cse9) (or .cse0 .cse1 (not (= 0 ~m_st~0)) .cse5 .cse10 .cse7 (not (<= ~t1_pc~0 0)) (not (<= 2 |old(~M_E~0)|)) (not (= 0 ~t1_st~0)) .cse8 .cse9 (not (<= ~m_pc~0 0))))) [2020-07-20 12:25:54,500 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 12:25:54,500 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 12:25:54,500 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-20 12:25:54,500 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-20 12:25:54,500 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 12:25:54,500 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-20 12:25:54,501 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-20 12:25:54,501 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-20 12:25:54,501 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-20 12:25:54,501 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-20 12:25:54,501 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 (+ ~local~0 1)) .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 12:25:54,502 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-20 12:25:54,502 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-20 12:25:54,502 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-20 12:25:54,502 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-20 12:25:54,503 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-20 12:25:54,503 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-20 12:25:54,503 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse6 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and (= 0 ~m_st~0) .cse0 (= 0 ~t1_st~0) .cse5 (<= ~m_pc~0 0) (<= 2 ~M_E~0) .cse6 (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse7))) [2020-07-20 12:25:54,503 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-20 12:25:54,503 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse6 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and (= 0 ~m_st~0) .cse0 (= 0 ~t1_st~0) .cse5 (<= ~m_pc~0 0) (<= 2 ~M_E~0) .cse6 (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse7))) [2020-07-20 12:25:54,504 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-20 12:25:54,504 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-20 12:25:54,504 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-20 12:25:54,504 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-20 12:25:54,504 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-20 12:25:54,505 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-20 12:25:54,505 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-20 12:25:54,505 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-20 12:25:54,505 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-07-20 12:25:54,505 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-20 12:25:54,505 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-20 12:25:54,506 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse7 (not (<= ~m_pc~0 0))) (.cse8 (not (<= 2 ~E_1~0))) (.cse12 (not (<= 2 ~m_st~0))) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse1 (not (= 1 ~t1_i~0))) (.cse9 (not (= 1 ~m_pc~0))) (.cse10 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse3 (not (<= 2 ~M_E~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse6 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= ~t1_pc~0 0)) (not (= 0 ~t1_st~0)) .cse6 .cse7) (or .cse0 .cse8 .cse1 .cse9 .cse10 .cse2 .cse11 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse9 .cse10 .cse2 .cse11 .cse12 .cse4 .cse6) (or .cse0 .cse1 .cse9 .cse10 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6))) [2020-07-20 12:25:54,506 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-20 12:25:54,506 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-20 12:25:54,506 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-20 12:25:54,506 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-20 12:25:54,506 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-20 12:25:54,506 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-20 12:25:54,506 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 12:25:54,507 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (<= 2 ~T1_E~0) (= 0 ~t1_st~0) (<= 2 ~E_M~0) (<= ~m_pc~0 0) (= ~token~0 ~local~0) (<= 2 ~M_E~0) (<= ~t1_pc~0 0)) [2020-07-20 12:25:54,507 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 12:25:54,507 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 12:25:54,507 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-20 12:25:54,507 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 12:25:54,507 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (= 1 ~m_pc~0))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= 2 ~m_st~0))) (.cse7 (and (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse8 (not (<= 2 |old(~T1_E~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or (not (= ~token~0 (+ ~local~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~token~0 ~local~0)) .cse7 .cse8 .cse9))) [2020-07-20 12:25:54,507 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-20 12:25:54,507 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 12:25:54,508 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 12:25:54,508 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-20 12:25:54,508 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-20 12:25:54,508 INFO L271 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2020-07-20 12:25:54,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 12:25:54 BoogieIcfgContainer [2020-07-20 12:25:54,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 12:25:54,560 INFO L168 Benchmark]: Toolchain (without parser) took 31675.45 ms. Allocated memory was 138.4 MB in the beginning and 822.1 MB in the end (delta: 683.7 MB). Free memory was 103.4 MB in the beginning and 321.0 MB in the end (delta: -217.5 MB). Peak memory consumption was 709.4 MB. Max. memory is 7.1 GB. [2020-07-20 12:25:54,560 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 12:25:54,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.00 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 103.0 MB in the beginning and 178.7 MB in the end (delta: -75.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2020-07-20 12:25:54,561 INFO L168 Benchmark]: Boogie Preprocessor took 40.75 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 176.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-07-20 12:25:54,562 INFO L168 Benchmark]: RCFGBuilder took 559.43 ms. Allocated memory is still 201.3 MB. Free memory was 176.0 MB in the beginning and 145.4 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2020-07-20 12:25:54,562 INFO L168 Benchmark]: TraceAbstraction took 30609.17 ms. Allocated memory was 201.3 MB in the beginning and 822.1 MB in the end (delta: 620.8 MB). Free memory was 144.7 MB in the beginning and 321.0 MB in the end (delta: -176.3 MB). Peak memory consumption was 687.7 MB. Max. memory is 7.1 GB. [2020-07-20 12:25:54,565 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 461.00 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 103.0 MB in the beginning and 178.7 MB in the end (delta: -75.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.75 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 176.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 559.43 ms. Allocated memory is still 201.3 MB. Free memory was 176.0 MB in the beginning and 145.4 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30609.17 ms. Allocated memory was 201.3 MB in the beginning and 822.1 MB in the end (delta: 620.8 MB). Free memory was 144.7 MB in the beginning and 321.0 MB in the end (delta: -176.3 MB). Peak memory consumption was 687.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || 1 <= __retres1) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || 1 <= __retres1) || !(2 <= m_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(0 == t1_st)) || !(1 == m_i))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == m_pc)) || !(2 <= E_M)) || 1 <= __retres1) || !(2 <= m_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(t1_pc <= 0)) || !(0 == t1_st)) || !(1 == m_i))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(0 == m_st)) || !(2 <= E_M)) || 1 <= __retres1) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(t1_pc <= 0)) || !(0 == t1_st)) || !(1 == m_i)) || !(m_pc <= 0))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || 1 <= __retres1) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(1 == m_i)) || !(m_pc <= 0)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((!(\old(token) == \old(local)) || !(1 == t1_i)) || !(2 <= \old(E_M))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) && ((((((((((((((((((!(1 == t1_i) || ((((((2 <= E_1 && 0 == t1_st) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(0 == \old(t1_st))) || ((((((0 == m_st && 2 <= E_1) && 0 == t1_st) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0)) || !(1 == m_i)) || !(\old(token) == \old(local))) || (((((((2 <= E_1 && 0 == t1_st) && 1 == m_pc) && 1 <= tmp) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1) && 2 <= m_st)) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 <= tmp) && m_pc <= 0) && token == local)) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1) && 1 <= tmp)) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && !(\old(token) == local)) && 1 == m_pc) && token == local + 1))) && ((((((((((!(1 == t1_i) || (((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && !(\old(token) == local)) && 1 == m_pc) && token == local + 1) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((0 == __retres1 || !(1 == t1_i)) || !(2 <= E_M)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(t1_pc <= 0)) || !(0 == t1_st)) || !(1 == m_i)) || !(m_pc <= 0)) && ((((((((((0 == __retres1 || !(2 <= E_1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(token == local)) || !(1 == m_i))) && (((((((((0 == __retres1 || !(1 == t1_i)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(1 == m_i)) || !(m_pc <= 0))) && ((((((((((0 == __retres1 || !(2 <= E_1)) || !(token == local + 1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(1 == m_i))) && (((((((((0 == __retres1 || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(1 == m_i)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || ((((((((((2 <= E_1 && 1 == t1_i) && 2 <= T1_E) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 1 == m_i) && token == local) && 2 <= M_E) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || (((((((((2 <= E_1 && 2 <= T1_E) && 0 == t1_st) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && 1 == m_i) && token == local) && 2 <= M_E) && 2 <= m_st)) || !(1 == m_i)) && (((((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || ((((((((((2 <= E_1 && 1 == t1_i) && 2 <= T1_E) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 1 == m_i) && token == local) && 2 <= M_E) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= M_E)) || !(2 <= T1_E)) || (((((((((2 <= E_1 && 2 <= T1_E) && 0 == t1_st) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && 1 == m_i) && token == local) && 2 <= M_E) && 2 <= m_st)) || !(1 == m_i))) && ((((((((((((((2 <= E_1 && 0 == t1_st) && 1 == m_pc) && token == local) && 2 <= m_st) || !(\old(token) == \old(local))) || !(1 == t1_i)) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(0 == \old(t1_st))) || !(t1_pc <= 0)) || !(1 == m_i)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((!(2 <= E_1) || !(1 == t1_i)) || ((token == local && \old(E_M) <= E_M) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || !(\old(t1_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == m_i)) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || (((0 == m_st && 1 == t1_pc) && 2 <= E_M) && token == local + 1)) || !(2 <= M_E)) || !(2 <= T1_E)) || (((1 == t1_pc && 2 <= E_M) && token == local + 1) && 2 <= m_st)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= M_E)) || !(2 <= T1_E)) || ((0 == m_st && token == local) && \old(E_M) <= E_M)) || !(\old(token) == local)) || !(1 == m_i)) || !(m_pc <= 0)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((!(\old(token) == \old(local)) || !(1 == t1_i)) || !(2 <= \old(E_M))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) && ((((((((((!(1 == t1_i) || (((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && !(\old(token) == local)) && 1 == m_pc) && token == local + 1) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i))) && ((((((((((((!(1 == t1_i) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(0 == \old(t1_st))) || !(1 == m_i)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1) && 2 <= m_st)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || !(\old(t1_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || ((((1 == t1_pc && 2 <= t1_st) && token == local) && \old(E_M) <= E_M) && 2 <= m_st)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == m_i)) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(1 == m_i)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && token == local) && \old(E_M) <= E_M)) || !(m_pc <= 0))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || ((((1 == t1_pc && 2 <= t1_st) && 2 <= E_M) && token == local + 1) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || !(\old(t1_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == m_i)) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(1 == m_i)) || !(m_pc <= 0))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || (((1 == t1_pc && token == local) && \old(E_M) <= E_M) && 2 <= m_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == t1_i) || (((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && \old(T1_E) <= T1_E) && token == local) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || !(0 == \old(t1_st))) || !(1 == m_i)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((((0 == m_st && 2 <= E_1) && 0 == t1_st) && \old(T1_E) <= T1_E) && m_pc <= 0) && 2 <= M_E) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0)) || !(2 <= \old(E_1))) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E))) || (((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1) && \old(T1_E) <= T1_E) && 2 <= m_st) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) && (((((((((!(\old(token) == \old(local)) || !(1 == t1_i)) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(0 == \old(t1_st))) || !(t1_pc <= 0)) || !(1 == m_i))) && ((((((((((!(1 == t1_i) || !(1 == t1_pc)) || ((((2 <= t1_st && !(\old(token) == local)) && \old(E_1) <= E_1) && 1 == m_pc) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= m_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || 0 == __retres1) || !(1 == m_i)) && (((((((((!(1 == t1_i) || !(2 <= E_M)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(t1_pc <= 0)) || !(0 == t1_st)) || 0 == __retres1) || !(1 == m_i)) || !(m_pc <= 0))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(token == local)) || 0 == __retres1) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) || 0 == __retres1) || !(1 == m_i))) && (((((((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) || 0 == __retres1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(token) == local) || token == local) && 2 <= t1_st) && \old(E_1) <= E_1) && m_pc <= 0) || !(1 == t1_i)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) && ((((((((((!(\old(token) == \old(local)) || !(1 == t1_i)) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(0 == \old(t1_st))) || !(t1_pc <= 0)) || (((0 == t1_st && \old(E_1) <= E_1) && m_pc <= 0) && token == local)) || !(1 == m_i))) && ((((((((((!(1 == t1_i) || !(1 == t1_pc)) || ((((2 <= t1_st && !(\old(token) == local)) && \old(E_1) <= E_1) && 1 == m_pc) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.8s, OverallIterations: 18, TraceHistogramMax: 5, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3691 SDtfs, 3057 SDslu, 3552 SDs, 0 SdLazy, 1432 SolverSat, 651 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2831 GetRequests, 2776 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5091occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 690 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 11190 PreInvPairs, 11344 NumberOfFragments, 7627 HoareAnnotationTreeSize, 11190 FomulaSimplifications, 6172 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 62 FomulaSimplificationsInter, 12289 FormulaSimplificationTreeSizeReductionInter, 11.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2659 NumberOfCodeBlocks, 2659 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2816 ConstructedInterpolants, 0 QuantifiedInterpolants, 588797 SizeOfPredicates, 21 NumberOfNonLiveVariables, 11146 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 1487/1510 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...