/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_FUNCTIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 2 -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-21 14:36:38,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 14:36:38,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 14:36:38,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 14:36:38,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 14:36:38,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 14:36:38,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 14:36:38,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 14:36:38,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 14:36:38,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 14:36:38,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 14:36:38,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 14:36:38,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 14:36:38,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 14:36:38,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 14:36:38,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 14:36:38,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 14:36:38,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 14:36:38,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 14:36:38,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 14:36:38,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 14:36:38,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 14:36:38,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 14:36:38,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 14:36:38,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 14:36:38,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 14:36:38,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 14:36:38,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 14:36:38,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 14:36:38,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 14:36:38,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 14:36:38,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 14:36:38,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 14:36:38,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 14:36:38,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 14:36:38,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 14:36:38,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 14:36:38,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 14:36:38,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 14:36:38,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 14:36:38,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 14:36:38,174 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-21 14:36:38,212 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 14:36:38,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 14:36:38,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 14:36:38,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 14:36:38,214 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 14:36:38,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 14:36:38,214 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 14:36:38,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 14:36:38,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 14:36:38,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 14:36:38,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 14:36:38,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 14:36:38,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 14:36:38,218 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 14:36:38,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 14:36:38,219 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 14:36:38,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 14:36:38,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 14:36:38,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 14:36:38,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 14:36:38,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 14:36:38,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 14:36:38,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 14:36:38,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 14:36:38,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 14:36:38,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 14:36:38,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:38,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 14:36:38,221 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 14:36:38,221 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_FUNCTIONS 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 -> 2 [2020-07-21 14:36:38,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 14:36:38,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 14:36:38,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 14:36:38,520 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 14:36:38,520 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 14:36:38,521 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-21 14:36:38,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017c7777a/ac7d55bf6b2d4bd5bee4364dbd7dad0e/FLAG1ca46b00a [2020-07-21 14:36:39,098 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 14:36:39,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-21 14:36:39,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017c7777a/ac7d55bf6b2d4bd5bee4364dbd7dad0e/FLAG1ca46b00a [2020-07-21 14:36:39,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017c7777a/ac7d55bf6b2d4bd5bee4364dbd7dad0e [2020-07-21 14:36:39,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 14:36:39,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 14:36:39,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 14:36:39,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 14:36:39,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 14:36:39,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:36:39" (1/1) ... [2020-07-21 14:36:39,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98434ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36:39, skipping insertion in model container [2020-07-21 14:36:39,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:36:39" (1/1) ... [2020-07-21 14:36:39,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 14:36:39,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 14:36:39,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 14:36:39,721 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 14:36:39,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 14:36:39,894 INFO L208 MainTranslator]: Completed translation [2020-07-21 14:36:39,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36:39 WrapperNode [2020-07-21 14:36:39,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 14:36:39,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 14:36:39,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 14:36:39,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 14:36:39,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36:39" (1/1) ... [2020-07-21 14:36:39,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36:39" (1/1) ... [2020-07-21 14:36:39,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36:39" (1/1) ... [2020-07-21 14:36:39,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36:39" (1/1) ... [2020-07-21 14:36:39,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36:39" (1/1) ... [2020-07-21 14:36:39,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36:39" (1/1) ... [2020-07-21 14:36:39,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36:39" (1/1) ... [2020-07-21 14:36:39,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 14:36:39,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 14:36:39,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 14:36:39,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 14:36:39,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36: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-21 14:36:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 14:36:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 14:36:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 14:36:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-21 14:36:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-21 14:36:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-21 14:36:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-21 14:36:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-21 14:36:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 14:36:40,020 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 14:36:40,020 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 14:36:40,020 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-21 14:36:40,020 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-21 14:36:40,020 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-21 14:36:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-21 14:36:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-21 14:36:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-21 14:36:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 14:36:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 14:36:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 14:36:40,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 14:36:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 14:36:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 14:36:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-21 14:36:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-21 14:36:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-21 14:36:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 14:36:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-21 14:36:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-21 14:36:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-21 14:36:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 14:36:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 14:36:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 14:36:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-21 14:36:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-21 14:36:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-21 14:36:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-21 14:36:40,027 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-21 14:36:40,027 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 14:36:40,027 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 14:36:40,027 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 14:36:40,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 14:36:40,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 14:36:40,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 14:36:40,539 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 14:36:40,540 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 14:36:40,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:36:40 BoogieIcfgContainer [2020-07-21 14:36:40,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 14:36:40,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 14:36:40,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 14:36:40,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 14:36:40,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:36:39" (1/3) ... [2020-07-21 14:36:40,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ebe41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:36:40, skipping insertion in model container [2020-07-21 14:36:40,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:36:39" (2/3) ... [2020-07-21 14:36:40,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ebe41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:36:40, skipping insertion in model container [2020-07-21 14:36:40,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:36:40" (3/3) ... [2020-07-21 14:36:40,555 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-21 14:36:40,566 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 14:36:40,574 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 14:36:40,590 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 14:36:40,617 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 14:36:40,617 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 14:36:40,618 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 14:36:40,618 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 14:36:40,618 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 14:36:40,619 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 14:36:40,619 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 14:36:40,619 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 14:36:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-21 14:36:40,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 14:36:40,655 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:40,656 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-21 14:36:40,657 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:40,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:40,664 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-21 14:36:40,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:40,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [521484801] [2020-07-21 14:36:40,673 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:40,919 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:36:40,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:40,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 14:36:40,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:41,024 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-21 14:36:41,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:41,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [521484801] [2020-07-21 14:36:41,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:41,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:36:41,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590530722] [2020-07-21 14:36:41,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:36:41,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:36:41,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:36:41,064 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2020-07-21 14:36:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:41,173 INFO L93 Difference]: Finished difference Result 381 states and 537 transitions. [2020-07-21 14:36:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:36:41,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-21 14:36:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:41,201 INFO L225 Difference]: With dead ends: 381 [2020-07-21 14:36:41,201 INFO L226 Difference]: Without dead ends: 243 [2020-07-21 14:36:41,210 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-21 14:36:41,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-07-21 14:36:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2020-07-21 14:36:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-21 14:36:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2020-07-21 14:36:41,312 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 77 [2020-07-21 14:36:41,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:41,312 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2020-07-21 14:36:41,313 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:36:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2020-07-21 14:36:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 14:36:41,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:41,317 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-21 14:36:41,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:41,532 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1330878925, now seen corresponding path program 1 times [2020-07-21 14:36:41,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:41,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1768649869] [2020-07-21 14:36:41,534 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:41,646 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:36:41,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:41,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 14:36:41,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:41,722 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-21 14:36:41,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:41,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1768649869] [2020-07-21 14:36:41,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:41,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 14:36:41,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31434186] [2020-07-21 14:36:41,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 14:36:41,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:41,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 14:36:41,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 14:36:41,733 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand 5 states. [2020-07-21 14:36:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:42,359 INFO L93 Difference]: Finished difference Result 565 states and 793 transitions. [2020-07-21 14:36:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 14:36:42,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 14:36:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:42,371 INFO L225 Difference]: With dead ends: 565 [2020-07-21 14:36:42,373 INFO L226 Difference]: Without dead ends: 346 [2020-07-21 14:36:42,379 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-21 14:36:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-07-21 14:36:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 286. [2020-07-21 14:36:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-07-21 14:36:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 364 transitions. [2020-07-21 14:36:42,432 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 364 transitions. Word has length 77 [2020-07-21 14:36:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:42,433 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 364 transitions. [2020-07-21 14:36:42,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 14:36:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 364 transitions. [2020-07-21 14:36:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 14:36:42,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:42,436 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-21 14:36:42,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:42,650 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:42,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1640766093, now seen corresponding path program 1 times [2020-07-21 14:36:42,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:42,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183587078] [2020-07-21 14:36:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:42,772 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:36:42,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:42,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 14:36:42,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:42,819 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-21 14:36:42,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:42,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183587078] [2020-07-21 14:36:42,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:42,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 14:36:42,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694106262] [2020-07-21 14:36:42,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 14:36:42,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:42,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 14:36:42,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 14:36:42,822 INFO L87 Difference]: Start difference. First operand 286 states and 364 transitions. Second operand 5 states. [2020-07-21 14:36:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:43,417 INFO L93 Difference]: Finished difference Result 850 states and 1107 transitions. [2020-07-21 14:36:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 14:36:43,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 14:36:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:43,426 INFO L225 Difference]: With dead ends: 850 [2020-07-21 14:36:43,427 INFO L226 Difference]: Without dead ends: 583 [2020-07-21 14:36:43,428 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-21 14:36:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-07-21 14:36:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 534. [2020-07-21 14:36:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-21 14:36:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 679 transitions. [2020-07-21 14:36:43,529 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 679 transitions. Word has length 77 [2020-07-21 14:36:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:43,532 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 679 transitions. [2020-07-21 14:36:43,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 14:36:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 679 transitions. [2020-07-21 14:36:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 14:36:43,545 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:43,545 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-21 14:36:43,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:43,746 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:43,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash -690298419, now seen corresponding path program 1 times [2020-07-21 14:36:43,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:43,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [205055701] [2020-07-21 14:36:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:43,864 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:36:43,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:43,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 14:36:43,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:43,921 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-21 14:36:43,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:43,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [205055701] [2020-07-21 14:36:43,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:43,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 14:36:43,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290421646] [2020-07-21 14:36:43,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 14:36:43,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:43,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 14:36:43,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 14:36:43,924 INFO L87 Difference]: Start difference. First operand 534 states and 679 transitions. Second operand 5 states. [2020-07-21 14:36:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:44,291 INFO L93 Difference]: Finished difference Result 1049 states and 1351 transitions. [2020-07-21 14:36:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 14:36:44,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 14:36:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:44,298 INFO L225 Difference]: With dead ends: 1049 [2020-07-21 14:36:44,298 INFO L226 Difference]: Without dead ends: 534 [2020-07-21 14:36:44,301 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-21 14:36:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-07-21 14:36:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2020-07-21 14:36:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-21 14:36:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 667 transitions. [2020-07-21 14:36:44,359 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 667 transitions. Word has length 77 [2020-07-21 14:36:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:44,359 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 667 transitions. [2020-07-21 14:36:44,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 14:36:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 667 transitions. [2020-07-21 14:36:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 14:36:44,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:44,363 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-21 14:36:44,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:44,577 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-21 14:36:44,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:44,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1089213248] [2020-07-21 14:36:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:44,665 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:36:44,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:44,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 14:36:44,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:44,737 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-21 14:36:44,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:44,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1089213248] [2020-07-21 14:36:44,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:44,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 14:36:44,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370781194] [2020-07-21 14:36:44,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 14:36:44,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:44,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 14:36:44,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 14:36:44,741 INFO L87 Difference]: Start difference. First operand 534 states and 667 transitions. Second operand 5 states. [2020-07-21 14:36:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:45,198 INFO L93 Difference]: Finished difference Result 1198 states and 1580 transitions. [2020-07-21 14:36:45,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 14:36:45,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 14:36:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:45,204 INFO L225 Difference]: With dead ends: 1198 [2020-07-21 14:36:45,205 INFO L226 Difference]: Without dead ends: 683 [2020-07-21 14:36:45,207 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-21 14:36:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2020-07-21 14:36:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 588. [2020-07-21 14:36:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-07-21 14:36:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 709 transitions. [2020-07-21 14:36:45,255 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 709 transitions. Word has length 77 [2020-07-21 14:36:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:45,256 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 709 transitions. [2020-07-21 14:36:45,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 14:36:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 709 transitions. [2020-07-21 14:36:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 14:36:45,257 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:45,257 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-21 14:36:45,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:45,471 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash 899075215, now seen corresponding path program 1 times [2020-07-21 14:36:45,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:45,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [81987877] [2020-07-21 14:36:45,472 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:45,543 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:36:45,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:45,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 14:36:45,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:45,572 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-21 14:36:45,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:45,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [81987877] [2020-07-21 14:36:45,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:45,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:36:45,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329551376] [2020-07-21 14:36:45,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:36:45,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:36:45,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:36:45,575 INFO L87 Difference]: Start difference. First operand 588 states and 709 transitions. Second operand 3 states. [2020-07-21 14:36:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:45,666 INFO L93 Difference]: Finished difference Result 1698 states and 2106 transitions. [2020-07-21 14:36:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:36:45,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-21 14:36:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:45,674 INFO L225 Difference]: With dead ends: 1698 [2020-07-21 14:36:45,695 INFO L226 Difference]: Without dead ends: 1130 [2020-07-21 14:36:45,699 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-21 14:36:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2020-07-21 14:36:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1126. [2020-07-21 14:36:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2020-07-21 14:36:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1353 transitions. [2020-07-21 14:36:45,789 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1353 transitions. Word has length 77 [2020-07-21 14:36:45,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:45,790 INFO L479 AbstractCegarLoop]: Abstraction has 1126 states and 1353 transitions. [2020-07-21 14:36:45,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:36:45,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1353 transitions. [2020-07-21 14:36:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-21 14:36:45,793 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:45,793 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-21 14:36:46,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:46,009 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:46,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:46,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1699881733, now seen corresponding path program 1 times [2020-07-21 14:36:46,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:46,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [988935454] [2020-07-21 14:36:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:46,082 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:36:46,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:46,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 14:36:46,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:46,118 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-21 14:36:46,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:46,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [988935454] [2020-07-21 14:36:46,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:46,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:36:46,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095340072] [2020-07-21 14:36:46,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:36:46,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:36:46,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:36:46,122 INFO L87 Difference]: Start difference. First operand 1126 states and 1353 transitions. Second operand 3 states. [2020-07-21 14:36:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:46,238 INFO L93 Difference]: Finished difference Result 3067 states and 3792 transitions. [2020-07-21 14:36:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:36:46,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-21 14:36:46,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:46,255 INFO L225 Difference]: With dead ends: 3067 [2020-07-21 14:36:46,255 INFO L226 Difference]: Without dead ends: 1962 [2020-07-21 14:36:46,261 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-21 14:36:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-07-21 14:36:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-07-21 14:36:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-07-21 14:36:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2388 transitions. [2020-07-21 14:36:46,447 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2388 transitions. Word has length 121 [2020-07-21 14:36:46,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:46,447 INFO L479 AbstractCegarLoop]: Abstraction has 1962 states and 2388 transitions. [2020-07-21 14:36:46,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:36:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2388 transitions. [2020-07-21 14:36:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-21 14:36:46,459 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:46,459 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:36:46,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:46,673 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:46,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1985577124, now seen corresponding path program 1 times [2020-07-21 14:36:46,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:46,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [375854139] [2020-07-21 14:36:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:46,763 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:36:46,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:46,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 14:36:46,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-07-21 14:36:46,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:46,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [375854139] [2020-07-21 14:36:46,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:46,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:36:46,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471037477] [2020-07-21 14:36:46,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:36:46,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:36:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:36:46,799 INFO L87 Difference]: Start difference. First operand 1962 states and 2388 transitions. Second operand 3 states. [2020-07-21 14:36:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:46,913 INFO L93 Difference]: Finished difference Result 3589 states and 4426 transitions. [2020-07-21 14:36:46,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:36:46,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-21 14:36:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:46,928 INFO L225 Difference]: With dead ends: 3589 [2020-07-21 14:36:46,928 INFO L226 Difference]: Without dead ends: 2066 [2020-07-21 14:36:46,936 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-21 14:36:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2020-07-21 14:36:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1954. [2020-07-21 14:36:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2020-07-21 14:36:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2356 transitions. [2020-07-21 14:36:47,062 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2356 transitions. Word has length 174 [2020-07-21 14:36:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:47,063 INFO L479 AbstractCegarLoop]: Abstraction has 1954 states and 2356 transitions. [2020-07-21 14:36:47,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:36:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2356 transitions. [2020-07-21 14:36:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 14:36:47,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:47,069 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:36:47,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:47,284 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:47,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:47,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2114911228, now seen corresponding path program 1 times [2020-07-21 14:36:47,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:47,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1934003419] [2020-07-21 14:36:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:47,397 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:36:47,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:47,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 14:36:47,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-21 14:36:47,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:47,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1934003419] [2020-07-21 14:36:47,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:47,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:36:47,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983259447] [2020-07-21 14:36:47,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:36:47,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:47,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:36:47,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:36:47,444 INFO L87 Difference]: Start difference. First operand 1954 states and 2356 transitions. Second operand 3 states. [2020-07-21 14:36:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:47,633 INFO L93 Difference]: Finished difference Result 5462 states and 6748 transitions. [2020-07-21 14:36:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:36:47,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 14:36:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:47,660 INFO L225 Difference]: With dead ends: 5462 [2020-07-21 14:36:47,660 INFO L226 Difference]: Without dead ends: 3535 [2020-07-21 14:36:47,670 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-21 14:36:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2020-07-21 14:36:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 3532. [2020-07-21 14:36:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2020-07-21 14:36:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4272 transitions. [2020-07-21 14:36:47,920 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4272 transitions. Word has length 175 [2020-07-21 14:36:47,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:47,921 INFO L479 AbstractCegarLoop]: Abstraction has 3532 states and 4272 transitions. [2020-07-21 14:36:47,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:36:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4272 transitions. [2020-07-21 14:36:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 14:36:47,928 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:47,928 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:36:48,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:48,143 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:48,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2045135392, now seen corresponding path program 1 times [2020-07-21 14:36:48,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:48,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1488684358] [2020-07-21 14:36:48,144 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:48,236 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:36:48,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:48,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 14:36:48,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-21 14:36:48,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:48,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1488684358] [2020-07-21 14:36:48,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:48,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:36:48,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954211931] [2020-07-21 14:36:48,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:36:48,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:48,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:36:48,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:36:48,290 INFO L87 Difference]: Start difference. First operand 3532 states and 4272 transitions. Second operand 3 states. [2020-07-21 14:36:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:48,463 INFO L93 Difference]: Finished difference Result 5539 states and 6876 transitions. [2020-07-21 14:36:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:36:48,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 14:36:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:48,488 INFO L225 Difference]: With dead ends: 5539 [2020-07-21 14:36:48,488 INFO L226 Difference]: Without dead ends: 3540 [2020-07-21 14:36:48,498 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-21 14:36:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3540 states. [2020-07-21 14:36:48,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3540 to 3532. [2020-07-21 14:36:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2020-07-21 14:36:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4228 transitions. [2020-07-21 14:36:48,754 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4228 transitions. Word has length 175 [2020-07-21 14:36:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:48,755 INFO L479 AbstractCegarLoop]: Abstraction has 3532 states and 4228 transitions. [2020-07-21 14:36:48,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:36:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4228 transitions. [2020-07-21 14:36:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 14:36:48,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:48,762 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:36:48,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:48,976 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:48,976 INFO L82 PathProgramCache]: Analyzing trace with hash -557002881, now seen corresponding path program 1 times [2020-07-21 14:36:48,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:48,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [351298948] [2020-07-21 14:36:48,977 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:49,060 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:36:49,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:49,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 14:36:49,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-07-21 14:36:49,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:49,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [351298948] [2020-07-21 14:36:49,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:49,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 14:36:49,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113668167] [2020-07-21 14:36:49,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 14:36:49,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:49,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 14:36:49,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 14:36:49,130 INFO L87 Difference]: Start difference. First operand 3532 states and 4228 transitions. Second operand 6 states. [2020-07-21 14:36:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:49,286 INFO L93 Difference]: Finished difference Result 5861 states and 7153 transitions. [2020-07-21 14:36:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 14:36:49,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2020-07-21 14:36:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:49,302 INFO L225 Difference]: With dead ends: 5861 [2020-07-21 14:36:49,302 INFO L226 Difference]: Without dead ends: 2353 [2020-07-21 14:36:49,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 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-21 14:36:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2020-07-21 14:36:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2353. [2020-07-21 14:36:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2020-07-21 14:36:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 2752 transitions. [2020-07-21 14:36:49,512 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 2752 transitions. Word has length 175 [2020-07-21 14:36:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:49,513 INFO L479 AbstractCegarLoop]: Abstraction has 2353 states and 2752 transitions. [2020-07-21 14:36:49,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 14:36:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 2752 transitions. [2020-07-21 14:36:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 14:36:49,518 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:49,518 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-21 14:36:49,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:49,732 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:49,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:49,733 INFO L82 PathProgramCache]: Analyzing trace with hash -784428293, now seen corresponding path program 1 times [2020-07-21 14:36:49,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:49,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [878466541] [2020-07-21 14:36:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:49,818 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:36:49,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:49,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 14:36:49,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-07-21 14:36:49,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:49,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [878466541] [2020-07-21 14:36:49,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:49,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 14:36:49,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570112122] [2020-07-21 14:36:49,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 14:36:49,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:49,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 14:36:49,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 14:36:49,878 INFO L87 Difference]: Start difference. First operand 2353 states and 2752 transitions. Second operand 6 states. [2020-07-21 14:36:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:49,977 INFO L93 Difference]: Finished difference Result 3735 states and 4417 transitions. [2020-07-21 14:36:49,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 14:36:49,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2020-07-21 14:36:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:49,984 INFO L225 Difference]: With dead ends: 3735 [2020-07-21 14:36:49,984 INFO L226 Difference]: Without dead ends: 896 [2020-07-21 14:36:49,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 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-21 14:36:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-21 14:36:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-21 14:36:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-21 14:36:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1003 transitions. [2020-07-21 14:36:50,050 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1003 transitions. Word has length 175 [2020-07-21 14:36:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:50,053 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1003 transitions. [2020-07-21 14:36:50,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 14:36:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1003 transitions. [2020-07-21 14:36:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 14:36:50,062 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:50,062 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-21 14:36:50,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:50,278 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash 190747775, now seen corresponding path program 1 times [2020-07-21 14:36:50,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:50,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [685851911] [2020-07-21 14:36:50,280 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:36:50,446 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:36:50,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:50,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 14:36:50,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:50,489 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-21 14:36:50,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:36:50,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [685851911] [2020-07-21 14:36:50,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:36:50,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:36:50,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921404182] [2020-07-21 14:36:50,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:36:50,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:50,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:36:50,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:36:50,493 INFO L87 Difference]: Start difference. First operand 896 states and 1003 transitions. Second operand 3 states. [2020-07-21 14:36:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:50,540 INFO L93 Difference]: Finished difference Result 1594 states and 1816 transitions. [2020-07-21 14:36:50,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:36:50,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 14:36:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:50,546 INFO L225 Difference]: With dead ends: 1594 [2020-07-21 14:36:50,547 INFO L226 Difference]: Without dead ends: 896 [2020-07-21 14:36:50,550 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-21 14:36:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-21 14:36:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-21 14:36:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-21 14:36:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 995 transitions. [2020-07-21 14:36:50,608 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 995 transitions. Word has length 175 [2020-07-21 14:36:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:50,608 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 995 transitions. [2020-07-21 14:36:50,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:36:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 995 transitions. [2020-07-21 14:36:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-21 14:36:50,612 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:36:50,613 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-21 14:36:50,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:50,829 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:36:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:36:50,830 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-21 14:36:50,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:36:50,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1343665345] [2020-07-21 14:36:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:51,076 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:36:51,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:36:51,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-21 14:36:51,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:36:51,153 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-21 14:36:51,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:36:51,388 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-21 14:36:51,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1343665345] [2020-07-21 14:36:51,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 14:36:51,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2020-07-21 14:36:51,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269574483] [2020-07-21 14:36:51,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 14:36:51,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:36:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 14:36:51,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-21 14:36:51,390 INFO L87 Difference]: Start difference. First operand 896 states and 995 transitions. Second operand 6 states. [2020-07-21 14:36:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:36:51,856 INFO L93 Difference]: Finished difference Result 916 states and 1023 transitions. [2020-07-21 14:36:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 14:36:51,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-07-21 14:36:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:36:51,858 INFO L225 Difference]: With dead ends: 916 [2020-07-21 14:36:51,858 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 14:36:51,862 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-21 14:36:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 14:36:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 14:36:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 14:36:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 14:36:51,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-21 14:36:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:36:51,863 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 14:36:51,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 14:36:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 14:36:51,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 14:36:52,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:36:52,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 14:36:55,421 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-21 14:36:55,946 WARN L193 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 48 [2020-07-21 14:36:56,242 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-07-21 14:36:56,598 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-21 14:36:56,961 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-21 14:36:57,070 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-07-21 14:36:57,397 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-21 14:36:57,729 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-21 14:36:58,134 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-21 14:36:58,734 WARN L193 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2020-07-21 14:36:59,152 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2020-07-21 14:36:59,917 WARN L193 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 63 [2020-07-21 14:37:00,222 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-07-21 14:37:00,905 WARN L193 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 58 [2020-07-21 14:37:01,625 WARN L193 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2020-07-21 14:37:02,130 WARN L193 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2020-07-21 14:37:02,467 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-21 14:37:03,586 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2020-07-21 14:37:03,750 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2020-07-21 14:37:04,100 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 46 [2020-07-21 14:37:04,267 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-21 14:37:05,441 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2020-07-21 14:37:05,730 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-07-21 14:37:06,069 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-21 14:37:07,183 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2020-07-21 14:37:07,528 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2020-07-21 14:37:08,080 WARN L193 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2020-07-21 14:37:08,328 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-07-21 14:37:08,589 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-07-21 14:37:08,823 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-21 14:37:09,526 WARN L193 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2020-07-21 14:37:09,762 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2020-07-21 14:37:10,221 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2020-07-21 14:37:10,514 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-07-21 14:37:10,848 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-21 14:37:11,690 WARN L193 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 58 [2020-07-21 14:37:12,141 WARN L193 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2020-07-21 14:37:12,478 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2020-07-21 14:37:12,688 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2020-07-21 14:37:12,958 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2020-07-21 14:37:13,317 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-07-21 14:37:13,356 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-21 14:37:13,356 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse7 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~m_pc~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (<= 2 ~m_st~0)) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse6 (<= 2 ~t1_st~0)) (.cse10 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse4 .cse8 .cse9 .cse10) (or .cse2 .cse3 .cse4 .cse6 (not (<= ~t1_pc~0 0)) .cse10) (or .cse7 (not (= ~token~0 (+ ~local~0 1))) .cse0 .cse1 .cse4 .cse8 .cse9) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10))) [2020-07-21 14:37:13,357 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-21 14:37:13,357 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse12 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~m_st~0))) (let ((.cse2 (not (= 1 ~m_pc~0))) (.cse10 (= 0 ~m_st~0)) (.cse8 (and .cse12 .cse5)) (.cse11 (not (= |old(~token~0)| ~local~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse4 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6 .cse7) (or .cse0 .cse1 .cse6 .cse8 .cse7 .cse9) (or .cse0 .cse1 .cse3 (not (= 0 |old(~m_st~0)|)) .cse6 (and .cse10 (= ~token~0 ~local~0) .cse4) .cse11 .cse9) (or .cse0 .cse1 .cse2 (and .cse10 (= 1 ~t1_pc~0) .cse12 (= ~token~0 (+ ~local~0 1))) .cse8 .cse6 .cse11 .cse7 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse3 .cse6 .cse7 .cse4 .cse9)))) [2020-07-21 14:37:13,357 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-21 14:37:13,357 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse2 (not (= 1 ~m_pc~0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~token~0 ~local~0)) (.cse3 (<= |old(~E_M~0)| ~E_M~0)) (.cse11 (not (= |old(~token~0)| ~local~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse6 (not (<= |old(~t1_pc~0)| 0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse4 (<= ~t1_pc~0 0)) (.cse9 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5) .cse6 .cse7 .cse8) (or .cse0 .cse1 (and .cse3 .cse5) .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (and (= 1 ~t1_pc~0) .cse10 .cse3 .cse5) .cse7 .cse11 .cse8 (not (= 1 |old(~t1_pc~0)|))) (or (and (= 0 ~m_st~0) .cse10 .cse3 .cse4) .cse0 .cse1 .cse6 (not (= 0 |old(~m_st~0)|)) .cse7 .cse11 .cse9) (or .cse0 .cse1 .cse6 .cse7 .cse8 .cse4 .cse9))) [2020-07-21 14:37:13,358 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-21 14:37:13,358 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse2 (<= |old(~E_M~0)| ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse8 (not (= |old(~token~0)| ~local~0))) (.cse6 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (= 1 ~m_pc~0))) (.cse9 (not (<= |old(~t1_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 (and (= 1 ~t1_pc~0) (= ~token~0 ~local~0) .cse2 .cse3) .cse4 .cse8 .cse5 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse9 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse9 (not (= 0 |old(~m_st~0)|)) .cse4 .cse8 .cse6) (or .cse0 .cse1 .cse7 .cse9 .cse4 .cse5))) [2020-07-21 14:37:13,358 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-21 14:37:13,358 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse11 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0))) (let ((.cse5 (not (= 1 ~m_pc~0))) (.cse13 (not (= |old(~token~0)| ~local~0))) (.cse9 (= 0 ~m_st~0)) (.cse10 (= 1 ~t1_pc~0)) (.cse12 (and .cse1 .cse11 .cse3)) (.cse0 (not (<= 2 ~E_1~0))) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse6 (not (<= |old(~t1_pc~0)| 0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse2 (<= |old(~E_M~0)| ~E_M~0)) (.cse14 (not (<= ~m_pc~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse4 .cse5 (and .cse9 .cse10 .cse1 .cse11 (= ~token~0 (+ ~local~0 1))) .cse12 .cse7 .cse13 .cse8 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse4 .cse6 (not (= 0 |old(~m_st~0)|)) .cse7 .cse13 (and .cse9 .cse10 .cse1 (= ~token~0 ~local~0) .cse2) .cse14) (or .cse0 .cse4 .cse12 .cse7 .cse8 .cse14) (or .cse0 .cse4 .cse6 .cse7 .cse8 .cse2 .cse14)))) [2020-07-21 14:37:13,358 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse3 (<= 2 ~m_st~0)) (.cse5 (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)|))) (.cse2 (not (= 1 ~m_pc~0))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and (= 1 ~t1_pc~0) (= ~token~0 (+ ~local~0 1)) .cse3) .cse4 .cse5 .cse6 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse7 .cse4 .cse6 .cse8) (or .cse0 .cse1 .cse4 .cse6 .cse3 .cse8) (or .cse0 .cse1 .cse7 (not (= 0 |old(~m_st~0)|)) .cse4 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse7 .cse4 .cse6))) [2020-07-21 14:37:13,359 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-21 14:37:13,359 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-21 14:37:13,359 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-21 14:37:13,359 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-21 14:37:13,359 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-21 14:37:13,359 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (<= 2 ~m_st~0)) (.cse12 (not (= ~token~0 (+ ~local~0 1)))) (.cse0 (not (= 1 ~m_pc~0))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse7 (not (<= 2 ~E_1~0))) (.cse13 (= 0 ~m_st~0)) (.cse14 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse6 (<= 2 ~t1_st~0)) (.cse10 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse4 .cse8 .cse9 .cse10) (or .cse7 .cse0 .cse2 .cse4 .cse11 .cse8 .cse9) (or .cse7 .cse2 .cse3 .cse4 .cse6 .cse8 .cse10) (or .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9) (or .cse7 .cse0 .cse2 .cse3 .cse4 .cse8 (and .cse6 .cse9)) (or .cse2 .cse3 .cse4 .cse6 .cse11 .cse10) (or .cse7 .cse12 .cse0 .cse1 .cse4 .cse8 .cse9) (or .cse7 .cse13 .cse14 .cse2 .cse3 .cse4 .cse11 .cse10) (or .cse7 .cse12 .cse0 .cse1 .cse14 .cse2 .cse3 (and .cse13 .cse6) .cse4) (or .cse13 .cse7 .cse14 .cse2 .cse4 .cse5 .cse11 .cse10) (or .cse7 .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10))) [2020-07-21 14:37:13,360 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse15 (<= 2 ~t1_st~0)) (.cse10 (= 0 activate_threads_~tmp~1)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse13 (and .cse10 .cse17)) (.cse16 (not (= ~token~0 (+ ~local~0 1)))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (= 1 ~m_pc~0))) (.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse10 .cse15)) (.cse7 (= 0 ~m_st~0)) (.cse8 (not (<= 2 ~E_1~0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (or .cse10 .cse1 .cse4 .cse11 .cse6) (or .cse8 .cse12 .cse0 .cse1 .cse13 .cse4 .cse5 .cse14) (or .cse8 .cse1 .cse2 .cse4 .cse15 .cse14 .cse6) (or .cse8 .cse7 .cse16 .cse12 .cse0 .cse13 .cse4 .cse14) (or .cse8 .cse12 .cse1 .cse13 .cse4 .cse11 .cse14) (or .cse8 .cse13 .cse4 .cse14 .cse6) (or .cse1 .cse2 .cse4 .cse15 .cse11 .cse6) (or .cse8 .cse7 .cse9 .cse1 .cse2 .cse4 .cse11 .cse6) (or .cse8 .cse16 .cse12 .cse0 .cse9 .cse1 .cse2 .cse4 (and .cse10 .cse7 .cse15)) (or .cse8 .cse12 (and .cse10 .cse15 .cse17) .cse1 .cse2 .cse4 .cse14) (or .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse7 .cse8 .cse9 .cse1 .cse4 .cse5 .cse11 .cse6)))) [2020-07-21 14:37:13,360 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-21 14:37:13,360 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (<= 2 ~m_st~0)) (.cse12 (not (= ~token~0 (+ ~local~0 1)))) (.cse0 (not (= 1 ~m_pc~0))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse7 (not (<= 2 ~E_1~0))) (.cse13 (= 0 ~m_st~0)) (.cse14 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse6 (<= 2 ~t1_st~0)) (.cse10 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse4 .cse8 .cse9 .cse10) (or .cse7 .cse0 .cse2 .cse4 .cse11 .cse8 .cse9) (or .cse7 .cse2 .cse3 .cse4 .cse6 .cse8 .cse10) (or .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse9) (or .cse7 .cse0 .cse2 .cse3 .cse4 .cse8 (and .cse6 .cse9)) (or .cse2 .cse3 .cse4 .cse6 .cse11 .cse10) (or .cse7 .cse12 .cse0 .cse1 .cse4 .cse8 .cse9) (or .cse7 .cse13 .cse14 .cse2 .cse3 .cse4 .cse11 .cse10) (or .cse7 .cse12 .cse0 .cse1 .cse14 .cse2 .cse3 (and .cse13 .cse6) .cse4) (or .cse13 .cse7 .cse14 .cse2 .cse4 .cse5 .cse11 .cse10) (or .cse7 .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10))) [2020-07-21 14:37:13,361 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-21 14:37:13,361 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-21 14:37:13,361 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-21 14:37:13,361 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-21 14:37:13,361 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-21 14:37:13,361 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-21 14:37:13,361 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-21 14:37:13,362 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-21 14:37:13,362 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-21 14:37:13,362 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-21 14:37:13,362 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 ~m_pc~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse7 (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 (not (<= 2 ~m_st~0)) .cse1 .cse2) (or .cse4 .cse6 .cse7 .cse0 (not (<= 2 ~t1_st~0)) .cse1 (not (= ~token~0 ~local~0)) .cse2 .cse3) (or .cse4 (not (= ~token~0 (+ ~local~0 1))) .cse5 .cse6 .cse7 .cse1 .cse2))) [2020-07-21 14:37:13,362 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-21 14:37:13,363 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-21 14:37:13,363 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-21 14:37:13,363 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 14:37:13,363 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 14:37:13,363 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 14:37:13,363 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse13 (<= |old(~E_1~0)| ~E_1~0)) (.cse12 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (<= |old(~M_E~0)| ~M_E~0)) (.cse15 (<= |old(~E_M~0)| ~E_M~0))) (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse10 (not (= 1 ~m_pc~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse0 (and .cse13 .cse12 .cse14 .cse15)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= 2 ~m_st~0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse7 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse10 .cse9 .cse3 .cse11 .cse6) (or .cse0 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse10 .cse8 .cse3 .cse11 .cse4 .cse6) (or (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse10 .cse8 .cse2 .cse9 .cse3 (and .cse12 .cse13 .cse14 .cse15) .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse11 .cse6 .cse7)))) [2020-07-21 14:37:13,364 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-21 14:37:13,364 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-21 14:37:13,364 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-21 14:37:13,364 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-21 14:37:13,364 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-21 14:37:13,364 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-21 14:37:13,364 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-21 14:37:13,364 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-21 14:37:13,364 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-21 14:37:13,365 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-21 14:37:13,365 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-21 14:37:13,365 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-21 14:37:13,365 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-21 14:37:13,365 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-21 14:37:13,365 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-21 14:37:13,366 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-21 14:37:13,366 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-21 14:37:13,366 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-21 14:37:13,366 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse4 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse5 (not (<= 2 |old(~t1_st~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 (not (<= ~t1_pc~0 0))) (or .cse4 (and (not (= |old(~token~0)| ~local~0)) (<= 2 ~t1_st~0) (<= |old(~E_1~0)| ~E_1~0) (= 1 ~m_pc~0) (= ~token~0 (+ ~local~0 1))) .cse0 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse5 .cse1 .cse3) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse4 .cse0 .cse5 .cse1 .cse2 .cse3))) [2020-07-21 14:37:13,366 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse8 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_1~0)) (.cse13 (<= 2 ~E_M~0)) (.cse11 (= 1 ~m_pc~0)) (.cse12 (<= 2 ~m_st~0))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse5 (and .cse10 .cse13 .cse11 (= ~token~0 ~local~0) .cse12)) (.cse6 (and .cse10 .cse8 .cse13 .cse11 .cse12)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not .cse13)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse3 .cse7 .cse4 .cse8 .cse9) (or .cse1 (and .cse10 .cse11 .cse12) .cse3 .cse7 .cse4 .cse9)))) [2020-07-21 14:37:13,366 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse4 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse5 (not (<= 2 |old(~t1_st~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 (not (<= ~t1_pc~0 0))) (or .cse4 .cse0 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse5 .cse1 .cse3) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse4 .cse0 .cse5 .cse1 .cse2 .cse3))) [2020-07-21 14:37:13,367 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse8 (<= ~m_pc~0 0)) (.cse0 (not (= 1 ~t1_pc~0))) (.cse7 (<= |old(~E_1~0)| ~E_1~0)) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (<= 2 ~t1_st~0)) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 (= ~token~0 ~local~0))) (or .cse1 .cse3 .cse4 .cse5 .cse9 (and .cse7 .cse8)) (or .cse0 (and (not (= |old(~token~0)| ~local~0)) .cse6 .cse7 (= 1 ~m_pc~0) (= ~token~0 (+ ~local~0 1))) .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse2 .cse3 .cse5) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9))) [2020-07-21 14:37:13,367 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (not (<= ~t1_pc~0 0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (<= 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 .cse0 .cse6 .cse1 .cse2 .cse3 .cse7 .cse4) (or .cse8 .cse0 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse6 .cse1 .cse3 (and .cse7 (= 1 ~m_pc~0) .cse9)) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse8 .cse0 .cse6 (and .cse7 .cse5 .cse9) .cse1 .cse2 .cse3))) [2020-07-21 14:37:13,367 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-21 14:37:13,367 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse8 (<= ~m_pc~0 0)) (.cse0 (not (= 1 ~t1_pc~0))) (.cse7 (<= |old(~E_1~0)| ~E_1~0)) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (<= 2 ~t1_st~0)) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 (= ~token~0 ~local~0))) (or .cse1 .cse3 .cse4 .cse5 .cse9 (and .cse7 .cse8)) (or .cse0 (and (not (= |old(~token~0)| ~local~0)) .cse6 .cse7 (= 1 ~m_pc~0) (= ~token~0 (+ ~local~0 1))) .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse2 .cse3 .cse5) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9))) [2020-07-21 14:37:13,367 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-21 14:37:13,367 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-21 14:37:13,367 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse4 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~t1_pc~0 0))) (.cse11 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~m_pc~0))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse9 (not (= 0 ~m_st~0))) (.cse3 (not (<= 2 ~E_M~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse7 (<= |old(~M_E~0)| ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse7) (or .cse0 .cse2 .cse9 .cse3 .cse10 .cse5 .cse6 .cse7 .cse11) (or .cse0 .cse3 .cse4 .cse5 .cse7 .cse11) (or .cse0 .cse1 .cse3 .cse10 .cse4 .cse5 .cse7) (or .cse0 .cse9 .cse3 .cse5 .cse6 .cse8 .cse7 .cse11) (or .cse0 .cse9 .cse3 .cse10 .cse5 .cse8 .cse7 .cse11) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse9 .cse3 .cse10 .cse5 .cse7))) [2020-07-21 14:37:13,367 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-21 14:37:13,368 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 14:37:13,368 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-21 14:37:13,368 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 14:37:13,368 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse7 (<= 2 ~m_st~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse5 (= 1 ~m_pc~0)) (.cse1 (not (= 1 |old(~m_pc~0)|))) (.cse14 (not (= 1 |old(~t1_pc~0)|))) (.cse11 (not (= |old(~token~0)| |old(~local~0)|))) (.cse15 (not (<= |old(~t1_pc~0)| 0))) (.cse16 (not (= 0 |old(~m_st~0)|))) (.cse18 (= 0 ~m_st~0)) (.cse4 (<= |old(~E_1~0)| ~E_1~0)) (.cse19 (<= ~m_pc~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse6 (<= |old(~E_M~0)| ~E_M~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse17 (not (<= |old(~m_pc~0)| 0))) (.cse9 (not (<= 2 ~T1_E~0))) (.cse3 (<= 2 ~t1_st~0)) (.cse10 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse1 .cse8 (and .cse12 .cse4 .cse5 .cse13 .cse6 .cse7) .cse9 .cse10 .cse14) (or .cse0 .cse15 .cse16 .cse2 .cse8 .cse17 .cse9 (and .cse18 .cse3 .cse4 .cse19 .cse6 .cse20)) (or .cse0 .cse15 .cse8 .cse17 .cse9 .cse10 .cse20) (or .cse11 .cse0 .cse16 .cse2 .cse8 .cse17 .cse9 (and .cse18 .cse12 .cse3 .cse4 .cse19 .cse13 .cse6) .cse14) (or .cse0 .cse15 .cse1 .cse8 .cse9 (and .cse4 .cse5 .cse6 .cse20 .cse7) .cse10) (or .cse0 .cse8 .cse17 .cse9 .cse10 (and .cse4 .cse19 .cse6 .cse7)) (or .cse0 .cse16 (and .cse18 .cse12 .cse3 (not (= |old(~token~0)| ~local~0)) .cse4 .cse5 (= ~token~0 (+ ~local~0 1)) .cse6) (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse1 .cse2 .cse8 .cse9 .cse14) (or .cse11 .cse0 .cse15 .cse16 .cse8 .cse17 .cse9 (and .cse18 .cse4 .cse19 .cse13 .cse6 .cse20)) (or .cse0 .cse2 .cse8 .cse17 .cse9 .cse3 .cse10))) [2020-07-21 14:37:13,368 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-21 14:37:13,368 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-21 14:37:13,368 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-21 14:37:13,369 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-21 14:37:13,369 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse9 (= 0 ~m_st~0)) (.cse28 (= 1 ~t1_pc~0)) (.cse12 (= ~token~0 ~local~0)) (.cse30 (<= 2 ~T1_E~0)) (.cse11 (<= ~m_pc~0 0)) (.cse10 (<= 2 ~E_1~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse26 (<= 2 ~E_M~0)) (.cse29 (= 1 ~m_pc~0)) (.cse13 (<= |old(~E_M~0)| ~E_M~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse27 (<= 2 ~m_st~0))) (let ((.cse7 (and .cse10 .cse22 .cse26 .cse29 .cse13 .cse14 .cse27)) (.cse23 (and .cse10 .cse30 .cse22 .cse26 .cse11 .cse27)) (.cse21 (and .cse10 .cse30 .cse26 .cse29 .cse13 .cse14 .cse27)) (.cse2 (not (= 1 |old(~m_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse24 (and .cse13 .cse14)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse8 (and .cse10 .cse30 .cse28 .cse26 .cse29 .cse12 .cse27)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse15 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse30)) (.cse16 (and .cse9 .cse10 .cse28 .cse22 .cse26 .cse29 (= ~token~0 (+ ~local~0 1)))) (.cse17 (and .cse10 .cse22 .cse26 .cse29 .cse27)) (.cse25 (not (= 1 |old(~t1_pc~0)|))) (.cse18 (and .cse9 .cse10 .cse28 .cse22 .cse26 .cse11 .cse12))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse5 .cse16 .cse17 .cse18 .cse19 .cse0 .cse1 .cse20 .cse21 .cse4) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse15 .cse5 .cse7 (and .cse9 .cse10 .cse22 .cse11 .cse13 .cse14)) (or .cse0 .cse1 .cse4 .cse23 .cse15 .cse5 .cse6 .cse24) (or .cse0 .cse3 .cse4 .cse23 .cse15 .cse5 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse17) (or .cse0 .cse20 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse8 .cse3 .cse4 .cse5 .cse16 .cse17 .cse25) (or .cse19 .cse0 .cse2 .cse8 .cse4 .cse5 .cse16 .cse6 .cse17 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse24) (or (and .cse10 .cse26 .cse11 .cse27) .cse0 .cse4 .cse15 .cse5 .cse6) (or .cse19 .cse0 .cse20 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse17 .cse25 .cse18)))) [2020-07-21 14:37:13,369 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse14 (<= |old(~E_M~0)| ~E_M~0)) (.cse15 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~E_1~0)) (.cse20 (<= 2 ~T1_E~0)) (.cse18 (<= 2 ~E_M~0)) (.cse21 (= 1 ~m_pc~0)) (.cse13 (= ~token~0 ~local~0)) (.cse19 (<= 2 ~m_st~0))) (let ((.cse1 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (= |old(~token~0)| |old(~local~0)|))) (.cse3 (and .cse11 .cse20 (= 1 ~t1_pc~0) .cse18 .cse21 .cse13 .cse19)) (.cse7 (not (= 1 |old(~t1_pc~0)|))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (not (= 1 |old(~m_pc~0)|))) (.cse10 (and .cse11 .cse20 .cse18 .cse21 .cse14 .cse15 .cse19)) (.cse12 (<= ~m_pc~0 0)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not (<= |old(~m_pc~0)| 0))) (.cse6 (not .cse20)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse0 .cse9 .cse1 .cse10 .cse3 (and (= 0 ~m_st~0) .cse11 .cse12 .cse13 .cse14 .cse15) .cse5 .cse16 .cse6) (or .cse8 .cse0 .cse1 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7) (or .cse0 .cse9 .cse5 .cse16 .cse6 .cse17 (and .cse14 .cse15)) (or .cse0 .cse9 .cse1 .cse4 .cse5 .cse16 .cse6) (or .cse0 .cse4 .cse5 .cse16 .cse6 .cse17) (or .cse8 .cse0 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse17) (or .cse0 .cse9 .cse2 .cse10 .cse5 .cse6 .cse17) (or (and .cse11 .cse18 .cse12 .cse19) .cse0 .cse5 .cse16 .cse6 .cse17)))) [2020-07-21 14:37:13,369 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse9 (= 0 ~m_st~0)) (.cse28 (= 1 ~t1_pc~0)) (.cse12 (= ~token~0 ~local~0)) (.cse30 (<= 2 ~T1_E~0)) (.cse11 (<= ~m_pc~0 0)) (.cse10 (<= 2 ~E_1~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse26 (<= 2 ~E_M~0)) (.cse29 (= 1 ~m_pc~0)) (.cse13 (<= |old(~E_M~0)| ~E_M~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse27 (<= 2 ~m_st~0))) (let ((.cse7 (and .cse10 .cse22 .cse26 .cse29 .cse13 .cse14 .cse27)) (.cse23 (and .cse10 .cse30 .cse22 .cse26 .cse11 .cse27)) (.cse21 (and .cse10 .cse30 .cse26 .cse29 .cse13 .cse14 .cse27)) (.cse2 (not (= 1 |old(~m_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse24 (and .cse13 .cse14)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse8 (and .cse10 .cse30 .cse28 .cse26 .cse29 .cse12 .cse27)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse15 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse30)) (.cse16 (and .cse9 .cse10 .cse28 .cse22 .cse26 .cse29 (= ~token~0 (+ ~local~0 1)))) (.cse17 (and .cse10 .cse22 .cse26 .cse29 .cse27)) (.cse25 (not (= 1 |old(~t1_pc~0)|))) (.cse18 (and .cse9 .cse10 .cse28 .cse22 .cse26 .cse11 .cse12))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse5 .cse16 .cse17 .cse18 .cse19 .cse0 .cse1 .cse20 .cse21 .cse4) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse15 .cse5 .cse7 (and .cse9 .cse10 .cse22 .cse11 .cse13 .cse14)) (or .cse0 .cse1 .cse4 .cse23 .cse15 .cse5 .cse6 .cse24) (or .cse0 .cse3 .cse4 .cse23 .cse15 .cse5 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse17) (or .cse0 .cse20 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse8 .cse3 .cse4 .cse5 .cse16 .cse17 .cse25) (or .cse19 .cse0 .cse2 .cse8 .cse4 .cse5 .cse16 .cse6 .cse17 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse24) (or (and .cse10 .cse26 .cse11 .cse27) .cse0 .cse4 .cse15 .cse5 .cse6) (or .cse19 .cse0 .cse20 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse17 .cse25 .cse18)))) [2020-07-21 14:37:13,370 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-21 14:37:13,370 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse14 (<= ~m_pc~0 0)) (.cse13 (<= 2 ~E_1~0)) (.cse18 (<= 2 ~T1_E~0)) (.cse19 (= 1 ~t1_pc~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse20 (<= 2 ~E_M~0))) (let ((.cse2 (not (= 1 |old(~m_pc~0)|))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse10 (not (= |old(~token~0)| |old(~local~0)|))) (.cse7 (and .cse13 .cse18 .cse19 .cse17 .cse20 (= 1 ~m_pc~0) (= ~token~0 (+ ~local~0 1)))) (.cse12 (and .cse13 .cse19 .cse17 .cse20 .cse14 (= ~token~0 ~local~0))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (= 0 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not .cse18)) (.cse15 (<= |old(~E_M~0)| ~E_M~0)) (.cse16 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse7 .cse8 .cse3 .cse4 .cse9) (or .cse10 .cse0 .cse6 .cse7 .cse8 .cse3 .cse11 .cse4 .cse12 .cse9) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse5) (or .cse0 .cse3 .cse11 .cse4 .cse5) (or .cse10 .cse0 .cse2 .cse7 .cse3 .cse4 .cse5 .cse9) (or .cse10 .cse0 .cse1 .cse6 (and .cse13 .cse14 .cse15 .cse16) .cse7 .cse3 .cse11 .cse4 .cse12) (or .cse0 .cse1 .cse6 .cse8 .cse3 .cse11 .cse4 (and .cse13 .cse17 .cse14 .cse15 .cse16))))) [2020-07-21 14:37:13,370 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-21 14:37:13,370 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse9 (= 0 ~m_st~0)) (.cse28 (= 1 ~t1_pc~0)) (.cse12 (= ~token~0 ~local~0)) (.cse30 (<= 2 ~T1_E~0)) (.cse11 (<= ~m_pc~0 0)) (.cse10 (<= 2 ~E_1~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse26 (<= 2 ~E_M~0)) (.cse29 (= 1 ~m_pc~0)) (.cse13 (<= |old(~E_M~0)| ~E_M~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse27 (<= 2 ~m_st~0))) (let ((.cse7 (and .cse10 .cse22 .cse26 .cse29 .cse13 .cse14 .cse27)) (.cse23 (and .cse10 .cse30 .cse22 .cse26 .cse11 .cse27)) (.cse21 (and .cse10 .cse30 .cse26 .cse29 .cse13 .cse14 .cse27)) (.cse2 (not (= 1 |old(~m_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse24 (and .cse13 .cse14)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse8 (and .cse10 .cse30 .cse28 .cse26 .cse29 .cse12 .cse27)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse15 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse30)) (.cse16 (and .cse9 .cse10 .cse28 .cse22 .cse26 .cse29 (= ~token~0 (+ ~local~0 1)))) (.cse17 (and .cse10 .cse22 .cse26 .cse29 .cse27)) (.cse25 (not (= 1 |old(~t1_pc~0)|))) (.cse18 (and .cse9 .cse10 .cse28 .cse22 .cse26 .cse11 .cse12))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse5 .cse16 .cse17 .cse18 .cse19 .cse0 .cse1 .cse20 .cse21 .cse4) (or .cse0 .cse1 .cse20 .cse3 .cse4 .cse15 .cse5 .cse7 (and .cse9 .cse10 .cse22 .cse11 .cse13 .cse14)) (or .cse0 .cse1 .cse4 .cse23 .cse15 .cse5 .cse6 .cse24) (or .cse0 .cse3 .cse4 .cse23 .cse15 .cse5 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6 .cse17) (or .cse0 .cse20 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse8 .cse3 .cse4 .cse5 .cse16 .cse17 .cse25) (or .cse19 .cse0 .cse2 .cse8 .cse4 .cse5 .cse16 .cse6 .cse17 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse24) (or (and .cse10 .cse26 .cse11 .cse27) .cse0 .cse4 .cse15 .cse5 .cse6) (or .cse19 .cse0 .cse20 .cse8 .cse3 .cse4 .cse15 .cse5 .cse16 .cse17 .cse25 .cse18)))) [2020-07-21 14:37:13,370 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-21 14:37:13,370 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-21 14:37:13,370 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-21 14:37:13,370 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-21 14:37:13,370 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-21 14:37:13,371 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-21 14:37:13,371 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-21 14:37:13,371 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-21 14:37:13,371 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-21 14:37:13,371 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-21 14:37:13,371 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse13 (<= |old(~E_1~0)| ~E_1~0)) (.cse12 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (<= |old(~M_E~0)| ~M_E~0)) (.cse15 (<= |old(~E_M~0)| ~E_M~0))) (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse10 (not (= 1 ~m_pc~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse0 (and .cse13 .cse12 .cse14 .cse15)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= 2 ~m_st~0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse7 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse10 .cse9 .cse3 .cse11 .cse6) (or .cse0 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (or .cse0 .cse1 .cse10 .cse8 .cse3 .cse11 .cse4 .cse6) (or (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse10 .cse8 .cse2 .cse9 .cse3 (and .cse12 .cse13 .cse14 .cse15) .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse11 .cse6 .cse7)))) [2020-07-21 14:37:13,371 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 14:37:13,371 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 14:37:13,371 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-21 14:37:13,371 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-21 14:37:13,371 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 14:37:13,371 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-21 14:37:13,372 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-21 14:37:13,372 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-21 14:37:13,372 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-21 14:37:13,373 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-21 14:37:13,374 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse4 (= ~token~0 ~local~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse7 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (= 1 ~m_pc~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse11 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse7 .cse8 .cse9 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse10 .cse5 .cse6 .cse11) (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 .cse1 .cse7 .cse8 .cse2 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse9 .cse2 .cse10 (= ~token~0 (+ ~local~0 1))) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse9 .cse2 .cse10 .cse11) (and .cse1 .cse8 .cse2 .cse3 .cse11) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,374 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse3 (= 1 ~m_pc~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse7 (= 0 ~m_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse4 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse4 .cse3 .cse9 .cse10 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse7 .cse0 .cse11 .cse4 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse4 .cse8 .cse5) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse2 .cse4 .cse8 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,374 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse3 (= 1 ~m_pc~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse7 (= 0 ~m_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse4 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse4 .cse3 .cse9 .cse10 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse7 .cse0 .cse11 .cse4 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse4 .cse8 .cse5) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse2 .cse4 .cse8 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,374 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse3 (= 1 ~m_pc~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse7 (= 0 ~m_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse4 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse4 .cse3 .cse9 .cse10 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse7 .cse0 .cse11 .cse4 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse4 .cse8 .cse5) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse2 .cse4 .cse8 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,375 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse3 (= 1 ~m_pc~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse7 (= 0 ~m_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse4 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse4 .cse3 .cse9 .cse10 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse7 .cse0 .cse11 .cse4 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse4 .cse8 .cse5) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse2 .cse4 .cse8 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,375 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse3 (= 1 ~m_pc~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse7 (= 0 ~m_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse4 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse4 .cse3 .cse9 .cse10 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse7 .cse0 .cse11 .cse4 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse4 .cse8 .cse5) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse2 .cse4 .cse8 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,375 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-21 14:37:13,375 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse3 (= 1 ~m_pc~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse7 (= 0 ~m_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse4 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse4 .cse3 .cse9 .cse10 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse7 .cse0 .cse11 .cse4 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse4 .cse8 .cse5) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse2 .cse4 .cse8 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,375 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-21 14:37:13,376 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse3 (= 1 ~m_pc~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse7 (= 0 ~m_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse4 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse4 .cse3 .cse9 .cse10 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse7 .cse0 .cse11 .cse4 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse4 .cse8 .cse5) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse2 .cse4 .cse8 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,376 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-21 14:37:13,376 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-21 14:37:13,376 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-21 14:37:13,377 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse3 (= 1 ~m_pc~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse7 (= 0 ~m_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse4 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse4 .cse3 .cse9 .cse10 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse7 .cse0 .cse11 .cse4 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse4 .cse8 .cse5) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse2 .cse4 .cse8 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,377 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-21 14:37:13,378 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse3 (= 1 ~m_pc~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse7 (= 0 ~m_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse4 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse4 .cse3 .cse9 .cse10 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse7 .cse0 .cse11 .cse4 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse4 .cse8 .cse5) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse2 .cse4 .cse8 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,378 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-21 14:37:13,378 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse3 (= 1 ~m_pc~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= ~t1_pc~0 0)) (.cse7 (= 0 ~m_st~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse8 (<= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse4 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse4 .cse3 .cse9 .cse10 .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse7 .cse0 .cse11 .cse4 .cse8 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse11 .cse2 .cse4 .cse8 .cse5) (not (<= 2 |old(~E_1~0)|)) (and .cse0 .cse2 .cse4 .cse8 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 14:37:13,378 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-07-21 14:37:13,378 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-21 14:37:13,378 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-21 14:37:13,379 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse7 (not (<= ~t1_pc~0 0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse9 (not (= 1 ~m_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 ~t1_st~0))) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse8 (not (<= 2 ~E_1~0))) (.cse10 (not (<= 2 ~m_st~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse6 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse2 .cse4 .cse7 .cse6) (or .cse0 .cse8 .cse9 .cse2 .cse10 .cse4 .cse7) (or .cse0 .cse8 (not (= ~token~0 (+ ~local~0 1))) .cse9 .cse1 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse4) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse8 .cse9 .cse1 .cse2 .cse10 .cse4 .cse5) (or .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse4) (or .cse0 .cse8 .cse10 .cse4 .cse6))) [2020-07-21 14:37:13,379 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-21 14:37:13,379 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-21 14:37:13,379 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-21 14:37:13,379 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-21 14:37:13,379 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-21 14:37:13,379 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-21 14:37:13,379 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 14:37:13,379 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-21 14:37:13,379 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 14:37:13,380 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 14:37:13,380 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-21 14:37:13,380 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 14:37:13,380 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse13 (<= |old(~E_1~0)| ~E_1~0)) (.cse12 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse14 (<= |old(~M_E~0)| ~M_E~0)) (.cse15 (<= |old(~E_M~0)| ~E_M~0))) (let ((.cse6 (not (= ~token~0 ~local~0))) (.cse10 (not (= 1 ~m_pc~0))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse3 (not (= 0 ~m_st~0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse0 (and .cse13 .cse12 .cse14 .cse15)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= 2 ~m_st~0))) (.cse7 (not (<= 2 |old(~T1_E~0)|))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse9 .cse7 .cse8) (or .cse0 .cse1 .cse10 .cse4 .cse5 .cse11 .cse7) (or .cse0 .cse1 .cse10 .cse5 .cse11 .cse9 .cse7) (or .cse0 .cse1 .cse10 .cse2 .cse5 .cse11 .cse6 .cse7) (or (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 (and .cse12 .cse13 .cse14 .cse15) .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse7 .cse8) (or .cse0 .cse1 .cse5 .cse11 .cse7 .cse8)))) [2020-07-21 14:37:13,380 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-21 14:37:13,380 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 14:37:13,380 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 14:37:13,380 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-21 14:37:13,380 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-21 14:37:13,380 INFO L271 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2020-07-21 14:37:13,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 02:37:13 BoogieIcfgContainer [2020-07-21 14:37:13,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 14:37:13,449 INFO L168 Benchmark]: Toolchain (without parser) took 34004.31 ms. Allocated memory was 146.8 MB in the beginning and 765.5 MB in the end (delta: 618.7 MB). Free memory was 104.0 MB in the beginning and 417.1 MB in the end (delta: -313.1 MB). Peak memory consumption was 643.7 MB. Max. memory is 7.1 GB. [2020-07-21 14:37:13,450 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.8 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-21 14:37:13,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 446.80 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 103.6 MB in the beginning and 182.7 MB in the end (delta: -79.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-07-21 14:37:13,454 INFO L168 Benchmark]: Boogie Preprocessor took 56.45 ms. Allocated memory is still 204.5 MB. Free memory was 182.7 MB in the beginning and 179.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-07-21 14:37:13,454 INFO L168 Benchmark]: RCFGBuilder took 591.01 ms. Allocated memory is still 204.5 MB. Free memory was 179.7 MB in the beginning and 148.7 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2020-07-21 14:37:13,454 INFO L168 Benchmark]: TraceAbstraction took 32901.23 ms. Allocated memory was 204.5 MB in the beginning and 765.5 MB in the end (delta: 561.0 MB). Free memory was 148.0 MB in the beginning and 417.1 MB in the end (delta: -269.1 MB). Peak memory consumption was 630.0 MB. Max. memory is 7.1 GB. [2020-07-21 14:37:13,463 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.21 ms. Allocated memory is still 146.8 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 446.80 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 103.6 MB in the beginning and 182.7 MB in the end (delta: -79.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.45 ms. Allocated memory is still 204.5 MB. Free memory was 182.7 MB in the beginning and 179.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 591.01 ms. Allocated memory is still 204.5 MB. Free memory was 179.7 MB in the beginning and 148.7 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32901.23 ms. Allocated memory was 204.5 MB in the beginning and 765.5 MB in the end (delta: 561.0 MB). Free memory was 148.0 MB in the beginning and 417.1 MB in the end (delta: -269.1 MB). Peak memory consumption was 630.0 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)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || ((((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) && ((((((((((((((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && token == local) && 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) && 1 == m_pc) && token == local + 1)) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && 1 == m_pc) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1)))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(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) && 1 == m_pc) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0))) && (((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || (((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || (\old(E_M) <= E_M && t1_pc <= 0))) && ((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && ((((((!(2 <= \old(E_M)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st))) && (((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(1 == \old(m_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && 1 == m_pc) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st))) && ((((((((((!(2 <= \old(E_M)) || !(0 == \old(m_st))) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1)) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && (((((((((!(\old(token) == \old(local)) || !(2 <= \old(E_M))) || !(1 == \old(m_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1)) || !(2 <= \old(m_st))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && (((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || (\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)))) && (((((((((((!(\old(token) == \old(local)) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1)) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 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)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((0 == __retres1 || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local)) || !(m_pc <= 0)) && ((((0 == __retres1 || !(2 <= E_M)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc <= 0))) && ((((((0 == __retres1 || !(2 <= E_1)) || !(1 == m_pc)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((((0 == __retres1 || !(2 <= E_1)) || !(token == local + 1)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E))) && ((((((0 == __retres1 || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local))) && (((((((0 == __retres1 || !(2 <= E_1)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(token == local))) && ((((((0 == __retres1 || !(2 <= E_1)) || !(1 == m_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E))) && ((((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)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st)) && ((((((((!(\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 <= E_1 && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 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))) && (((((!(2 <= E_M) || ((2 <= E_1 && 1 == m_pc) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(1 == m_pc)) || !(\old(t1_pc) <= 0)) || (\old(E_M) <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && (((((!(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))) || !(1 == m_pc)) || (((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))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || \old(E_M) <= E_M) || !(m_pc <= 0)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || ((((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) && ((((((((((((((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && token == local) && 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) && 1 == m_pc) && token == local + 1)) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && 1 == m_pc) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1)))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(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) && 1 == m_pc) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0))) && (((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || (((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || (\old(E_M) <= E_M && t1_pc <= 0))) && ((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && ((((((!(2 <= \old(E_M)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st))) && (((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(1 == \old(m_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && 1 == m_pc) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st))) && ((((((((((!(2 <= \old(E_M)) || !(0 == \old(m_st))) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1)) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && (((((((((!(\old(token) == \old(local)) || !(2 <= \old(E_M))) || !(1 == \old(m_pc))) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1)) || !(2 <= \old(m_st))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && (((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || (\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)))) && (((((((((((!(\old(token) == \old(local)) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1)) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 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)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || ((2 <= t1_st && \old(E_M) <= E_M) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(1 == m_pc)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || ((2 <= t1_st && 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))) || !(\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))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || ((2 <= t1_st && 2 <= 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)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || \old(E_M) <= E_M) || !(m_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((!(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))) || !(1 == m_pc)) || (((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(t1_pc) <= 0)) || !(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))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(1 == m_pc)) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= E_1 && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && \old(T1_E) <= T1_E) && token == local) && 2 <= m_st) || ((((((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 && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && \old(T1_E) <= T1_E) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || (((((2 <= E_1 && \old(T1_E) <= T1_E) && 1 == m_pc) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1) && \old(T1_E) <= T1_E)) || !(\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 && 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: (((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) && (((((((!(1 == t1_pc) || ((((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && 1 == m_pc) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= 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)) - 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 == m_pc)) || !(2 <= m_st)) || !(2 <= T1_E)) || 0 == __retres1)) && ((((((((!(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) || !(token == local + 1)) || !(1 == m_pc)) || !(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: (((((((((!(\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))) && (((((((!(1 == t1_pc) || ((((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && 1 == m_pc) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E))) && ((((((!(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: 11.4s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2946 SDtfs, 2359 SDslu, 2835 SDs, 0 SdLazy, 1371 SolverSat, 569 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1980 GetRequests, 1937 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3532occurred 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: 1.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 336 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 6044 PreInvPairs, 6829 NumberOfFragments, 11417 HoareAnnotationTreeSize, 6044 FomulaSimplifications, 21684 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 62 FomulaSimplificationsInter, 41737 FormulaSimplificationTreeSizeReductionInter, 17.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1808 NumberOfCodeBlocks, 1313 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1969 ConstructedInterpolants, 0 QuantifiedInterpolants, 401258 SizeOfPredicates, 21 NumberOfNonLiveVariables, 6310 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 857/880 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...