/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 SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -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 18:22:37,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 18:22:37,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 18:22:37,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 18:22:37,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 18:22:37,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 18:22:37,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 18:22:37,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 18:22:37,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 18:22:37,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 18:22:37,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 18:22:37,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 18:22:37,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 18:22:37,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 18:22:37,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 18:22:37,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 18:22:37,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 18:22:37,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 18:22:37,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 18:22:37,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 18:22:37,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 18:22:37,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 18:22:37,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 18:22:37,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 18:22:37,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 18:22:37,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 18:22:37,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 18:22:37,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 18:22:37,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 18:22:37,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 18:22:37,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 18:22:37,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 18:22:37,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 18:22:37,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 18:22:37,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 18:22:37,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 18:22:37,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 18:22:37,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 18:22:37,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 18:22:37,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 18:22:37,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 18:22:37,771 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 18:22:37,803 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 18:22:37,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 18:22:37,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 18:22:37,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 18:22:37,805 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 18:22:37,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 18:22:37,806 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 18:22:37,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 18:22:37,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 18:22:37,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 18:22:37,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 18:22:37,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 18:22:37,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 18:22:37,807 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 18:22:37,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 18:22:37,807 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 18:22:37,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 18:22:37,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 18:22:37,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 18:22:37,808 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 18:22:37,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 18:22:37,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 18:22:37,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 18:22:37,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 18:22:37,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 18:22:37,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 18:22:37,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:37,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 18:22:37,810 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 18:22:37,810 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 -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 18:22:38,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 18:22:38,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 18:22:38,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 18:22:38,124 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 18:22:38,124 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 18:22:38,125 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 18:22:38,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39653f216/4bf1af5ce8c84faaabf24cbc46616807/FLAG76a636b46 [2020-07-20 18:22:38,695 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 18:22:38,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-20 18:22:38,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39653f216/4bf1af5ce8c84faaabf24cbc46616807/FLAG76a636b46 [2020-07-20 18:22:39,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39653f216/4bf1af5ce8c84faaabf24cbc46616807 [2020-07-20 18:22:39,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 18:22:39,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 18:22:39,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 18:22:39,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 18:22:39,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 18:22:39,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:22:39" (1/1) ... [2020-07-20 18:22:39,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dfa2dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39, skipping insertion in model container [2020-07-20 18:22:39,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:22:39" (1/1) ... [2020-07-20 18:22:39,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 18:22:39,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 18:22:39,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 18:22:39,331 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 18:22:39,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 18:22:39,496 INFO L208 MainTranslator]: Completed translation [2020-07-20 18:22:39,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39 WrapperNode [2020-07-20 18:22:39,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 18:22:39,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 18:22:39,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 18:22:39,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 18:22:39,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39" (1/1) ... [2020-07-20 18:22:39,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39" (1/1) ... [2020-07-20 18:22:39,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39" (1/1) ... [2020-07-20 18:22:39,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39" (1/1) ... [2020-07-20 18:22:39,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39" (1/1) ... [2020-07-20 18:22:39,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39" (1/1) ... [2020-07-20 18:22:39,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39" (1/1) ... [2020-07-20 18:22:39,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 18:22:39,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 18:22:39,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 18:22:39,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 18:22:39,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39" (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 18:22:39,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 18:22:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 18:22:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 18:22:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 18:22:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 18:22:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 18:22:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 18:22:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 18:22:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 18:22:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 18:22:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 18:22:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 18:22:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 18:22:39,613 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 18:22:39,613 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 18:22:39,613 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 18:22:39,613 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 18:22:39,613 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 18:22:39,613 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 18:22:39,613 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 18:22:39,614 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 18:22:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 18:22:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 18:22:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 18:22:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 18:22:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 18:22:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 18:22:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 18:22:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 18:22:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 18:22:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 18:22:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 18:22:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 18:22:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 18:22:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 18:22:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 18:22:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 18:22:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 18:22:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 18:22:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 18:22:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 18:22:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 18:22:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 18:22:39,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 18:22:40,119 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 18:22:40,120 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 18:22:40,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:22:40 BoogieIcfgContainer [2020-07-20 18:22:40,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 18:22:40,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 18:22:40,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 18:22:40,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 18:22:40,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:22:39" (1/3) ... [2020-07-20 18:22:40,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5d89b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:22:40, skipping insertion in model container [2020-07-20 18:22:40,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:39" (2/3) ... [2020-07-20 18:22:40,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5d89b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:22:40, skipping insertion in model container [2020-07-20 18:22:40,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:22:40" (3/3) ... [2020-07-20 18:22:40,134 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-20 18:22:40,145 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 18:22:40,153 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 18:22:40,167 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 18:22:40,195 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 18:22:40,195 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 18:22:40,195 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 18:22:40,195 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 18:22:40,196 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 18:22:40,196 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 18:22:40,196 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 18:22:40,196 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 18:22:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-20 18:22:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 18:22:40,231 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:40,233 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 18:22:40,233 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:40,240 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-20 18:22:40,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:40,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223287597] [2020-07-20 18:22:40,251 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:40,416 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:40,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:40,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 18:22:40,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:40,524 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 18:22:40,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:40,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223287597] [2020-07-20 18:22:40,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:40,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:40,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562244845] [2020-07-20 18:22:40,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:40,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:40,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:40,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:40,553 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2020-07-20 18:22:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:40,656 INFO L93 Difference]: Finished difference Result 381 states and 537 transitions. [2020-07-20 18:22:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:40,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-20 18:22:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:40,680 INFO L225 Difference]: With dead ends: 381 [2020-07-20 18:22:40,680 INFO L226 Difference]: Without dead ends: 243 [2020-07-20 18:22:40,689 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 18:22:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-07-20 18:22:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2020-07-20 18:22:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-20 18:22:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2020-07-20 18:22:40,864 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 77 [2020-07-20 18:22:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:40,865 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2020-07-20 18:22:40,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2020-07-20 18:22:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 18:22:40,869 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:40,870 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 18:22:41,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:41,084 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:41,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1330878925, now seen corresponding path program 1 times [2020-07-20 18:22:41,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:41,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1459386018] [2020-07-20 18:22:41,087 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:41,202 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:41,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:41,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 18:22:41,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:41,255 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 18:22:41,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:41,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1459386018] [2020-07-20 18:22:41,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:41,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 18:22:41,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991044945] [2020-07-20 18:22:41,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 18:22:41,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:41,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 18:22:41,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 18:22:41,260 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand 5 states. [2020-07-20 18:22:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:41,778 INFO L93 Difference]: Finished difference Result 565 states and 793 transitions. [2020-07-20 18:22:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 18:22:41,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 18:22:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:41,785 INFO L225 Difference]: With dead ends: 565 [2020-07-20 18:22:41,785 INFO L226 Difference]: Without dead ends: 346 [2020-07-20 18:22:41,789 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 18:22:41,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-07-20 18:22:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 286. [2020-07-20 18:22:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-07-20 18:22:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 364 transitions. [2020-07-20 18:22:41,837 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 364 transitions. Word has length 77 [2020-07-20 18:22:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:41,838 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 364 transitions. [2020-07-20 18:22:41,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 18:22:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 364 transitions. [2020-07-20 18:22:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 18:22:41,840 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:41,840 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 18:22:42,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:42,054 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:42,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1640766093, now seen corresponding path program 1 times [2020-07-20 18:22:42,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:42,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [968511409] [2020-07-20 18:22:42,055 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:42,166 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:42,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:42,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 18:22:42,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:42,228 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 18:22:42,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:42,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [968511409] [2020-07-20 18:22:42,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:42,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 18:22:42,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540048722] [2020-07-20 18:22:42,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 18:22:42,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 18:22:42,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 18:22:42,234 INFO L87 Difference]: Start difference. First operand 286 states and 364 transitions. Second operand 5 states. [2020-07-20 18:22:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:42,859 INFO L93 Difference]: Finished difference Result 850 states and 1107 transitions. [2020-07-20 18:22:42,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:42,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 18:22:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:42,869 INFO L225 Difference]: With dead ends: 850 [2020-07-20 18:22:42,873 INFO L226 Difference]: Without dead ends: 583 [2020-07-20 18:22:42,874 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 18:22:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-07-20 18:22:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 534. [2020-07-20 18:22:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-20 18:22:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 679 transitions. [2020-07-20 18:22:42,929 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 679 transitions. Word has length 77 [2020-07-20 18:22:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:42,930 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 679 transitions. [2020-07-20 18:22:42,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 18:22:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 679 transitions. [2020-07-20 18:22:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 18:22:42,932 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:42,932 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 18:22:43,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:43,146 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:43,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:43,147 INFO L82 PathProgramCache]: Analyzing trace with hash -690298419, now seen corresponding path program 1 times [2020-07-20 18:22:43,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:43,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [205213988] [2020-07-20 18:22:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:43,232 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 18:22:43,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:43,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 18:22:43,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:43,315 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 18:22:43,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:43,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [205213988] [2020-07-20 18:22:43,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:43,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 18:22:43,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214796264] [2020-07-20 18:22:43,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 18:22:43,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:43,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 18:22:43,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 18:22:43,324 INFO L87 Difference]: Start difference. First operand 534 states and 679 transitions. Second operand 5 states. [2020-07-20 18:22:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:43,674 INFO L93 Difference]: Finished difference Result 1049 states and 1351 transitions. [2020-07-20 18:22:43,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 18:22:43,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 18:22:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:43,678 INFO L225 Difference]: With dead ends: 1049 [2020-07-20 18:22:43,679 INFO L226 Difference]: Without dead ends: 534 [2020-07-20 18:22:43,681 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 18:22:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-07-20 18:22:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2020-07-20 18:22:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-20 18:22:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 667 transitions. [2020-07-20 18:22:43,722 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 667 transitions. Word has length 77 [2020-07-20 18:22:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:43,723 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 667 transitions. [2020-07-20 18:22:43,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 18:22:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 667 transitions. [2020-07-20 18:22:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 18:22:43,725 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:43,725 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 18:22:43,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:43,939 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:43,940 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-20 18:22:43,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:43,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [718285636] [2020-07-20 18:22:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:44,010 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:44,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:44,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 18:22:44,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:44,060 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 18:22:44,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:44,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [718285636] [2020-07-20 18:22:44,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:44,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 18:22:44,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796785055] [2020-07-20 18:22:44,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 18:22:44,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:44,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 18:22:44,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 18:22:44,063 INFO L87 Difference]: Start difference. First operand 534 states and 667 transitions. Second operand 5 states. [2020-07-20 18:22:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:44,507 INFO L93 Difference]: Finished difference Result 1198 states and 1580 transitions. [2020-07-20 18:22:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:44,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-20 18:22:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:44,515 INFO L225 Difference]: With dead ends: 1198 [2020-07-20 18:22:44,515 INFO L226 Difference]: Without dead ends: 683 [2020-07-20 18:22:44,518 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 18:22:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2020-07-20 18:22:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 588. [2020-07-20 18:22:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-07-20 18:22:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 709 transitions. [2020-07-20 18:22:44,592 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 709 transitions. Word has length 77 [2020-07-20 18:22:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:44,592 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 709 transitions. [2020-07-20 18:22:44,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 18:22:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 709 transitions. [2020-07-20 18:22:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 18:22:44,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:44,597 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 18:22:44,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:44,811 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:44,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:44,812 INFO L82 PathProgramCache]: Analyzing trace with hash 899075215, now seen corresponding path program 1 times [2020-07-20 18:22:44,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:44,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [12709517] [2020-07-20 18:22:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:44,878 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:44,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:44,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 18:22:44,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:44,920 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 18:22:44,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:44,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [12709517] [2020-07-20 18:22:44,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:44,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 18:22:44,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675476506] [2020-07-20 18:22:44,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 18:22:44,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:44,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 18:22:44,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:44,925 INFO L87 Difference]: Start difference. First operand 588 states and 709 transitions. Second operand 6 states. [2020-07-20 18:22:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:44,993 INFO L93 Difference]: Finished difference Result 1176 states and 1450 transitions. [2020-07-20 18:22:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:44,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-20 18:22:44,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:44,999 INFO L225 Difference]: With dead ends: 1176 [2020-07-20 18:22:44,999 INFO L226 Difference]: Without dead ends: 608 [2020-07-20 18:22:45,006 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 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 18:22:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-07-20 18:22:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 598. [2020-07-20 18:22:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2020-07-20 18:22:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 711 transitions. [2020-07-20 18:22:45,048 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 711 transitions. Word has length 77 [2020-07-20 18:22:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:45,050 INFO L479 AbstractCegarLoop]: Abstraction has 598 states and 711 transitions. [2020-07-20 18:22:45,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 18:22:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 711 transitions. [2020-07-20 18:22:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 18:22:45,053 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:45,053 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 18:22:45,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:45,268 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:45,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:45,269 INFO L82 PathProgramCache]: Analyzing trace with hash -472732083, now seen corresponding path program 1 times [2020-07-20 18:22:45,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:45,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517579201] [2020-07-20 18:22:45,271 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:45,355 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:45,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:45,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 18:22:45,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:45,383 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 18:22:45,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:45,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517579201] [2020-07-20 18:22:45,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:45,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 18:22:45,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816995632] [2020-07-20 18:22:45,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 18:22:45,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 18:22:45,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:45,386 INFO L87 Difference]: Start difference. First operand 598 states and 711 transitions. Second operand 6 states. [2020-07-20 18:22:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:45,465 INFO L93 Difference]: Finished difference Result 1190 states and 1444 transitions. [2020-07-20 18:22:45,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:45,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-20 18:22:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:45,470 INFO L225 Difference]: With dead ends: 1190 [2020-07-20 18:22:45,471 INFO L226 Difference]: Without dead ends: 612 [2020-07-20 18:22:45,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 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 18:22:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-07-20 18:22:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2020-07-20 18:22:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-07-20 18:22:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 713 transitions. [2020-07-20 18:22:45,516 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 713 transitions. Word has length 77 [2020-07-20 18:22:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:45,518 INFO L479 AbstractCegarLoop]: Abstraction has 608 states and 713 transitions. [2020-07-20 18:22:45,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 18:22:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 713 transitions. [2020-07-20 18:22:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-20 18:22:45,519 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:45,519 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 18:22:45,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:45,733 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:45,733 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2020-07-20 18:22:45,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:45,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [449878000] [2020-07-20 18:22:45,735 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:45,814 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 18:22:45,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:45,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 18:22:45,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:45,844 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 18:22:45,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:45,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [449878000] [2020-07-20 18:22:45,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:45,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:45,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062960446] [2020-07-20 18:22:45,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:45,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:45,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:45,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:45,847 INFO L87 Difference]: Start difference. First operand 608 states and 713 transitions. Second operand 3 states. [2020-07-20 18:22:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:45,917 INFO L93 Difference]: Finished difference Result 1748 states and 2108 transitions. [2020-07-20 18:22:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:45,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-20 18:22:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:45,924 INFO L225 Difference]: With dead ends: 1748 [2020-07-20 18:22:45,924 INFO L226 Difference]: Without dead ends: 1160 [2020-07-20 18:22:45,927 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 18:22:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-07-20 18:22:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1156. [2020-07-20 18:22:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2020-07-20 18:22:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1349 transitions. [2020-07-20 18:22:46,011 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1349 transitions. Word has length 77 [2020-07-20 18:22:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:46,012 INFO L479 AbstractCegarLoop]: Abstraction has 1156 states and 1349 transitions. [2020-07-20 18:22:46,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1349 transitions. [2020-07-20 18:22:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-20 18:22:46,016 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:46,016 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 18:22:46,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:46,231 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:46,231 INFO L82 PathProgramCache]: Analyzing trace with hash 772889349, now seen corresponding path program 1 times [2020-07-20 18:22:46,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:46,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1628155551] [2020-07-20 18:22:46,233 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:46,282 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:46,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:46,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 18:22:46,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:46,335 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 18:22:46,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:46,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1628155551] [2020-07-20 18:22:46,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:46,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:46,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654274765] [2020-07-20 18:22:46,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:46,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:46,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:46,339 INFO L87 Difference]: Start difference. First operand 1156 states and 1349 transitions. Second operand 3 states. [2020-07-20 18:22:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:46,443 INFO L93 Difference]: Finished difference Result 2900 states and 3451 transitions. [2020-07-20 18:22:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:46,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-20 18:22:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:46,454 INFO L225 Difference]: With dead ends: 2900 [2020-07-20 18:22:46,454 INFO L226 Difference]: Without dead ends: 1347 [2020-07-20 18:22:46,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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 18:22:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-07-20 18:22:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2020-07-20 18:22:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2020-07-20 18:22:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1576 transitions. [2020-07-20 18:22:46,552 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1576 transitions. Word has length 121 [2020-07-20 18:22:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:46,554 INFO L479 AbstractCegarLoop]: Abstraction has 1347 states and 1576 transitions. [2020-07-20 18:22:46,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1576 transitions. [2020-07-20 18:22:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-20 18:22:46,564 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:46,564 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, 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] [2020-07-20 18:22:46,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:46,779 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:46,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:46,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1062947847, now seen corresponding path program 1 times [2020-07-20 18:22:46,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:46,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1499208194] [2020-07-20 18:22:46,781 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:46,906 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:46,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:46,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 18:22:46,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-20 18:22:46,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:46,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1499208194] [2020-07-20 18:22:46,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:46,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:46,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852865308] [2020-07-20 18:22:46,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:46,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:46,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:46,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:46,945 INFO L87 Difference]: Start difference. First operand 1347 states and 1576 transitions. Second operand 3 states. [2020-07-20 18:22:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:47,077 INFO L93 Difference]: Finished difference Result 2667 states and 3166 transitions. [2020-07-20 18:22:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:47,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-20 18:22:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:47,084 INFO L225 Difference]: With dead ends: 2667 [2020-07-20 18:22:47,085 INFO L226 Difference]: Without dead ends: 1341 [2020-07-20 18:22:47,090 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 18:22:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-07-20 18:22:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2020-07-20 18:22:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2020-07-20 18:22:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1552 transitions. [2020-07-20 18:22:47,166 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1552 transitions. Word has length 174 [2020-07-20 18:22:47,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:47,166 INFO L479 AbstractCegarLoop]: Abstraction has 1341 states and 1552 transitions. [2020-07-20 18:22:47,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1552 transitions. [2020-07-20 18:22:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 18:22:47,170 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:47,171 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, 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] [2020-07-20 18:22:47,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:47,372 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:47,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:47,373 INFO L82 PathProgramCache]: Analyzing trace with hash 594245413, now seen corresponding path program 1 times [2020-07-20 18:22:47,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:47,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2093780706] [2020-07-20 18:22:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:47,463 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:47,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:47,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 18:22:47,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-20 18:22:47,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:47,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2093780706] [2020-07-20 18:22:47,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:47,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:47,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841529144] [2020-07-20 18:22:47,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:47,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:47,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:47,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:47,519 INFO L87 Difference]: Start difference. First operand 1341 states and 1552 transitions. Second operand 3 states. [2020-07-20 18:22:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:47,655 INFO L93 Difference]: Finished difference Result 3117 states and 3644 transitions. [2020-07-20 18:22:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:47,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 18:22:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:47,665 INFO L225 Difference]: With dead ends: 3117 [2020-07-20 18:22:47,666 INFO L226 Difference]: Without dead ends: 896 [2020-07-20 18:22:47,676 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 18:22:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-20 18:22:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-20 18:22:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-20 18:22:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1013 transitions. [2020-07-20 18:22:47,760 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1013 transitions. Word has length 175 [2020-07-20 18:22:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:47,761 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1013 transitions. [2020-07-20 18:22:47,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1013 transitions. [2020-07-20 18:22:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-20 18:22:47,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:47,765 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, 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] [2020-07-20 18:22:47,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:47,979 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 190747775, now seen corresponding path program 1 times [2020-07-20 18:22:47,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:47,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1152618212] [2020-07-20 18:22:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:48,124 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 18:22:48,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:48,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 18:22:48,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:48,153 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 18:22:48,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:48,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1152618212] [2020-07-20 18:22:48,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:48,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:48,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98411312] [2020-07-20 18:22:48,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:48,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:48,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:48,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:48,156 INFO L87 Difference]: Start difference. First operand 896 states and 1013 transitions. Second operand 3 states. [2020-07-20 18:22:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:48,215 INFO L93 Difference]: Finished difference Result 1594 states and 1836 transitions. [2020-07-20 18:22:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:48,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-20 18:22:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:48,221 INFO L225 Difference]: With dead ends: 1594 [2020-07-20 18:22:48,221 INFO L226 Difference]: Without dead ends: 896 [2020-07-20 18:22:48,224 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 18:22:48,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-20 18:22:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-20 18:22:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-20 18:22:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1005 transitions. [2020-07-20 18:22:48,273 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1005 transitions. Word has length 175 [2020-07-20 18:22:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:48,273 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1005 transitions. [2020-07-20 18:22:48,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1005 transitions. [2020-07-20 18:22:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-20 18:22:48,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:48,276 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, 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] [2020-07-20 18:22:48,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:48,491 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:48,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:48,491 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-20 18:22:48,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:48,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [646005565] [2020-07-20 18:22:48,492 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 18:22:48,658 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 18:22:48,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:48,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 18:22:48,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:48,742 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 18:22:48,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 18:22:49,017 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 18:22:49,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [646005565] [2020-07-20 18:22:49,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 18:22:49,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2020-07-20 18:22:49,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700102525] [2020-07-20 18:22:49,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 18:22:49,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 18:22:49,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 18:22:49,020 INFO L87 Difference]: Start difference. First operand 896 states and 1005 transitions. Second operand 6 states. [2020-07-20 18:22:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:49,499 INFO L93 Difference]: Finished difference Result 920 states and 1037 transitions. [2020-07-20 18:22:49,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:49,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-07-20 18:22:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:49,501 INFO L225 Difference]: With dead ends: 920 [2020-07-20 18:22:49,501 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 18:22:49,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 18:22:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 18:22:49,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 18:22:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 18:22:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 18:22:49,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-20 18:22:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:49,505 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 18:22:49,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 18:22:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 18:22:49,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 18:22:49,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:49,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 18:22:49,853 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 18:22:52,268 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-20 18:22:52,656 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 45 [2020-07-20 18:22:52,927 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-07-20 18:22:53,233 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 18:22:53,559 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 18:22:53,975 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 18:22:54,323 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 18:22:54,699 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 18:22:55,172 WARN L193 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2020-07-20 18:22:55,559 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-07-20 18:22:56,229 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 60 [2020-07-20 18:22:56,512 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-07-20 18:22:57,055 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-07-20 18:22:57,580 WARN L193 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-07-20 18:22:58,052 WARN L193 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2020-07-20 18:22:58,385 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 18:22:58,536 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-07-20 18:22:59,351 WARN L193 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-20 18:22:59,633 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 43 [2020-07-20 18:22:59,793 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-20 18:23:00,638 WARN L193 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-20 18:23:00,906 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-07-20 18:23:01,213 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 18:23:02,056 WARN L193 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-20 18:23:02,369 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2020-07-20 18:23:02,835 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-07-20 18:23:03,063 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-20 18:23:03,290 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-20 18:23:03,511 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-20 18:23:03,693 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2020-07-20 18:23:04,257 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2020-07-20 18:23:04,481 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-07-20 18:23:04,905 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2020-07-20 18:23:05,226 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-20 18:23:05,842 WARN L193 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-07-20 18:23:06,204 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-07-20 18:23:06,464 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-07-20 18:23:06,657 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-07-20 18:23:06,891 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-07-20 18:23:07,185 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-07-20 18:23:07,215 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-20 18:23:07,216 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse4 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (<= 2 ~m_st~0)) (.cse8 (not (= 1 ~t1_pc~0))) (.cse5 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse7 (<= 2 ~t1_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse1 .cse7 (not (<= ~t1_pc~0 0)) .cse4) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse8 .cse1 .cse2 .cse3) (or .cse8 .cse5 .cse6 .cse1 (not (= ~token~0 ~local~0)) .cse7))) [2020-07-20 18:23:07,216 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-20 18:23:07,216 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse3 (<= 2 ~E_M~0)) (.cse11 (<= 2 ~m_st~0))) (let ((.cse4 (and .cse3 .cse11)) (.cse2 (= 0 ~m_st~0)) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse9 (not (<= |old(~t1_pc~0)| 0))) (.cse10 (<= |old(~E_M~0)| ~E_M~0)) (.cse5 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= 1 ~t1_pc~0) .cse3 (= ~token~0 (+ ~local~0 1))) .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse5 .cse4 .cse7 .cse8) (or .cse0 .cse1 .cse9 (not (= 0 |old(~m_st~0)|)) .cse5 (and .cse2 (= ~token~0 ~local~0) .cse10) .cse6 .cse8) (or .cse0 .cse1 .cse9 (and .cse10 .cse11) .cse5 .cse7)))) [2020-07-20 18:23:07,216 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-20 18:23:07,217 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse2 (= ~token~0 ~local~0)) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and (= 1 ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 (and .cse3 .cse4) .cse5 .cse7 .cse8) (or (and (= 0 ~m_st~0) .cse2 .cse3 .cse9) .cse0 .cse1 .cse10 (not (= 0 |old(~m_st~0)|)) .cse5 .cse6 .cse8) (or .cse0 .cse1 (and .cse3 .cse9 .cse4) .cse10 .cse5 .cse7))) [2020-07-20 18:23:07,217 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-20 18:23:07,217 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= 2 ~m_st~0)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse7 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (and (= 1 ~t1_pc~0) (= ~token~0 ~local~0) .cse5 .cse6) .cse3 .cse7 .cse4 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 (and .cse5 .cse6) .cse3 .cse4 .cse8) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse7 .cse8))) [2020-07-20 18:23:07,217 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-20 18:23:07,218 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~m_st~0)) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse8 (not (= |old(~token~0)| ~local~0))) (.cse2 (= 0 ~m_st~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse11 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~token~0 (+ ~local~0 1))) .cse6 (and .cse4 .cse5 .cse7) .cse8 .cse9 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse6 (and .cse5 .cse7) .cse9 .cse10) (or (and .cse4 .cse11 .cse7) .cse0 .cse1 .cse12 .cse6 .cse9) (or .cse0 .cse1 .cse12 (not (= 0 |old(~m_st~0)|)) .cse6 .cse8 (and .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse11) .cse10))) [2020-07-20 18:23:07,218 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse7 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (and (= 1 ~t1_pc~0) (= ~token~0 (+ ~local~0 1)) .cse5) .cse3 .cse6 .cse4 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 .cse7))) [2020-07-20 18:23:07,218 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-20 18:23:07,218 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-20 18:23:07,218 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-20 18:23:07,218 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-20 18:23:07,219 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-20 18:23:07,219 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse3 (not (<= ~t1_pc~0 0))) (.cse7 (<= 2 ~t1_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (= 0 ~m_st~0)) (.cse10 (not (= 1 ~t1_pc~0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse13 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4 (and .cse7 .cse5)) (or .cse0 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse1 .cse6 (and .cse12 .cse7) .cse2) (or .cse1 .cse6 .cse2 .cse7 .cse3 .cse8) (or .cse0 .cse12 .cse11 .cse1 .cse6 .cse2 .cse3 .cse8) (or .cse0 .cse9 .cse10 .cse2 .cse4 .cse5) (or .cse0 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (or .cse12 .cse0 .cse11 .cse1 .cse2 .cse13 .cse3 .cse8) (or .cse10 .cse1 .cse6 .cse2 .cse13 .cse7) (or .cse0 .cse12 .cse10 .cse11 .cse1 .cse6 .cse2 .cse13 .cse8))) [2020-07-20 18:23:07,219 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse10 (= 0 activate_threads_~tmp~1)) (.cse13 (<= 2 ~m_st~0))) (let ((.cse15 (and .cse10 .cse13)) (.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse0 (= 0 ~m_st~0)) (.cse3 (not (= 0 |old(~m_st~0)|))) (.cse7 (not (= ~token~0 ~local~0))) (.cse14 (not (<= ~t1_pc~0 0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse1 (not (<= 2 ~E_1~0))) (.cse11 (<= 2 ~t1_st~0)) (.cse4 (not (<= 2 ~E_M~0))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse10 .cse0 .cse11)) (or .cse1 .cse6 .cse12 .cse13 .cse8) (or .cse2 .cse4 .cse5 (and .cse10 .cse11) .cse6 .cse7) (or .cse10 .cse4 .cse6 .cse14 .cse8) (or .cse1 .cse4 .cse15 .cse6 .cse14 .cse12) (or .cse1 .cse2 .cse4 .cse15 .cse6 .cse7 .cse12) (or .cse1 .cse10 .cse4 .cse6 .cse12 .cse8) (or .cse4 .cse5 .cse6 .cse11 .cse14 .cse8) (or .cse1 .cse0 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (or .cse1 .cse0 .cse9 .cse2 .cse6 .cse12 .cse13) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse14 .cse8) (or .cse1 (and .cse10 .cse11 .cse13) .cse4 .cse5 .cse6 .cse12)))) [2020-07-20 18:23:07,219 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-20 18:23:07,219 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse3 (not (<= ~t1_pc~0 0))) (.cse7 (<= 2 ~t1_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (= 0 ~m_st~0)) (.cse10 (not (= 1 ~t1_pc~0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse13 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4 (and .cse7 .cse5)) (or .cse0 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse1 .cse6 (and .cse12 .cse7) .cse2) (or .cse1 .cse6 .cse2 .cse7 .cse3 .cse8) (or .cse0 .cse12 .cse11 .cse1 .cse6 .cse2 .cse3 .cse8) (or .cse0 .cse9 .cse10 .cse2 .cse4 .cse5) (or .cse0 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (or .cse12 .cse0 .cse11 .cse1 .cse2 .cse13 .cse3 .cse8) (or .cse10 .cse1 .cse6 .cse2 .cse13 .cse7) (or .cse0 .cse12 .cse10 .cse11 .cse1 .cse6 .cse2 .cse13 .cse8))) [2020-07-20 18:23:07,220 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-20 18:23:07,220 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-20 18:23:07,220 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-20 18:23:07,220 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-20 18:23:07,220 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-20 18:23:07,220 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-20 18:23:07,220 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-20 18:23:07,220 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-20 18:23:07,221 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-20 18:23:07,221 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-20 18:23:07,221 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_M~0))) (.cse3 (not (<= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_1~0))) (.cse5 (not (= 1 ~t1_pc~0))) (.cse6 (not (= 0 ~m_st~0))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (= 0 is_transmit1_triggered_~__retres1~1))) (and (or .cse0 .cse1 (not (<= ~t1_pc~0 0)) .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse0 (not (<= 2 ~t1_st~0)) .cse1 (not (= ~token~0 ~local~0)) .cse2 .cse3) (or .cse4 (not (<= 2 ~m_st~0)) .cse1 .cse2) (or .cse4 (not (= ~token~0 (+ ~local~0 1))) .cse5 .cse6 .cse1 .cse2))) [2020-07-20 18:23:07,221 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-20 18:23:07,221 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-20 18:23:07,221 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-20 18:23:07,221 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 18:23:07,221 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 18:23:07,222 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-20 18:23:07,222 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse7 (not (<= ~m_pc~0 0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |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))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse10 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse8 .cse2 .cse9 .cse3 .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse3 .cse10 .cse6) (or .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2020-07-20 18:23:07,222 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-20 18:23:07,222 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-20 18:23:07,222 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-20 18:23:07,222 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-20 18:23:07,223 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (= 0 ~m_st~0) (not (= 0 |old(~m_st~0)|)) (not (<= 2 ~E_M~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (= ~token~0 ~local~0)) (not (<= ~t1_pc~0 0)) (not (<= ~m_pc~0 0))) [2020-07-20 18:23:07,223 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-20 18:23:07,223 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~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 (= |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)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 18:23:07,223 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-20 18:23:07,223 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-20 18:23:07,223 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-20 18:23:07,224 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~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 (= |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)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 18:23:07,224 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~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 (= |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)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 18:23:07,224 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-20 18:23:07,224 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-20 18:23:07,224 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-20 18:23:07,224 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-20 18:23:07,225 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-20 18:23:07,225 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-20 18:23:07,225 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) (<= 2 ~t1_st~0) (<= |old(~E_1~0)| ~E_1~0) (= ~token~0 (+ ~local~0 1))) .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4) (or .cse1 .cse3 .cse5 .cse4 (not (<= ~t1_pc~0 0))) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4))) [2020-07-20 18:23:07,225 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse12 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~E_1~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse8 (<= 2 ~m_st~0))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse3 (and .cse7 .cse11 .cse8)) (.cse6 (and .cse7 .cse12 .cse13 (= ~token~0 ~local~0) .cse8)) (.cse1 (not .cse13)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse12)) (.cse10 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6) (or (and .cse7 .cse8) .cse1 .cse4 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6) (or .cse1 .cse2 .cse4 .cse9 .cse5 .cse11 .cse10)))) [2020-07-20 18:23:07,225 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4) (or .cse1 .cse3 .cse5 .cse4 (not (<= ~t1_pc~0 0))) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4))) [2020-07-20 18:23:07,226 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (<= |old(~E_1~0)| ~E_1~0)) (.cse8 (<= ~m_pc~0 0)) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= |old(~m_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) .cse1 .cse2 (= ~token~0 (+ ~local~0 1))) .cse3 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse3 .cse4 .cse5 .cse7 .cse6 (and .cse1 .cse2 .cse8 (= ~token~0 ~local~0))) (or .cse3 .cse5 .cse7 .cse6 .cse9 (and .cse2 .cse8)) (or .cse3 .cse4 .cse5 .cse7 .cse6 .cse1 .cse9))) [2020-07-20 18:23:07,226 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (not (<= ~t1_pc~0 0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (<= 2 ~t1_st~0)) (.cse5 (<= ~m_pc~0 0)) (.cse9 (= ~token~0 ~local~0)) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= |old(~m_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse7 .cse1 .cse3 (and .cse8 .cse9)) (or .cse0 .cse7 .cse1 .cse2 .cse3 .cse8 .cse4) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse6 .cse0 .cse7 (and .cse8 .cse5 .cse9) .cse1 .cse2 .cse3))) [2020-07-20 18:23:07,226 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-20 18:23:07,226 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (<= |old(~E_1~0)| ~E_1~0)) (.cse8 (<= ~m_pc~0 0)) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= |old(~m_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) .cse1 .cse2 (= ~token~0 (+ ~local~0 1))) .cse3 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse3 .cse4 .cse5 .cse7 .cse6 (and .cse1 .cse2 .cse8 (= ~token~0 ~local~0))) (or .cse3 .cse5 .cse7 .cse6 .cse9 (and .cse2 .cse8)) (or .cse3 .cse4 .cse5 .cse7 .cse6 .cse1 .cse9))) [2020-07-20 18:23:07,226 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-20 18:23:07,227 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-20 18:23:07,227 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse5 (not (= ~token~0 ~local~0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse9 (not (<= ~m_pc~0 0))) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (not (= 0 ~m_st~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse6 (<= |old(~M_E~0)| ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse8 .cse4 .cse5 .cse6 .cse9) (or .cse0 .cse2 .cse3 .cse4 .cse10 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse9) (or .cse0 .cse7 .cse2 .cse4 .cse5 .cse10 .cse6 .cse9) (or .cse0 .cse7 .cse2 .cse8 .cse4 .cse10 .cse6 .cse9) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse7 .cse2 .cse8 .cse4 .cse6))) [2020-07-20 18:23:07,227 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-20 18:23:07,227 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 18:23:07,227 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 18:23:07,227 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 18:23:07,228 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (<= 2 ~t1_st~0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (= 1 |old(~t1_pc~0)|))) (.cse15 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse17 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse12 (not (<= |old(~m_pc~0)| 0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse13 (= 0 ~m_st~0)) (.cse3 (<= |old(~E_1~0)| ~E_1~0)) (.cse14 (<= ~m_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse4 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8) (or .cse0 (and .cse3 .cse4 .cse9 .cse5) .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse10 .cse11 .cse1 .cse6 .cse12 .cse7 (and .cse13 .cse2 .cse3 .cse14 .cse4 .cse9)) (or .cse0 .cse11 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse1 .cse6 .cse7 (and .cse13 .cse15 (not (= |old(~token~0)| ~local~0)) .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) .cse16) (or .cse17 .cse0 .cse11 .cse1 .cse6 .cse12 .cse7 (and .cse13 .cse15 .cse2 .cse3 .cse14 .cse18 .cse4) .cse16) (or .cse0 .cse6 .cse12 .cse7 .cse8 (and .cse3 .cse14 .cse4 .cse5)) (or .cse17 .cse0 .cse6 .cse7 .cse8 .cse16 (and .cse15 .cse3 .cse18 .cse4 .cse5)) (or .cse17 .cse0 .cse10 .cse11 .cse6 .cse12 .cse7 (and .cse13 .cse3 .cse14 .cse18 .cse4 .cse9)))) [2020-07-20 18:23:07,228 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-20 18:23:07,228 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-20 18:23:07,228 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-20 18:23:07,228 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-20 18:23:07,229 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-20 18:23:07,229 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse17 (<= |old(~E_M~0)| ~E_M~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse19 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_M~0)) (.cse16 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0))) (let ((.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (= 0 |old(~m_st~0)|))) (.cse7 (and .cse12 .cse19 (= 1 ~t1_pc~0) .cse13 .cse16 .cse15)) (.cse14 (<= ~m_pc~0 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= |old(~m_pc~0)| 0))) (.cse3 (not .cse19)) (.cse5 (and .cse12 .cse17 .cse18 .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse7 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse8 .cse2 .cse3 .cse9) (or .cse0 .cse1 .cse6 .cse8 .cse2 .cse10 .cse3) (or .cse0 .cse8 .cse2 .cse3 .cse4) (or .cse11 .cse0 .cse6 .cse7 .cse8 .cse2 .cse10 .cse3 .cse9) (or .cse11 .cse0 .cse7 .cse2 .cse3 .cse4 .cse9) (or (and .cse12 .cse13 .cse14 .cse15) .cse0 .cse2 .cse10 .cse3 .cse4) (or .cse11 .cse0 .cse1 .cse6 .cse7 (and (= 0 ~m_st~0) .cse12 .cse14 .cse16 .cse17 .cse18) .cse2 .cse10 .cse3 .cse5)))) [2020-07-20 18:23:07,229 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-20 18:23:07,229 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-20 18:23:07,230 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse13 (<= ~m_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse17 (= 1 ~t1_pc~0)) (.cse16 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~E_M~0))) (let ((.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse4 (and .cse12 .cse17 .cse16 .cse18 (= ~token~0 (+ ~local~0 1)))) (.cse8 (and .cse12 .cse17 .cse16 .cse18 .cse13 (= ~token~0 ~local~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse11 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (not (= 0 |old(~m_st~0)|))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= |old(~m_pc~0)| 0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse14 (<= |old(~E_M~0)| ~E_M~0)) (.cse15 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse3 .cse5 .cse7 .cse10) (or .cse1 .cse11 .cse5 .cse7 .cse10) (or .cse1 .cse5 .cse6 .cse7 .cse10) (or .cse1 .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse3 .cse4 .cse5 .cse7 .cse9) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse10 .cse9) (or .cse0 .cse1 .cse11 .cse2 (and .cse12 .cse13 .cse14 .cse15) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse11 .cse2 .cse3 .cse5 .cse6 .cse7 (and .cse12 .cse16 .cse13 .cse14 .cse15))))) [2020-07-20 18:23:07,230 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-20 18:23:07,230 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-20 18:23:07,230 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-20 18:23:07,230 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-20 18:23:07,231 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-20 18:23:07,231 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-20 18:23:07,231 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-20 18:23:07,231 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-20 18:23:07,231 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-20 18:23:07,231 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-20 18:23:07,231 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-20 18:23:07,231 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-20 18:23:07,232 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse7 (not (<= ~m_pc~0 0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |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))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse10 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse8 .cse2 .cse9 .cse3 .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse3 .cse10 .cse6) (or .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2020-07-20 18:23:07,232 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 18:23:07,232 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 18:23:07,232 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-20 18:23:07,232 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-20 18:23:07,232 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-20 18:23:07,232 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-20 18:23:07,233 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~E_1~0)| ~E_1~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (<= |old(~M_E~0)| ~M_E~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~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 .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,233 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~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 (= |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)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 18:23:07,233 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-20 18:23:07,233 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~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 (= |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)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 18:23:07,233 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 (= ~token~0 (+ ~local~0 1))) (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 .cse0 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (and .cse1 .cse8 .cse9 .cse2 .cse4 .cse7) (and .cse1 .cse9 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,234 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,234 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,234 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,234 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,235 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,235 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-20 18:23:07,235 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,235 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-20 18:23:07,235 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,235 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (and (= 0 ~m_st~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~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 (= |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)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-20 18:23:07,236 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~E_1~0)| ~E_1~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (<= |old(~M_E~0)| ~M_E~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~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 .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,236 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~E_1~0)| ~E_1~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (<= |old(~M_E~0)| ~M_E~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~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 .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,236 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,236 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-20 18:23:07,236 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,237 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-20 18:23:07,237 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-20 18:23:07,237 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-07-20 18:23:07,237 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-20 18:23:07,237 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-20 18:23:07,237 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse3 (not (<= 2 ~t1_st~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse7 (not (= ~token~0 ~local~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse8 (not (<= ~t1_pc~0 0))) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse1 (not (<= 2 ~E_1~0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse9 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse5 .cse7) (or .cse1 .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse6 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse5) (or .cse0 .cse2 .cse5 .cse8 .cse9) (or .cse1 .cse0 .cse6 .cse2 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse1 .cse4 .cse5 .cse9))) [2020-07-20 18:23:07,238 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-20 18:23:07,238 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-20 18:23:07,238 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-20 18:23:07,238 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-20 18:23:07,238 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-20 18:23:07,238 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-20 18:23:07,238 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 18:23:07,238 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) (<= 2 ~E_M~0) (<= ~m_pc~0 0) (= ~token~0 ~local~0) (<= 2 ~M_E~0) (<= ~t1_pc~0 0)) [2020-07-20 18:23:07,239 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 18:23:07,239 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 18:23:07,239 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-20 18:23:07,239 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 18:23:07,239 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse6 (not (= ~token~0 ~local~0))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse3 (not (= 0 ~m_st~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |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))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse7 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse9 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse5 .cse10 .cse6 .cse7) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse7 .cse8) (or .cse0 .cse1 .cse5 .cse10 .cse7 .cse8) (or .cse0 .cse1 .cse4 .cse5 .cse10 .cse7) (or .cse0 .cse1 .cse5 .cse10 .cse9 .cse7))) [2020-07-20 18:23:07,239 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-20 18:23:07,239 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 18:23:07,239 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-20 18:23:07,240 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-20 18:23:07,240 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-20 18:23:07,240 INFO L271 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2020-07-20 18:23:07,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:23:07 BoogieIcfgContainer [2020-07-20 18:23:07,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 18:23:07,290 INFO L168 Benchmark]: Toolchain (without parser) took 28240.24 ms. Allocated memory was 145.2 MB in the beginning and 532.2 MB in the end (delta: 386.9 MB). Free memory was 103.4 MB in the beginning and 102.8 MB in the end (delta: 632.0 kB). Peak memory consumption was 390.4 MB. Max. memory is 7.1 GB. [2020-07-20 18:23:07,290 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 18:23:07,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.69 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 103.2 MB in the beginning and 182.7 MB in the end (delta: -79.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2020-07-20 18:23:07,292 INFO L168 Benchmark]: Boogie Preprocessor took 52.23 ms. Allocated memory is still 203.9 MB. Free memory was 182.7 MB in the beginning and 180.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-20 18:23:07,292 INFO L168 Benchmark]: RCFGBuilder took 575.44 ms. Allocated memory is still 203.9 MB. Free memory was 180.3 MB in the beginning and 148.7 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. [2020-07-20 18:23:07,293 INFO L168 Benchmark]: TraceAbstraction took 27161.60 ms. Allocated memory was 203.9 MB in the beginning and 532.2 MB in the end (delta: 328.2 MB). Free memory was 148.0 MB in the beginning and 102.8 MB in the end (delta: 45.3 MB). Peak memory consumption was 376.3 MB. Max. memory is 7.1 GB. [2020-07-20 18:23:07,295 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 444.69 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 103.2 MB in the beginning and 182.7 MB in the end (delta: -79.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.23 ms. Allocated memory is still 203.9 MB. Free memory was 182.7 MB in the beginning and 180.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 575.44 ms. Allocated memory is still 203.9 MB. Free memory was 180.3 MB in the beginning and 148.7 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27161.60 ms. Allocated memory was 203.9 MB in the beginning and 532.2 MB in the end (delta: 328.2 MB). Free memory was 148.0 MB in the beginning and 102.8 MB in the end (delta: 45.3 MB). Peak memory consumption was 376.3 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: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && (((((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local))) && (((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && ((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st))) && (((((((((((((((((0 == m_st && 2 <= E_1) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(token) == \old(local))) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st))) && ((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0))) && ((((((((2 <= E_1 && 2 <= E_M) && m_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((0 == __retres1 || !(2 <= E_1)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) && (((((0 == __retres1 || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local))) && (((((((!(2 <= E_1) || 0 == __retres1) || !(token == local + 1)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E))) && ((((0 == __retres1 || !(2 <= E_M)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc <= 0))) && ((((((!(2 <= E_1) || 0 == __retres1) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(token == local))) && (((((0 == __retres1 || !(2 <= E_1)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((0 == __retres1 || !(2 <= E_1)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(m_pc <= 0)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || ((2 <= E_1 && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && token == local) && 2 <= m_st)) && ((((((2 <= E_1 && 2 <= m_st) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || ((2 <= E_1 && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && token == local) && 2 <= m_st))) && ((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((0 == m_st && 1 == t1_pc) && 2 <= E_M) && token == local + 1)) || (2 <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(2 <= T1_E)) || (2 <= E_M && 2 <= m_st)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || ((0 == m_st && token == local) && \old(E_M) <= E_M)) || !(\old(token) == local)) || !(m_pc <= 0))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || (\old(E_M) <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && (((((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local))) && (((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && ((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st))) && (((((((((((((((((0 == m_st && 2 <= E_1) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(token) == \old(local))) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st))) && ((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0))) && ((((((((2 <= E_1 && 2 <= E_M) && m_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= T1_E)) || ((2 <= t1_st && 2 <= E_M) && 2 <= m_st)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(2 <= T1_E)) || (2 <= E_M && 2 <= m_st)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && (((((((2 <= t1_st && \old(E_M) <= E_M) && 2 <= m_st) || !(2 <= E_1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && token == local) && \old(E_M) <= E_M)) || !(m_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((1 == t1_pc && token == local) && \old(E_M) <= E_M) && 2 <= m_st)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || (\old(E_M) <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || !(m_pc <= 0)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == m_st && 2 <= E_1) && \old(T1_E) <= T1_E) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || ((((2 <= E_1 && \old(T1_E) <= T1_E) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) && \old(T1_E) <= T1_E)) || !(\old(token) == \old(local))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(T1_E) <= T1_E) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && \old(T1_E) <= T1_E) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0)) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && \old(T1_E) <= T1_E) && m_pc <= 0) && token == local)) || !(2 <= \old(E_1))) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= E_M) && \old(T1_E) <= T1_E) && token == local) && 2 <= m_st)) || ((((2 <= E_1 && 2 <= E_M) && \old(T1_E) <= T1_E) && m_pc <= 0) && 2 <= m_st)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((!(1 == t1_pc) || (((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) && ((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((!(2 <= E_M) || !(2 <= T1_E)) || !(t1_pc <= 0)) || 0 == __retres1) || !(m_pc <= 0)) && ((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local)) || 0 == __retres1) || !(m_pc <= 0))) && (((!(2 <= E_1) || !(2 <= m_st)) || !(2 <= T1_E)) || 0 == __retres1)) && (((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= T1_E)) || 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: ((((((((!(1 == t1_pc) || (((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) && (((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= t1_st && \old(E_1) <= E_1) && m_pc <= 0) && token == local))) && (((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || (\old(E_1) <= E_1 && m_pc <= 0))) && ((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.5s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2616 SDtfs, 2231 SDslu, 2666 SDs, 0 SdLazy, 1361 SolverSat, 566 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1610 GetRequests, 1568 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1347occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 227 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3637 PreInvPairs, 4340 NumberOfFragments, 9795 HoareAnnotationTreeSize, 3637 FomulaSimplifications, 18226 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 62 FomulaSimplificationsInter, 35069 FormulaSimplificationTreeSizeReductionInter, 14.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1035 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1599 ConstructedInterpolants, 0 QuantifiedInterpolants, 315150 SizeOfPredicates, 21 NumberOfNonLiveVariables, 4972 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 536/559 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...