/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 DAGSIZE --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 20:57:06,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 20:57:06,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 20:57:06,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 20:57:06,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 20:57:06,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 20:57:06,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 20:57:06,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 20:57:06,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 20:57:06,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 20:57:06,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 20:57:06,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 20:57:06,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 20:57:06,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 20:57:06,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 20:57:06,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 20:57:06,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 20:57:06,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 20:57:06,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 20:57:06,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 20:57:06,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 20:57:06,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 20:57:06,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 20:57:06,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 20:57:06,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 20:57:06,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 20:57:06,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 20:57:06,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 20:57:06,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 20:57:06,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 20:57:06,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 20:57:06,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 20:57:06,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 20:57:06,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 20:57:06,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 20:57:06,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 20:57:06,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 20:57:06,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 20:57:06,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 20:57:06,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 20:57:06,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 20:57:06,117 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 20:57:06,141 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 20:57:06,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 20:57:06,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 20:57:06,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 20:57:06,146 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 20:57:06,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 20:57:06,147 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 20:57:06,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 20:57:06,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 20:57:06,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 20:57:06,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 20:57:06,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 20:57:06,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 20:57:06,148 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 20:57:06,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 20:57:06,149 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 20:57:06,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 20:57:06,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 20:57:06,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 20:57:06,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 20:57:06,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 20:57:06,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 20:57:06,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 20:57:06,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 20:57:06,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 20:57:06,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 20:57:06,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:06,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 20:57:06,155 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 20:57:06,155 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 -> DAGSIZE 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 20:57:06,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 20:57:06,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 20:57:06,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 20:57:06,461 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 20:57:06,463 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 20:57:06,464 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 20:57:06,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4694956b3/c6ade14cfe444c11bda6f2e7efd47a07/FLAG3fd716c98 [2020-07-21 20:57:07,038 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 20:57:07,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-21 20:57:07,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4694956b3/c6ade14cfe444c11bda6f2e7efd47a07/FLAG3fd716c98 [2020-07-21 20:57:07,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4694956b3/c6ade14cfe444c11bda6f2e7efd47a07 [2020-07-21 20:57:07,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 20:57:07,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 20:57:07,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 20:57:07,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 20:57:07,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 20:57:07,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:57:07" (1/1) ... [2020-07-21 20:57:07,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2954c7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07, skipping insertion in model container [2020-07-21 20:57:07,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:57:07" (1/1) ... [2020-07-21 20:57:07,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 20:57:07,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 20:57:07,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 20:57:07,662 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 20:57:07,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 20:57:07,900 INFO L208 MainTranslator]: Completed translation [2020-07-21 20:57:07,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07 WrapperNode [2020-07-21 20:57:07,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 20:57:07,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 20:57:07,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 20:57:07,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 20:57:07,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07" (1/1) ... [2020-07-21 20:57:07,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07" (1/1) ... [2020-07-21 20:57:07,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07" (1/1) ... [2020-07-21 20:57:07,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07" (1/1) ... [2020-07-21 20:57:07,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07" (1/1) ... [2020-07-21 20:57:07,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07" (1/1) ... [2020-07-21 20:57:07,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07" (1/1) ... [2020-07-21 20:57:07,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 20:57:07,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 20:57:07,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 20:57:07,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 20:57:07,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07" (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 20:57:08,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 20:57:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 20:57:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 20:57:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-21 20:57:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-21 20:57:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-21 20:57:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-21 20:57:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-21 20:57:08,007 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 20:57:08,007 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 20:57:08,007 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 20:57:08,007 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-21 20:57:08,007 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-21 20:57:08,008 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-21 20:57:08,008 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-21 20:57:08,008 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-21 20:57:08,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-21 20:57:08,009 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 20:57:08,009 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 20:57:08,009 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 20:57:08,009 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 20:57:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 20:57:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 20:57:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-21 20:57:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-21 20:57:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-21 20:57:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 20:57:08,011 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-21 20:57:08,011 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-21 20:57:08,011 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-21 20:57:08,011 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 20:57:08,011 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 20:57:08,011 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 20:57:08,012 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-21 20:57:08,012 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-21 20:57:08,012 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-21 20:57:08,012 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-21 20:57:08,012 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-21 20:57:08,012 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 20:57:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 20:57:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 20:57:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 20:57:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 20:57:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 20:57:08,559 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 20:57:08,559 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 20:57:08,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:57:08 BoogieIcfgContainer [2020-07-21 20:57:08,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 20:57:08,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 20:57:08,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 20:57:08,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 20:57:08,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:57:07" (1/3) ... [2020-07-21 20:57:08,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7937a759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:57:08, skipping insertion in model container [2020-07-21 20:57:08,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:57:07" (2/3) ... [2020-07-21 20:57:08,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7937a759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:57:08, skipping insertion in model container [2020-07-21 20:57:08,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:57:08" (3/3) ... [2020-07-21 20:57:08,575 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-21 20:57:08,585 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 20:57:08,592 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 20:57:08,604 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 20:57:08,630 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 20:57:08,630 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 20:57:08,630 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 20:57:08,630 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 20:57:08,631 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 20:57:08,631 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 20:57:08,631 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 20:57:08,631 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 20:57:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-21 20:57:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 20:57:08,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:08,667 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 20:57:08,668 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:08,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:08,675 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-21 20:57:08,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:08,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [870288898] [2020-07-21 20:57:08,684 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 20:57:08,842 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:57:08,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:08,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 20:57:08,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:08,968 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 20:57:08,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:08,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [870288898] [2020-07-21 20:57:08,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:08,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 20:57:08,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737205211] [2020-07-21 20:57:08,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 20:57:08,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:08,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 20:57:08,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 20:57:08,995 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 6 states. [2020-07-21 20:57:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:09,108 INFO L93 Difference]: Finished difference Result 276 states and 389 transitions. [2020-07-21 20:57:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 20:57:09,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-21 20:57:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:09,125 INFO L225 Difference]: With dead ends: 276 [2020-07-21 20:57:09,125 INFO L226 Difference]: Without dead ends: 145 [2020-07-21 20:57:09,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 20:57:09,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-07-21 20:57:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2020-07-21 20:57:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-21 20:57:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2020-07-21 20:57:09,198 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 77 [2020-07-21 20:57:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:09,199 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2020-07-21 20:57:09,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 20:57:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2020-07-21 20:57:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 20:57:09,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:09,204 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 20:57:09,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:09,419 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1166188342, now seen corresponding path program 1 times [2020-07-21 20:57:09,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:09,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807177097] [2020-07-21 20:57:09,422 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 20:57:09,562 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:57:09,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:09,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 20:57:09,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:09,630 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 20:57:09,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:09,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807177097] [2020-07-21 20:57:09,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:09,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:57:09,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494569026] [2020-07-21 20:57:09,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:57:09,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:09,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:57:09,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:57:09,635 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. Second operand 3 states. [2020-07-21 20:57:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:09,684 INFO L93 Difference]: Finished difference Result 373 states and 497 transitions. [2020-07-21 20:57:09,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:57:09,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-21 20:57:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:09,690 INFO L225 Difference]: With dead ends: 373 [2020-07-21 20:57:09,690 INFO L226 Difference]: Without dead ends: 253 [2020-07-21 20:57:09,692 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 20:57:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-21 20:57:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2020-07-21 20:57:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-07-21 20:57:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 325 transitions. [2020-07-21 20:57:09,749 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 325 transitions. Word has length 77 [2020-07-21 20:57:09,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:09,750 INFO L479 AbstractCegarLoop]: Abstraction has 248 states and 325 transitions. [2020-07-21 20:57:09,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:57:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 325 transitions. [2020-07-21 20:57:09,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 20:57:09,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:09,762 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 20:57:09,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:09,964 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash -40928373, now seen corresponding path program 1 times [2020-07-21 20:57:09,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:09,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364210392] [2020-07-21 20:57:09,966 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 20:57:10,033 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:57:10,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:10,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 20:57:10,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:10,078 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 20:57:10,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:10,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364210392] [2020-07-21 20:57:10,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:10,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 20:57:10,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028456925] [2020-07-21 20:57:10,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 20:57:10,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:10,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 20:57:10,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 20:57:10,081 INFO L87 Difference]: Start difference. First operand 248 states and 325 transitions. Second operand 6 states. [2020-07-21 20:57:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:10,137 INFO L93 Difference]: Finished difference Result 483 states and 651 transitions. [2020-07-21 20:57:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 20:57:10,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-07-21 20:57:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:10,142 INFO L225 Difference]: With dead ends: 483 [2020-07-21 20:57:10,142 INFO L226 Difference]: Without dead ends: 255 [2020-07-21 20:57:10,145 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 20:57:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-07-21 20:57:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2020-07-21 20:57:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-07-21 20:57:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 329 transitions. [2020-07-21 20:57:10,185 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 329 transitions. Word has length 77 [2020-07-21 20:57:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:10,185 INFO L479 AbstractCegarLoop]: Abstraction has 253 states and 329 transitions. [2020-07-21 20:57:10,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 20:57:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 329 transitions. [2020-07-21 20:57:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 20:57:10,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:10,190 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 20:57:10,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:10,404 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash 660671501, now seen corresponding path program 1 times [2020-07-21 20:57:10,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:10,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [507179986] [2020-07-21 20:57:10,405 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 20:57:10,514 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:57:10,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:10,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 20:57:10,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:10,600 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 20:57:10,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:10,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [507179986] [2020-07-21 20:57:10,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:10,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 20:57:10,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886030333] [2020-07-21 20:57:10,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 20:57:10,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:10,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 20:57:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 20:57:10,605 INFO L87 Difference]: Start difference. First operand 253 states and 329 transitions. Second operand 5 states. [2020-07-21 20:57:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:11,129 INFO L93 Difference]: Finished difference Result 605 states and 829 transitions. [2020-07-21 20:57:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 20:57:11,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 20:57:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:11,135 INFO L225 Difference]: With dead ends: 605 [2020-07-21 20:57:11,136 INFO L226 Difference]: Without dead ends: 371 [2020-07-21 20:57:11,139 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 20:57:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-07-21 20:57:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 311. [2020-07-21 20:57:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-07-21 20:57:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 386 transitions. [2020-07-21 20:57:11,200 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 386 transitions. Word has length 77 [2020-07-21 20:57:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:11,200 INFO L479 AbstractCegarLoop]: Abstraction has 311 states and 386 transitions. [2020-07-21 20:57:11,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 20:57:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 386 transitions. [2020-07-21 20:57:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 20:57:11,208 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:11,209 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 20:57:11,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:11,421 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:11,422 INFO L82 PathProgramCache]: Analyzing trace with hash 970558669, now seen corresponding path program 1 times [2020-07-21 20:57:11,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:11,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1117171737] [2020-07-21 20:57:11,422 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 20:57:11,513 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:57:11,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:11,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 20:57:11,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:11,559 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 20:57:11,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:11,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1117171737] [2020-07-21 20:57:11,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:11,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 20:57:11,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907406624] [2020-07-21 20:57:11,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 20:57:11,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:11,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 20:57:11,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 20:57:11,564 INFO L87 Difference]: Start difference. First operand 311 states and 386 transitions. Second operand 5 states. [2020-07-21 20:57:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:12,156 INFO L93 Difference]: Finished difference Result 925 states and 1173 transitions. [2020-07-21 20:57:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 20:57:12,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 20:57:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:12,162 INFO L225 Difference]: With dead ends: 925 [2020-07-21 20:57:12,163 INFO L226 Difference]: Without dead ends: 633 [2020-07-21 20:57:12,164 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 20:57:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-07-21 20:57:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 584. [2020-07-21 20:57:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-07-21 20:57:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 723 transitions. [2020-07-21 20:57:12,204 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 723 transitions. Word has length 77 [2020-07-21 20:57:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:12,204 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 723 transitions. [2020-07-21 20:57:12,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 20:57:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 723 transitions. [2020-07-21 20:57:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 20:57:12,206 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:12,206 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 20:57:12,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:12,421 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1360505843, now seen corresponding path program 1 times [2020-07-21 20:57:12,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:12,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2049833551] [2020-07-21 20:57:12,424 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 20:57:12,498 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:57:12,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:12,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 20:57:12,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:12,537 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 20:57:12,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:12,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2049833551] [2020-07-21 20:57:12,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:12,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 20:57:12,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773852885] [2020-07-21 20:57:12,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 20:57:12,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:12,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 20:57:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 20:57:12,541 INFO L87 Difference]: Start difference. First operand 584 states and 723 transitions. Second operand 5 states. [2020-07-21 20:57:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:12,878 INFO L93 Difference]: Finished difference Result 1149 states and 1439 transitions. [2020-07-21 20:57:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 20:57:12,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 20:57:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:12,883 INFO L225 Difference]: With dead ends: 1149 [2020-07-21 20:57:12,883 INFO L226 Difference]: Without dead ends: 584 [2020-07-21 20:57:12,885 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 20:57:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-07-21 20:57:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2020-07-21 20:57:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-07-21 20:57:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 711 transitions. [2020-07-21 20:57:12,923 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 711 transitions. Word has length 77 [2020-07-21 20:57:12,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:12,924 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 711 transitions. [2020-07-21 20:57:12,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 20:57:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 711 transitions. [2020-07-21 20:57:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 20:57:12,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:12,925 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 20:57:13,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:13,140 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:13,141 INFO L82 PathProgramCache]: Analyzing trace with hash 88319181, now seen corresponding path program 1 times [2020-07-21 20:57:13,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:13,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [482374794] [2020-07-21 20:57:13,142 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 20:57:13,213 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:57:13,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:13,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 20:57:13,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:13,259 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 20:57:13,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:13,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [482374794] [2020-07-21 20:57:13,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:13,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 20:57:13,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464220411] [2020-07-21 20:57:13,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 20:57:13,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:13,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 20:57:13,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 20:57:13,262 INFO L87 Difference]: Start difference. First operand 584 states and 711 transitions. Second operand 5 states. [2020-07-21 20:57:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:13,714 INFO L93 Difference]: Finished difference Result 1258 states and 1614 transitions. [2020-07-21 20:57:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 20:57:13,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 20:57:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:13,719 INFO L225 Difference]: With dead ends: 1258 [2020-07-21 20:57:13,719 INFO L226 Difference]: Without dead ends: 693 [2020-07-21 20:57:13,722 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 20:57:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-07-21 20:57:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 608. [2020-07-21 20:57:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-07-21 20:57:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 713 transitions. [2020-07-21 20:57:13,768 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 713 transitions. Word has length 77 [2020-07-21 20:57:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:13,769 INFO L479 AbstractCegarLoop]: Abstraction has 608 states and 713 transitions. [2020-07-21 20:57:13,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 20:57:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 713 transitions. [2020-07-21 20:57:13,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 20:57:13,770 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:13,770 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 20:57:13,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:13,985 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2020-07-21 20:57:13,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:13,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [539529897] [2020-07-21 20:57:13,986 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 20:57:14,064 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:57:14,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:14,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 20:57:14,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:14,109 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 20:57:14,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:14,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [539529897] [2020-07-21 20:57:14,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:14,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:57:14,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903805818] [2020-07-21 20:57:14,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:57:14,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:14,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:57:14,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:57:14,113 INFO L87 Difference]: Start difference. First operand 608 states and 713 transitions. Second operand 3 states. [2020-07-21 20:57:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:14,197 INFO L93 Difference]: Finished difference Result 1748 states and 2108 transitions. [2020-07-21 20:57:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:57:14,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-21 20:57:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:14,205 INFO L225 Difference]: With dead ends: 1748 [2020-07-21 20:57:14,206 INFO L226 Difference]: Without dead ends: 1160 [2020-07-21 20:57:14,208 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 20:57:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-07-21 20:57:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1156. [2020-07-21 20:57:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2020-07-21 20:57:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1349 transitions. [2020-07-21 20:57:14,288 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1349 transitions. Word has length 77 [2020-07-21 20:57:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:14,290 INFO L479 AbstractCegarLoop]: Abstraction has 1156 states and 1349 transitions. [2020-07-21 20:57:14,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:57:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1349 transitions. [2020-07-21 20:57:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-21 20:57:14,293 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:14,293 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 20:57:14,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:14,508 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:14,508 INFO L82 PathProgramCache]: Analyzing trace with hash 772889349, now seen corresponding path program 1 times [2020-07-21 20:57:14,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:14,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1977609044] [2020-07-21 20:57:14,509 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 20:57:14,566 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:57:14,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:14,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 20:57:14,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:14,614 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 20:57:14,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:14,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1977609044] [2020-07-21 20:57:14,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:14,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:57:14,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983413151] [2020-07-21 20:57:14,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:57:14,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:14,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:57:14,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:57:14,617 INFO L87 Difference]: Start difference. First operand 1156 states and 1349 transitions. Second operand 3 states. [2020-07-21 20:57:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:14,718 INFO L93 Difference]: Finished difference Result 2900 states and 3451 transitions. [2020-07-21 20:57:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:57:14,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-21 20:57:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:14,727 INFO L225 Difference]: With dead ends: 2900 [2020-07-21 20:57:14,727 INFO L226 Difference]: Without dead ends: 1347 [2020-07-21 20:57:14,732 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 20:57:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-07-21 20:57:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2020-07-21 20:57:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2020-07-21 20:57:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1576 transitions. [2020-07-21 20:57:14,811 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1576 transitions. Word has length 121 [2020-07-21 20:57:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:14,811 INFO L479 AbstractCegarLoop]: Abstraction has 1347 states and 1576 transitions. [2020-07-21 20:57:14,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:57:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1576 transitions. [2020-07-21 20:57:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-21 20:57:14,816 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:14,816 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 20:57:15,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:15,031 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:15,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:15,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1062947847, now seen corresponding path program 1 times [2020-07-21 20:57:15,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:15,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [690934220] [2020-07-21 20:57:15,032 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 20:57:15,093 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:57:15,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:15,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 20:57:15,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-21 20:57:15,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:15,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [690934220] [2020-07-21 20:57:15,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:15,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:57:15,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812072043] [2020-07-21 20:57:15,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:57:15,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:15,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:57:15,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:57:15,130 INFO L87 Difference]: Start difference. First operand 1347 states and 1576 transitions. Second operand 3 states. [2020-07-21 20:57:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:15,249 INFO L93 Difference]: Finished difference Result 2667 states and 3166 transitions. [2020-07-21 20:57:15,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:57:15,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-21 20:57:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:15,257 INFO L225 Difference]: With dead ends: 2667 [2020-07-21 20:57:15,257 INFO L226 Difference]: Without dead ends: 1341 [2020-07-21 20:57:15,262 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 20:57:15,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-07-21 20:57:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2020-07-21 20:57:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2020-07-21 20:57:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1552 transitions. [2020-07-21 20:57:15,338 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1552 transitions. Word has length 174 [2020-07-21 20:57:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:15,338 INFO L479 AbstractCegarLoop]: Abstraction has 1341 states and 1552 transitions. [2020-07-21 20:57:15,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:57:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1552 transitions. [2020-07-21 20:57:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 20:57:15,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:15,343 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 20:57:15,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:15,559 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:15,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:15,559 INFO L82 PathProgramCache]: Analyzing trace with hash 594245413, now seen corresponding path program 1 times [2020-07-21 20:57:15,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:15,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692981915] [2020-07-21 20:57:15,560 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 20:57:15,621 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:57:15,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:15,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 20:57:15,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-21 20:57:15,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:15,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692981915] [2020-07-21 20:57:15,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:15,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:57:15,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999588304] [2020-07-21 20:57:15,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:57:15,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:15,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:57:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:57:15,660 INFO L87 Difference]: Start difference. First operand 1341 states and 1552 transitions. Second operand 3 states. [2020-07-21 20:57:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:15,772 INFO L93 Difference]: Finished difference Result 3117 states and 3644 transitions. [2020-07-21 20:57:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:57:15,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 20:57:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:15,780 INFO L225 Difference]: With dead ends: 3117 [2020-07-21 20:57:15,780 INFO L226 Difference]: Without dead ends: 896 [2020-07-21 20:57:15,787 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 20:57:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-21 20:57:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-21 20:57:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-21 20:57:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1013 transitions. [2020-07-21 20:57:15,864 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1013 transitions. Word has length 175 [2020-07-21 20:57:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:15,865 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1013 transitions. [2020-07-21 20:57:15,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:57:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1013 transitions. [2020-07-21 20:57:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 20:57:15,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:15,869 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 20:57:16,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:16,082 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash 190747775, now seen corresponding path program 1 times [2020-07-21 20:57:16,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:16,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [772779907] [2020-07-21 20:57:16,083 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 20:57:16,144 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 20:57:16,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:16,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 20:57:16,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:16,189 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 20:57:16,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 20:57:16,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [772779907] [2020-07-21 20:57:16,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 20:57:16,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 20:57:16,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654619410] [2020-07-21 20:57:16,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 20:57:16,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:16,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 20:57:16,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 20:57:16,192 INFO L87 Difference]: Start difference. First operand 896 states and 1013 transitions. Second operand 3 states. [2020-07-21 20:57:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:16,262 INFO L93 Difference]: Finished difference Result 1594 states and 1836 transitions. [2020-07-21 20:57:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 20:57:16,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 20:57:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:16,268 INFO L225 Difference]: With dead ends: 1594 [2020-07-21 20:57:16,268 INFO L226 Difference]: Without dead ends: 896 [2020-07-21 20:57:16,271 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 20:57:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-21 20:57:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-21 20:57:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-21 20:57:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1005 transitions. [2020-07-21 20:57:16,321 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1005 transitions. Word has length 175 [2020-07-21 20:57:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:16,321 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1005 transitions. [2020-07-21 20:57:16,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 20:57:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1005 transitions. [2020-07-21 20:57:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-21 20:57:16,325 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 20:57:16,325 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 20:57:16,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:16,539 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 20:57:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 20:57:16,540 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-21 20:57:16,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 20:57:16,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [191947281] [2020-07-21 20:57:16,541 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 20:57:16,651 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 20:57:16,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 20:57:16,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-21 20:57:16,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 20:57:16,756 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 20:57:16,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 20:57:16,953 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 20:57:16,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [191947281] [2020-07-21 20:57:16,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 20:57:16,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2020-07-21 20:57:16,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936896803] [2020-07-21 20:57:16,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 20:57:16,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 20:57:16,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 20:57:16,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-21 20:57:16,955 INFO L87 Difference]: Start difference. First operand 896 states and 1005 transitions. Second operand 6 states. [2020-07-21 20:57:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 20:57:17,435 INFO L93 Difference]: Finished difference Result 920 states and 1037 transitions. [2020-07-21 20:57:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 20:57:17,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-07-21 20:57:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 20:57:17,438 INFO L225 Difference]: With dead ends: 920 [2020-07-21 20:57:17,438 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 20:57:17,440 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 20:57:17,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 20:57:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 20:57:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 20:57:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 20:57:17,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-21 20:57:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 20:57:17,441 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 20:57:17,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 20:57:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 20:57:17,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 20:57:17,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 20:57:17,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 20:57:17,817 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-07-21 20:57:20,425 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-21 20:57:20,872 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 47 [2020-07-21 20:57:21,162 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-07-21 20:57:21,521 WARN L193 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-21 20:57:21,845 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-21 20:57:21,959 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-07-21 20:57:22,273 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-21 20:57:22,590 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-21 20:57:22,982 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-21 20:57:23,483 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2020-07-21 20:57:23,873 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-07-21 20:57:24,434 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 54 [2020-07-21 20:57:24,718 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-07-21 20:57:25,292 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-07-21 20:57:25,813 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-07-21 20:57:26,291 WARN L193 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2020-07-21 20:57:26,597 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-21 20:57:27,454 WARN L193 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-21 20:57:27,594 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-07-21 20:57:27,885 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 43 [2020-07-21 20:57:28,046 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-21 20:57:28,915 WARN L193 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-21 20:57:29,175 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-07-21 20:57:29,486 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-21 20:57:30,322 WARN L193 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-07-21 20:57:30,640 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2020-07-21 20:57:31,097 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2020-07-21 20:57:31,333 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-21 20:57:31,565 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2020-07-21 20:57:31,784 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-21 20:57:32,346 WARN L193 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2020-07-21 20:57:32,554 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2020-07-21 20:57:32,792 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-07-21 20:57:33,206 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2020-07-21 20:57:33,519 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-21 20:57:34,194 WARN L193 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2020-07-21 20:57:34,564 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-07-21 20:57:34,825 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-07-21 20:57:35,018 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-07-21 20:57:35,251 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-07-21 20:57:35,553 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-07-21 20:57:35,587 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-21 20:57:35,587 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse4 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (<= 2 ~m_st~0)) (.cse8 (not (= 1 ~t1_pc~0))) (.cse5 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse7 (<= 2 ~t1_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse1 .cse7 (not (<= ~t1_pc~0 0)) .cse4) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse8 .cse1 .cse2 .cse3) (or .cse8 .cse5 .cse6 .cse1 (not (= ~token~0 ~local~0)) .cse7))) [2020-07-21 20:57:35,587 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-21 20:57:35,588 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse3 (<= 2 ~E_M~0)) (.cse11 (<= 2 ~m_st~0))) (let ((.cse4 (and .cse3 .cse11)) (.cse2 (= 0 ~m_st~0)) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse9 (not (<= |old(~t1_pc~0)| 0))) (.cse10 (<= |old(~E_M~0)| ~E_M~0)) (.cse5 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= 1 ~t1_pc~0) .cse3 (= ~token~0 (+ ~local~0 1))) .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse5 .cse4 .cse7 .cse8) (or .cse0 .cse1 .cse9 (not (= 0 |old(~m_st~0)|)) .cse5 (and .cse2 (= ~token~0 ~local~0) .cse10) .cse6 .cse8) (or .cse0 .cse1 .cse9 (and .cse10 .cse11) .cse5 .cse7)))) [2020-07-21 20:57:35,588 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-21 20:57:35,588 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse2 (= ~token~0 ~local~0)) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and (= 1 ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 (and .cse3 .cse4) .cse5 .cse7 .cse8) (or (and (= 0 ~m_st~0) .cse2 .cse3 .cse9) .cse0 .cse1 .cse10 (not (= 0 |old(~m_st~0)|)) .cse5 .cse6 .cse8) (or .cse0 .cse1 (and .cse3 .cse9 .cse4) .cse10 .cse5 .cse7))) [2020-07-21 20:57:35,588 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-21 20:57:35,588 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= 2 ~m_st~0)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse7 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (and (= 1 ~t1_pc~0) (= ~token~0 ~local~0) .cse5 .cse6) .cse3 .cse7 .cse4 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 (and .cse5 .cse6) .cse3 .cse4 .cse8) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse7 .cse8))) [2020-07-21 20:57:35,588 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-21 20:57:35,589 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse5 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~m_st~0)) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse8 (not (= |old(~token~0)| ~local~0))) (.cse2 (= 0 ~m_st~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse11 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~token~0 (+ ~local~0 1))) .cse6 (and .cse4 .cse5 .cse7) .cse8 .cse9 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse6 (and .cse5 .cse7) .cse9 .cse10) (or (and .cse4 .cse11 .cse7) .cse0 .cse1 .cse12 .cse6 .cse9) (or .cse0 .cse1 .cse12 (not (= 0 |old(~m_st~0)|)) .cse6 .cse8 (and .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse11) .cse10))) [2020-07-21 20:57:35,589 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse7 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (and (= 1 ~t1_pc~0) (= ~token~0 (+ ~local~0 1)) .cse5) .cse3 .cse6 .cse4 (not (= 1 |old(~t1_pc~0)|))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 .cse7))) [2020-07-21 20:57:35,589 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-21 20:57:35,589 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-21 20:57:35,589 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-21 20:57:35,589 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-21 20:57:35,590 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-21 20:57:35,590 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse3 (not (<= ~t1_pc~0 0))) (.cse7 (<= 2 ~t1_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (= 0 ~m_st~0)) (.cse10 (not (= 1 ~t1_pc~0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse13 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4 (and .cse7 .cse5)) (or .cse0 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse1 .cse6 (and .cse12 .cse7) .cse2) (or .cse1 .cse6 .cse2 .cse7 .cse3 .cse8) (or .cse0 .cse12 .cse11 .cse1 .cse6 .cse2 .cse3 .cse8) (or .cse0 .cse9 .cse10 .cse2 .cse4 .cse5) (or .cse0 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (or .cse12 .cse0 .cse11 .cse1 .cse2 .cse13 .cse3 .cse8) (or .cse10 .cse1 .cse6 .cse2 .cse13 .cse7) (or .cse0 .cse12 .cse10 .cse11 .cse1 .cse6 .cse2 .cse13 .cse8))) [2020-07-21 20:57:35,590 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse3 (not (<= ~t1_pc~0 0))) (.cse7 (<= 2 ~t1_st~0)) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse12 (= 0 ~m_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse10 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4 (and .cse7 .cse5)) (or .cse0 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse1 .cse6 (and .cse12 .cse7) .cse2) (or .cse1 .cse6 .cse2 .cse7 .cse3 .cse8) (or .cse0 .cse12 .cse11 .cse1 .cse6 .cse2 .cse3 .cse8) (or .cse0 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (or .cse12 .cse0 .cse11 .cse1 .cse2 .cse13 .cse3 .cse8) (or .cse10 .cse1 .cse6 .cse2 .cse13 .cse7) (or .cse0 .cse12 .cse10 .cse11 .cse1 .cse6 .cse2 .cse13 .cse8) (or .cse12 .cse0 .cse9 .cse10 .cse2 .cse4 .cse5))) [2020-07-21 20:57:35,591 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-21 20:57:35,591 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse9 (not (= ~token~0 (+ ~local~0 1)))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~m_st~0)) (.cse3 (not (<= ~t1_pc~0 0))) (.cse7 (<= 2 ~t1_st~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse12 (= 0 ~m_st~0)) (.cse10 (not (= 1 ~t1_pc~0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse13 (not (= ~token~0 ~local~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse4 (and .cse7 .cse5)) (or .cse0 .cse2 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse1 .cse6 (and .cse12 .cse7) .cse2) (or .cse1 .cse6 .cse2 .cse7 .cse3 .cse8) (or .cse0 .cse12 .cse11 .cse1 .cse6 .cse2 .cse3 .cse8) (or .cse0 .cse9 .cse10 .cse2 .cse4 .cse5) (or .cse0 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (or .cse12 .cse0 .cse11 .cse1 .cse2 .cse13 .cse3 .cse8) (or .cse10 .cse1 .cse6 .cse2 .cse13 .cse7) (or .cse0 .cse12 .cse10 .cse11 .cse1 .cse6 .cse2 .cse13 .cse8))) [2020-07-21 20:57:35,591 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-21 20:57:35,591 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-21 20:57:35,591 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-21 20:57:35,591 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-21 20:57:35,592 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-21 20:57:35,592 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-21 20:57:35,592 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-21 20:57:35,592 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-21 20:57:35,592 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-21 20:57:35,592 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-21 20:57:35,593 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_M~0))) (.cse3 (not (<= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_1~0))) (.cse5 (not (= 1 ~t1_pc~0))) (.cse6 (not (= 0 ~m_st~0))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (= 0 is_transmit1_triggered_~__retres1~1))) (and (or .cse0 .cse1 (not (<= ~t1_pc~0 0)) .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse0 (not (<= 2 ~t1_st~0)) .cse1 (not (= ~token~0 ~local~0)) .cse2 .cse3) (or .cse4 (not (<= 2 ~m_st~0)) .cse1 .cse2) (or .cse4 (not (= ~token~0 (+ ~local~0 1))) .cse5 .cse6 .cse1 .cse2))) [2020-07-21 20:57:35,593 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-21 20:57:35,593 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-21 20:57:35,593 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-21 20:57:35,593 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 20:57:35,593 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 20:57:35,593 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 20:57:35,594 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse7 (not (<= ~m_pc~0 0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse10 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse8 .cse2 .cse9 .cse3 .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse3 .cse10 .cse6) (or .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2020-07-21 20:57:35,594 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-21 20:57:35,595 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-21 20:57:35,595 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-21 20:57:35,595 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-21 20:57:35,595 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 20:57:35,595 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-21 20:57:35,595 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 20:57:35,596 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-21 20:57:35,596 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-21 20:57:35,598 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-21 20:57:35,598 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 20:57:35,598 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 20:57:35,598 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-21 20:57:35,599 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-21 20:57:35,599 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-21 20:57:35,599 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-21 20:57:35,599 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-21 20:57:35,599 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-21 20:57:35,599 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) (<= 2 ~t1_st~0) (<= |old(~E_1~0)| ~E_1~0) (= ~token~0 (+ ~local~0 1))) .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4) (or .cse1 .cse3 .cse5 .cse4 (not (<= ~t1_pc~0 0))) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4))) [2020-07-21 20:57:35,600 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse12 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_M~0)) (.cse7 (<= 2 ~E_1~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse8 (<= 2 ~m_st~0))) (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse3 (and .cse7 .cse11 .cse8)) (.cse6 (and .cse7 .cse12 .cse13 (= ~token~0 ~local~0) .cse8)) (.cse1 (not .cse13)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse12)) (.cse10 (not (<= ~t1_pc~0 0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6) (or (and .cse7 .cse8) .cse1 .cse4 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6) (or .cse1 .cse2 .cse4 .cse9 .cse5 .cse11 .cse10)))) [2020-07-21 20:57:35,600 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse4 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4) (or .cse1 .cse3 .cse5 .cse4 (not (<= ~t1_pc~0 0))) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse5 .cse4))) [2020-07-21 20:57:35,600 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (<= |old(~E_1~0)| ~E_1~0)) (.cse8 (<= ~m_pc~0 0)) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= |old(~m_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) .cse1 .cse2 (= ~token~0 (+ ~local~0 1))) .cse3 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse3 .cse4 .cse5 .cse7 .cse6 (and .cse1 .cse2 .cse8 (= ~token~0 ~local~0))) (or .cse3 .cse5 .cse7 .cse6 .cse9 (and .cse2 .cse8)) (or .cse3 .cse4 .cse5 .cse7 .cse6 .cse1 .cse9))) [2020-07-21 20:57:35,600 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (not (<= ~t1_pc~0 0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse7 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (<= 2 ~t1_st~0)) (.cse5 (<= ~m_pc~0 0)) (.cse9 (= ~token~0 ~local~0)) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (<= |old(~m_pc~0)| 0))) (.cse3 (not (<= 2 ~T1_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse7 .cse1 .cse3 (and .cse8 .cse9)) (or .cse0 .cse7 .cse1 .cse2 .cse3 .cse8 .cse4) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse6 .cse0 .cse7 (and .cse8 .cse5 .cse9) .cse1 .cse2 .cse3))) [2020-07-21 20:57:35,600 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-21 20:57:35,601 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_pc~0))) (.cse2 (<= |old(~E_1~0)| ~E_1~0)) (.cse8 (<= ~m_pc~0 0)) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= |old(~m_pc~0)| 0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (not (<= ~t1_pc~0 0)))) (and (or .cse0 (and (not (= |old(~token~0)| ~local~0)) .cse1 .cse2 (= ~token~0 (+ ~local~0 1))) .cse3 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse3 .cse4 .cse5 .cse7 .cse6 (and .cse1 .cse2 .cse8 (= ~token~0 ~local~0))) (or .cse3 .cse5 .cse7 .cse6 .cse9 (and .cse2 .cse8)) (or .cse3 .cse4 .cse5 .cse7 .cse6 .cse1 .cse9))) [2020-07-21 20:57:35,601 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-21 20:57:35,601 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-21 20:57:35,601 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse5 (not (= ~token~0 ~local~0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse9 (not (<= ~m_pc~0 0))) (.cse3 (not (<= 2 ~m_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse7 (not (= 0 ~m_st~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse6 (<= |old(~M_E~0)| ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse8 .cse4 .cse5 .cse6 .cse9) (or .cse0 .cse2 .cse3 .cse4 .cse10 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse9) (or .cse0 .cse7 .cse2 .cse4 .cse5 .cse10 .cse6 .cse9) (or .cse0 .cse7 .cse2 .cse8 .cse4 .cse10 .cse6 .cse9) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse7 .cse2 .cse8 .cse4 .cse6))) [2020-07-21 20:57:35,601 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-21 20:57:35,601 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 20:57:35,601 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 20:57:35,601 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 20:57:35,602 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (<= 2 ~t1_st~0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (= 1 |old(~t1_pc~0)|))) (.cse15 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~m_st~0)) (.cse17 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse12 (not (<= |old(~m_pc~0)| 0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse13 (= 0 ~m_st~0)) (.cse3 (<= |old(~E_1~0)| ~E_1~0)) (.cse14 (<= ~m_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse4 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8) (or .cse0 (and .cse3 .cse4 .cse9 .cse5) .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse10 .cse11 .cse1 .cse6 .cse12 .cse7 (and .cse13 .cse2 .cse3 .cse14 .cse4 .cse9)) (or .cse0 .cse11 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse1 .cse6 .cse7 (and .cse13 .cse15 (not (= |old(~token~0)| ~local~0)) .cse2 .cse3 (= ~token~0 (+ ~local~0 1)) .cse4) .cse16) (or .cse17 .cse0 .cse11 .cse1 .cse6 .cse12 .cse7 (and .cse13 .cse15 .cse2 .cse3 .cse14 .cse18 .cse4) .cse16) (or .cse0 .cse6 .cse12 .cse7 .cse8 (and .cse3 .cse14 .cse4 .cse5)) (or .cse17 .cse0 .cse6 .cse7 .cse8 .cse16 (and .cse15 .cse3 .cse18 .cse4 .cse5)) (or .cse17 .cse0 .cse10 .cse11 .cse6 .cse12 .cse7 (and .cse13 .cse3 .cse14 .cse18 .cse4 .cse9)))) [2020-07-21 20:57:35,602 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-21 20:57:35,602 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-21 20:57:35,602 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-21 20:57:35,602 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-21 20:57:35,603 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-21 20:57:35,603 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse17 (<= |old(~E_M~0)| ~E_M~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse19 (<= 2 ~T1_E~0)) (.cse13 (<= 2 ~E_M~0)) (.cse16 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0))) (let ((.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse6 (not (= 0 |old(~m_st~0)|))) (.cse7 (and .cse12 .cse19 (= 1 ~t1_pc~0) .cse13 .cse16 .cse15)) (.cse14 (<= ~m_pc~0 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= |old(~m_pc~0)| 0))) (.cse3 (not .cse19)) (.cse5 (and .cse12 .cse17 .cse18 .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse7 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse8 .cse2 .cse3 .cse9) (or .cse0 .cse1 .cse6 .cse8 .cse2 .cse10 .cse3) (or .cse0 .cse8 .cse2 .cse3 .cse4) (or .cse11 .cse0 .cse6 .cse7 .cse8 .cse2 .cse10 .cse3 .cse9) (or .cse11 .cse0 .cse7 .cse2 .cse3 .cse4 .cse9) (or (and .cse12 .cse13 .cse14 .cse15) .cse0 .cse2 .cse10 .cse3 .cse4) (or .cse11 .cse0 .cse1 .cse6 .cse7 (and (= 0 ~m_st~0) .cse12 .cse14 .cse16 .cse17 .cse18) .cse2 .cse10 .cse3 .cse5)))) [2020-07-21 20:57:35,604 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-21 20:57:35,604 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-21 20:57:35,604 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse13 (<= ~m_pc~0 0)) (.cse12 (<= 2 ~E_1~0)) (.cse17 (= 1 ~t1_pc~0)) (.cse16 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~E_M~0))) (let ((.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse4 (and .cse12 .cse17 .cse16 .cse18 (= ~token~0 (+ ~local~0 1)))) (.cse8 (and .cse12 .cse17 .cse16 .cse18 .cse13 (= ~token~0 ~local~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse11 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (not (= 0 |old(~m_st~0)|))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= |old(~m_pc~0)| 0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse14 (<= |old(~E_M~0)| ~E_M~0)) (.cse15 (<= ~t1_pc~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse3 .cse5 .cse7 .cse10) (or .cse1 .cse11 .cse5 .cse7 .cse10) (or .cse1 .cse5 .cse6 .cse7 .cse10) (or .cse1 .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse3 .cse4 .cse5 .cse7 .cse9) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse10 .cse9) (or .cse0 .cse1 .cse11 .cse2 (and .cse12 .cse13 .cse14 .cse15) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse11 .cse2 .cse3 .cse5 .cse6 .cse7 (and .cse12 .cse16 .cse13 .cse14 .cse15))))) [2020-07-21 20:57:35,604 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-21 20:57:35,604 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse25 (<= 2 ~T1_E~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse24 (<= 2 ~m_st~0)) (.cse16 (= 0 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse23 (<= 2 ~E_M~0)) (.cse18 (<= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0))) (let ((.cse14 (and .cse16 .cse17 .cse26 .cse22 .cse23 .cse18 .cse19)) (.cse15 (and .cse17 .cse20 .cse21 .cse24)) (.cse7 (not (= |old(~token~0)| |old(~local~0)|))) (.cse8 (and .cse16 .cse17 .cse26 .cse22 .cse23 (= ~token~0 (+ ~local~0 1)))) (.cse10 (and .cse17 .cse25 .cse26 .cse23 .cse19 .cse24)) (.cse12 (and .cse17 .cse22 .cse23 .cse24)) (.cse13 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (and .cse17 .cse22 .cse23 .cse20 .cse21 .cse24)) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse5 (not .cse25)) (.cse6 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse4 .cse11 .cse5 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse4 .cse5 .cse12 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse11 .cse5 .cse14 .cse15 .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 .cse4 .cse12) (or .cse7 .cse8 .cse0 .cse10 .cse4 .cse5 .cse12 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse10 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse4 .cse5 .cse12 .cse13) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse5 (and .cse16 .cse17 .cse22 .cse18 .cse20 .cse21)) (or (and .cse17 .cse23 .cse18 .cse24) .cse0 .cse4 .cse11 .cse5 .cse6)))) [2020-07-21 20:57:35,604 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-21 20:57:35,604 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-21 20:57:35,605 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-21 20:57:35,605 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-21 20:57:35,605 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-21 20:57:35,605 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-21 20:57:35,605 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-21 20:57:35,605 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-21 20:57:35,605 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-21 20:57:35,605 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-21 20:57:35,605 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse8 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse7 (not (<= ~m_pc~0 0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse10 .cse4 .cse6) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse8 .cse2 .cse9 .cse3 .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse3 .cse10 .cse6) (or .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2020-07-21 20:57:35,605 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 20:57:35,606 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 20:57:35,606 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-21 20:57:35,606 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-21 20:57:35,606 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 20:57:35,606 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-21 20:57:35,606 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 20:57:35,606 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 20:57:35,607 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-21 20:57:35,607 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 20:57:35,607 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse9 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 (= ~token~0 (+ ~local~0 1))) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (and .cse1 .cse8 .cse9 .cse2 .cse4 .cse7) (and .cse1 .cse9 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,607 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,608 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,608 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,608 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,608 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,608 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-21 20:57:35,609 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,609 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-21 20:57:35,609 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,609 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 20:57:35,609 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 20:57:35,610 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 20:57:35,610 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,610 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-21 20:57:35,610 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,610 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-21 20:57:35,611 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse0 (= 0 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (<= ~m_pc~0 0)) (.cse7 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse8 .cse9 .cse10 (= ~token~0 (+ ~local~0 1)) .cse2) (not (= |old(~token~0)| |old(~local~0)|)) (and .cse1 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse2 .cse3 .cse4) (not (<= 2 |old(~E_1~0)|)) (and .cse1 .cse8 .cse10 .cse2 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 20:57:35,611 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-07-21 20:57:35,611 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-21 20:57:35,611 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-21 20:57:35,611 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse3 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~token~0 ~local~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 (+ ~local~0 1)))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse1 (not (<= 2 ~E_1~0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse5 .cse7) (or .cse1 .cse0 .cse8 .cse6 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse5) (or .cse0 .cse2 .cse5 .cse9 .cse10) (or .cse1 .cse0 .cse6 .cse2 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (or .cse0 .cse1 .cse8 .cse6 (<= ~E_M~0 1) .cse4 .cse5) (or .cse0 .cse1 .cse4 .cse5 .cse10))) [2020-07-21 20:57:35,611 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-21 20:57:35,612 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-21 20:57:35,612 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-21 20:57:35,612 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-21 20:57:35,612 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-21 20:57:35,612 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-21 20:57:35,612 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 20:57:35,612 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 20:57:35,613 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 20:57:35,613 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 20:57:35,613 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-21 20:57:35,613 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 20:57:35,613 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse6 (not (= ~token~0 ~local~0))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse3 (not (= 0 ~m_st~0))) (.cse8 (not (<= ~m_pc~0 0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse0 (and (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (<= 2 ~m_st~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse7 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse9 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse5 .cse10 .cse6 .cse7) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse7 .cse8) (or .cse0 .cse1 .cse5 .cse10 .cse7 .cse8) (or .cse0 .cse1 .cse4 .cse5 .cse10 .cse7) (or .cse0 .cse1 .cse5 .cse10 .cse9 .cse7))) [2020-07-21 20:57:35,613 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-21 20:57:35,613 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 20:57:35,614 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 20:57:35,614 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-21 20:57:35,614 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-21 20:57:35,614 INFO L271 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2020-07-21 20:57:35,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:57:35 BoogieIcfgContainer [2020-07-21 20:57:35,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 20:57:35,671 INFO L168 Benchmark]: Toolchain (without parser) took 28281.63 ms. Allocated memory was 138.4 MB in the beginning and 473.4 MB in the end (delta: 335.0 MB). Free memory was 102.9 MB in the beginning and 243.8 MB in the end (delta: -140.9 MB). Peak memory consumption was 335.2 MB. Max. memory is 7.1 GB. [2020-07-21 20:57:35,671 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-21 20:57:35,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.78 ms. Allocated memory was 138.4 MB in the beginning and 206.6 MB in the end (delta: 68.2 MB). Free memory was 102.5 MB in the beginning and 183.3 MB in the end (delta: -80.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-07-21 20:57:35,672 INFO L168 Benchmark]: Boogie Preprocessor took 46.77 ms. Allocated memory is still 206.6 MB. Free memory was 183.3 MB in the beginning and 181.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-21 20:57:35,673 INFO L168 Benchmark]: RCFGBuilder took 617.38 ms. Allocated memory is still 206.6 MB. Free memory was 181.3 MB in the beginning and 150.1 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2020-07-21 20:57:35,674 INFO L168 Benchmark]: TraceAbstraction took 27099.95 ms. Allocated memory was 206.6 MB in the beginning and 473.4 MB in the end (delta: 266.9 MB). Free memory was 149.4 MB in the beginning and 243.8 MB in the end (delta: -94.4 MB). Peak memory consumption was 313.6 MB. Max. memory is 7.1 GB. [2020-07-21 20:57:35,676 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 509.78 ms. Allocated memory was 138.4 MB in the beginning and 206.6 MB in the end (delta: 68.2 MB). Free memory was 102.5 MB in the beginning and 183.3 MB in the end (delta: -80.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.77 ms. Allocated memory is still 206.6 MB. Free memory was 183.3 MB in the beginning and 181.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 617.38 ms. Allocated memory is still 206.6 MB. Free memory was 181.3 MB in the beginning and 150.1 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27099.95 ms. Allocated memory was 206.6 MB in the beginning and 473.4 MB in the end (delta: 266.9 MB). Free memory was 149.4 MB in the beginning and 243.8 MB in the end (delta: -94.4 MB). Peak memory consumption was 313.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && (((((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local))) && (((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && ((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st))) && (((((((((((((((((0 == m_st && 2 <= E_1) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(token) == \old(local))) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st))) && ((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0))) && ((((((((2 <= E_1 && 2 <= E_M) && m_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((0 == __retres1 || !(2 <= E_1)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) && (((((0 == __retres1 || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local))) && (((((((!(2 <= E_1) || 0 == __retres1) || !(token == local + 1)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E))) && ((((0 == __retres1 || !(2 <= E_M)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc <= 0))) && ((((((!(2 <= E_1) || 0 == __retres1) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(token == local))) && (((((0 == __retres1 || !(2 <= E_1)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((0 == __retres1 || !(2 <= E_1)) || !(token == local + 1)) || !(1 == t1_pc)) || E_M <= 1) || !(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)) || !(2 <= \old(t1_st))) || ((2 <= E_1 && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && token == local) && 2 <= m_st)) && ((((((2 <= E_1 && 2 <= m_st) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || ((2 <= E_1 && 2 <= t1_st) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((2 <= E_1 && 2 <= T1_E) && 2 <= E_M) && token == local) && 2 <= m_st))) && ((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((0 == m_st && 1 == t1_pc) && 2 <= E_M) && token == local + 1)) || (2 <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(2 <= T1_E)) || (2 <= E_M && 2 <= m_st)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || ((0 == m_st && token == local) && \old(E_M) <= E_M)) || !(\old(token) == local)) || !(m_pc <= 0))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || (\old(E_M) <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && (((((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc))) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local))) && (((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st)))) && ((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st))) && (((((((((((((((((0 == m_st && 2 <= E_1) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && m_pc <= 0) && token == local)) || (((2 <= E_1 && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(token) == \old(local))) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st))) && ((((((((!(\old(token) == \old(local)) || (((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= \old(E_M))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && ((((((((((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || (((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && token == local) && 2 <= m_st)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || (((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0))) && ((((((((2 <= E_1 && 2 <= E_M) && m_pc <= 0) && 2 <= m_st) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= T1_E)) || ((2 <= t1_st && 2 <= E_M) && 2 <= m_st)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(2 <= T1_E)) || (2 <= E_M && 2 <= m_st)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && (((((((2 <= t1_st && \old(E_M) <= E_M) && 2 <= m_st) || !(2 <= E_1)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st)))) && (((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && token == local) && \old(E_M) <= E_M)) || !(m_pc <= 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((1 == t1_pc && token == local) && \old(E_M) <= E_M) && 2 <= m_st)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc)))) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || (\old(E_M) <= E_M && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(m_pc <= 0))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || !(m_pc <= 0)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == m_st && 2 <= E_1) && \old(T1_E) <= T1_E) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) || ((((2 <= E_1 && \old(T1_E) <= T1_E) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1) && \old(T1_E) <= T1_E)) || !(\old(token) == \old(local))) || ((((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && \old(T1_E) <= T1_E) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((0 == m_st && 2 <= E_1) && 2 <= t1_st) && \old(T1_E) <= T1_E) && m_pc <= 0) && \old(E_M) <= E_M) && t1_pc <= 0)) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && \old(T1_E) <= T1_E) && m_pc <= 0) && token == local)) || !(2 <= \old(E_1))) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= E_M) && \old(T1_E) <= T1_E) && token == local) && 2 <= m_st)) || ((((2 <= E_1 && 2 <= E_M) && \old(T1_E) <= T1_E) && m_pc <= 0) && 2 <= m_st)) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((!(1 == t1_pc) || (((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) && ((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0))) && ((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((!(2 <= E_M) || !(2 <= T1_E)) || !(t1_pc <= 0)) || 0 == __retres1) || !(m_pc <= 0)) && ((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local)) || 0 == __retres1) || !(m_pc <= 0))) && (((!(2 <= E_1) || !(2 <= m_st)) || !(2 <= T1_E)) || 0 == __retres1)) && (((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= T1_E)) || 0 == __retres1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((!(1 == t1_pc) || (((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) && (((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= t1_st && \old(E_1) <= E_1) && m_pc <= 0) && token == local))) && (((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || (\old(E_1) <= E_1 && m_pc <= 0))) && ((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.0s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2637 SDtfs, 2192 SDslu, 2717 SDs, 0 SdLazy, 1315 SolverSat, 548 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1610 GetRequests, 1568 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1347occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 210 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3370 PreInvPairs, 4072 NumberOfFragments, 9762 HoareAnnotationTreeSize, 3370 FomulaSimplifications, 17648 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 62 FomulaSimplificationsInter, 35024 FormulaSimplificationTreeSizeReductionInter, 15.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1599 ConstructedInterpolants, 0 QuantifiedInterpolants, 315150 SizeOfPredicates, 21 NumberOfNonLiveVariables, 4520 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 536/559 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...