/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 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 17:21:19,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 17:21:19,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 17:21:19,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 17:21:19,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 17:21:19,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 17:21:19,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 17:21:19,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 17:21:19,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 17:21:19,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 17:21:19,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 17:21:19,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 17:21:19,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 17:21:19,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 17:21:19,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 17:21:19,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 17:21:19,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 17:21:19,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 17:21:19,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 17:21:19,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 17:21:19,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 17:21:19,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 17:21:19,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 17:21:19,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 17:21:19,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 17:21:19,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 17:21:19,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 17:21:19,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 17:21:19,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 17:21:19,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 17:21:19,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 17:21:19,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 17:21:19,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 17:21:19,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 17:21:19,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 17:21:19,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 17:21:19,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 17:21:19,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 17:21:19,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 17:21:19,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 17:21:19,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 17:21:19,608 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 17:21:19,622 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 17:21:19,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 17:21:19,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 17:21:19,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 17:21:19,624 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 17:21:19,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 17:21:19,624 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 17:21:19,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 17:21:19,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 17:21:19,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 17:21:19,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 17:21:19,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 17:21:19,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 17:21:19,626 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 17:21:19,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 17:21:19,626 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 17:21:19,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 17:21:19,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 17:21:19,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 17:21:19,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 17:21:19,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 17:21:19,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 17:21:19,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 17:21:19,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 17:21:19,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 17:21:19,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 17:21:19,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:19,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 17:21:19,629 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 17:21:19,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 2 [2020-07-21 17:21:19,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 17:21:19,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 17:21:19,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 17:21:19,929 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 17:21:19,929 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 17:21:19,930 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 17:21:20,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99859a61/4f287b3155304d2ea66bbd9c36ac5924/FLAGf70053a51 [2020-07-21 17:21:20,502 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 17:21:20,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-21 17:21:20,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99859a61/4f287b3155304d2ea66bbd9c36ac5924/FLAGf70053a51 [2020-07-21 17:21:20,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99859a61/4f287b3155304d2ea66bbd9c36ac5924 [2020-07-21 17:21:20,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 17:21:20,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 17:21:20,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 17:21:20,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 17:21:20,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 17:21:20,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:21:20" (1/1) ... [2020-07-21 17:21:20,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24633c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:20, skipping insertion in model container [2020-07-21 17:21:20,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:21:20" (1/1) ... [2020-07-21 17:21:20,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 17:21:20,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 17:21:21,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 17:21:21,172 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 17:21:21,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 17:21:21,332 INFO L208 MainTranslator]: Completed translation [2020-07-21 17:21:21,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:21 WrapperNode [2020-07-21 17:21:21,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 17:21:21,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 17:21:21,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 17:21:21,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 17:21:21,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:21" (1/1) ... [2020-07-21 17:21:21,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:21" (1/1) ... [2020-07-21 17:21:21,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:21" (1/1) ... [2020-07-21 17:21:21,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:21" (1/1) ... [2020-07-21 17:21:21,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:21" (1/1) ... [2020-07-21 17:21:21,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:21" (1/1) ... [2020-07-21 17:21:21,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:21" (1/1) ... [2020-07-21 17:21:21,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 17:21:21,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 17:21:21,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 17:21:21,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 17:21:21,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:21" (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 17:21:21,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 17:21:21,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 17:21:21,441 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 17:21:21,442 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-21 17:21:21,442 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-21 17:21:21,442 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-21 17:21:21,442 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-21 17:21:21,442 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-21 17:21:21,442 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 17:21:21,443 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 17:21:21,443 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 17:21:21,443 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-21 17:21:21,443 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-21 17:21:21,443 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-21 17:21:21,443 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-21 17:21:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-21 17:21:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-21 17:21:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 17:21:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 17:21:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 17:21:21,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 17:21:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 17:21:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 17:21:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-21 17:21:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-21 17:21:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-21 17:21:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 17:21:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-21 17:21:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-21 17:21:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-21 17:21:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 17:21:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 17:21:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 17:21:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-21 17:21:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-21 17:21:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-21 17:21:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-21 17:21:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-21 17:21:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 17:21:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 17:21:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 17:21:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 17:21:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 17:21:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 17:21:21,973 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 17:21:21,974 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 17:21:21,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:21:21 BoogieIcfgContainer [2020-07-21 17:21:21,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 17:21:21,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 17:21:21,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 17:21:21,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 17:21:21,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:21:20" (1/3) ... [2020-07-21 17:21:21,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230da3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:21:21, skipping insertion in model container [2020-07-21 17:21:21,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:21:21" (2/3) ... [2020-07-21 17:21:21,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230da3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:21:21, skipping insertion in model container [2020-07-21 17:21:21,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:21:21" (3/3) ... [2020-07-21 17:21:21,988 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-21 17:21:21,999 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 17:21:22,008 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 17:21:22,023 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 17:21:22,049 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 17:21:22,049 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 17:21:22,049 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 17:21:22,050 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 17:21:22,050 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 17:21:22,050 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 17:21:22,050 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 17:21:22,051 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 17:21:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-21 17:21:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 17:21:22,087 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:22,088 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 17:21:22,089 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-21 17:21:22,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:22,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [741814700] [2020-07-21 17:21:22,106 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 17:21:22,305 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:22,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:22,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 17:21:22,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:22,464 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 17:21:22,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:22,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [741814700] [2020-07-21 17:21:22,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:22,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:21:22,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526684498] [2020-07-21 17:21:22,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:21:22,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:22,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:21:22,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:22,496 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2020-07-21 17:21:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:22,605 INFO L93 Difference]: Finished difference Result 381 states and 537 transitions. [2020-07-21 17:21:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:21:22,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-21 17:21:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:22,625 INFO L225 Difference]: With dead ends: 381 [2020-07-21 17:21:22,625 INFO L226 Difference]: Without dead ends: 243 [2020-07-21 17:21:22,631 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 17:21:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-07-21 17:21:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2020-07-21 17:21:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-21 17:21:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2020-07-21 17:21:22,719 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 77 [2020-07-21 17:21:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:22,720 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2020-07-21 17:21:22,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:21:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2020-07-21 17:21:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 17:21:22,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:22,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:21:22,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:22,940 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1330878925, now seen corresponding path program 1 times [2020-07-21 17:21:22,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:22,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302200203] [2020-07-21 17:21:22,942 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 17:21:23,055 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:23,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:23,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 17:21:23,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:23,110 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 17:21:23,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:23,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302200203] [2020-07-21 17:21:23,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:23,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 17:21:23,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551944395] [2020-07-21 17:21:23,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 17:21:23,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:23,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 17:21:23,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 17:21:23,115 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand 5 states. [2020-07-21 17:21:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:23,650 INFO L93 Difference]: Finished difference Result 565 states and 793 transitions. [2020-07-21 17:21:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 17:21:23,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 17:21:23,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:23,657 INFO L225 Difference]: With dead ends: 565 [2020-07-21 17:21:23,657 INFO L226 Difference]: Without dead ends: 346 [2020-07-21 17:21:23,661 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 17:21:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-07-21 17:21:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 286. [2020-07-21 17:21:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-07-21 17:21:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 364 transitions. [2020-07-21 17:21:23,707 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 364 transitions. Word has length 77 [2020-07-21 17:21:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:23,707 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 364 transitions. [2020-07-21 17:21:23,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 17:21:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 364 transitions. [2020-07-21 17:21:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 17:21:23,714 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:23,714 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 17:21:23,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:23,930 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:23,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1640766093, now seen corresponding path program 1 times [2020-07-21 17:21:23,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:23,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1374882143] [2020-07-21 17:21:23,933 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 17:21:24,045 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:24,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:24,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 17:21:24,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:24,113 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 17:21:24,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:24,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1374882143] [2020-07-21 17:21:24,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:24,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 17:21:24,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315043719] [2020-07-21 17:21:24,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 17:21:24,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:24,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 17:21:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 17:21:24,117 INFO L87 Difference]: Start difference. First operand 286 states and 364 transitions. Second operand 5 states. [2020-07-21 17:21:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:24,755 INFO L93 Difference]: Finished difference Result 850 states and 1107 transitions. [2020-07-21 17:21:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:21:24,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 17:21:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:24,764 INFO L225 Difference]: With dead ends: 850 [2020-07-21 17:21:24,764 INFO L226 Difference]: Without dead ends: 583 [2020-07-21 17:21:24,766 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 17:21:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-07-21 17:21:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 534. [2020-07-21 17:21:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-21 17:21:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 679 transitions. [2020-07-21 17:21:24,851 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 679 transitions. Word has length 77 [2020-07-21 17:21:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:24,853 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 679 transitions. [2020-07-21 17:21:24,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 17:21:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 679 transitions. [2020-07-21 17:21:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 17:21:24,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:24,863 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 17:21:25,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:25,076 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:25,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash -690298419, now seen corresponding path program 1 times [2020-07-21 17:21:25,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:25,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [941383730] [2020-07-21 17:21:25,079 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 17:21:25,140 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:21:25,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:25,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 17:21:25,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:25,192 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 17:21:25,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:25,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [941383730] [2020-07-21 17:21:25,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:25,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 17:21:25,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306901400] [2020-07-21 17:21:25,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 17:21:25,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:25,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 17:21:25,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 17:21:25,195 INFO L87 Difference]: Start difference. First operand 534 states and 679 transitions. Second operand 5 states. [2020-07-21 17:21:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:25,524 INFO L93 Difference]: Finished difference Result 1049 states and 1351 transitions. [2020-07-21 17:21:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 17:21:25,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 17:21:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:25,529 INFO L225 Difference]: With dead ends: 1049 [2020-07-21 17:21:25,529 INFO L226 Difference]: Without dead ends: 534 [2020-07-21 17:21:25,531 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 17:21:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-07-21 17:21:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2020-07-21 17:21:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-21 17:21:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 667 transitions. [2020-07-21 17:21:25,590 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 667 transitions. Word has length 77 [2020-07-21 17:21:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:25,591 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 667 transitions. [2020-07-21 17:21:25,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 17:21:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 667 transitions. [2020-07-21 17:21:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 17:21:25,595 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:25,595 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 17:21:25,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:25,811 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:25,812 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-21 17:21:25,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:25,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2017867932] [2020-07-21 17:21:25,814 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 17:21:25,901 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:25,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:25,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 17:21:25,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:25,945 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 17:21:25,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:25,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2017867932] [2020-07-21 17:21:25,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:25,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 17:21:25,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586220703] [2020-07-21 17:21:25,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 17:21:25,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:25,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 17:21:25,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 17:21:25,951 INFO L87 Difference]: Start difference. First operand 534 states and 667 transitions. Second operand 5 states. [2020-07-21 17:21:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:26,436 INFO L93 Difference]: Finished difference Result 1198 states and 1580 transitions. [2020-07-21 17:21:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:21:26,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 17:21:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:26,442 INFO L225 Difference]: With dead ends: 1198 [2020-07-21 17:21:26,442 INFO L226 Difference]: Without dead ends: 683 [2020-07-21 17:21:26,445 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 17:21:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2020-07-21 17:21:26,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 588. [2020-07-21 17:21:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-07-21 17:21:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 709 transitions. [2020-07-21 17:21:26,491 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 709 transitions. Word has length 77 [2020-07-21 17:21:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:26,492 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 709 transitions. [2020-07-21 17:21:26,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 17:21:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 709 transitions. [2020-07-21 17:21:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 17:21:26,493 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:26,493 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 17:21:26,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:26,709 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash 899075215, now seen corresponding path program 1 times [2020-07-21 17:21:26,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:26,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [869644014] [2020-07-21 17:21:26,712 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 17:21:26,787 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:26,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:26,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 17:21:26,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:26,821 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 17:21:26,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:26,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [869644014] [2020-07-21 17:21:26,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:26,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:21:26,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841190784] [2020-07-21 17:21:26,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:21:26,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:21:26,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:26,824 INFO L87 Difference]: Start difference. First operand 588 states and 709 transitions. Second operand 3 states. [2020-07-21 17:21:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:26,903 INFO L93 Difference]: Finished difference Result 1698 states and 2106 transitions. [2020-07-21 17:21:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:21:26,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-21 17:21:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:26,912 INFO L225 Difference]: With dead ends: 1698 [2020-07-21 17:21:26,912 INFO L226 Difference]: Without dead ends: 1130 [2020-07-21 17:21:26,915 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 17:21:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2020-07-21 17:21:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1126. [2020-07-21 17:21:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2020-07-21 17:21:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1353 transitions. [2020-07-21 17:21:27,000 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1353 transitions. Word has length 77 [2020-07-21 17:21:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:27,001 INFO L479 AbstractCegarLoop]: Abstraction has 1126 states and 1353 transitions. [2020-07-21 17:21:27,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:21:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1353 transitions. [2020-07-21 17:21:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-21 17:21:27,004 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:27,004 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 17:21:27,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:27,220 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1699881733, now seen corresponding path program 1 times [2020-07-21 17:21:27,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:27,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1575444954] [2020-07-21 17:21:27,222 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 17:21:27,310 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:21:27,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:27,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 17:21:27,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:27,341 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 17:21:27,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:27,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1575444954] [2020-07-21 17:21:27,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:27,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:21:27,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135511973] [2020-07-21 17:21:27,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:21:27,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:27,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:21:27,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:27,345 INFO L87 Difference]: Start difference. First operand 1126 states and 1353 transitions. Second operand 3 states. [2020-07-21 17:21:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:27,459 INFO L93 Difference]: Finished difference Result 3067 states and 3792 transitions. [2020-07-21 17:21:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:21:27,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-21 17:21:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:27,475 INFO L225 Difference]: With dead ends: 3067 [2020-07-21 17:21:27,475 INFO L226 Difference]: Without dead ends: 1962 [2020-07-21 17:21:27,483 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 17:21:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-07-21 17:21:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-07-21 17:21:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-07-21 17:21:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2388 transitions. [2020-07-21 17:21:27,635 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2388 transitions. Word has length 121 [2020-07-21 17:21:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:27,635 INFO L479 AbstractCegarLoop]: Abstraction has 1962 states and 2388 transitions. [2020-07-21 17:21:27,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:21:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2388 transitions. [2020-07-21 17:21:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-21 17:21:27,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:27,648 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:21:27,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:27,863 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:27,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:27,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1985577124, now seen corresponding path program 1 times [2020-07-21 17:21:27,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:27,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [627874065] [2020-07-21 17:21:27,864 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 17:21:27,948 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:21:27,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:27,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:21:27,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-21 17:21:28,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:28,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [627874065] [2020-07-21 17:21:28,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:28,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:21:28,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747423465] [2020-07-21 17:21:28,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:21:28,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:28,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:21:28,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:28,026 INFO L87 Difference]: Start difference. First operand 1962 states and 2388 transitions. Second operand 3 states. [2020-07-21 17:21:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:28,118 INFO L93 Difference]: Finished difference Result 3486 states and 4236 transitions. [2020-07-21 17:21:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:21:28,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-21 17:21:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:28,129 INFO L225 Difference]: With dead ends: 3486 [2020-07-21 17:21:28,130 INFO L226 Difference]: Without dead ends: 1544 [2020-07-21 17:21:28,136 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 17:21:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2020-07-21 17:21:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2020-07-21 17:21:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-07-21 17:21:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1872 transitions. [2020-07-21 17:21:28,249 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1872 transitions. Word has length 174 [2020-07-21 17:21:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:28,250 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 1872 transitions. [2020-07-21 17:21:28,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:21:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1872 transitions. [2020-07-21 17:21:28,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-21 17:21:28,256 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:28,256 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:21:28,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:28,470 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:28,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash -114161306, now seen corresponding path program 1 times [2020-07-21 17:21:28,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:28,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [418292785] [2020-07-21 17:21:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:21:28,601 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:21:28,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:28,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 17:21:28,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-07-21 17:21:28,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:28,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [418292785] [2020-07-21 17:21:28,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:28,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:21:28,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092685351] [2020-07-21 17:21:28,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:21:28,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:28,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:21:28,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:21:28,654 INFO L87 Difference]: Start difference. First operand 1544 states and 1872 transitions. Second operand 6 states. [2020-07-21 17:21:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:28,809 INFO L93 Difference]: Finished difference Result 2861 states and 3536 transitions. [2020-07-21 17:21:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:21:28,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2020-07-21 17:21:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:28,817 INFO L225 Difference]: With dead ends: 2861 [2020-07-21 17:21:28,818 INFO L226 Difference]: Without dead ends: 1337 [2020-07-21 17:21:28,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 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 17:21:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2020-07-21 17:21:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1337. [2020-07-21 17:21:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2020-07-21 17:21:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1588 transitions. [2020-07-21 17:21:28,903 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1588 transitions. Word has length 174 [2020-07-21 17:21:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:28,903 INFO L479 AbstractCegarLoop]: Abstraction has 1337 states and 1588 transitions. [2020-07-21 17:21:28,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:21:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1588 transitions. [2020-07-21 17:21:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-21 17:21:28,908 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:28,909 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] [2020-07-21 17:21:29,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:29,123 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:29,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:29,123 INFO L82 PathProgramCache]: Analyzing trace with hash -275508537, now seen corresponding path program 1 times [2020-07-21 17:21:29,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:29,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1200776652] [2020-07-21 17:21:29,124 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 17:21:29,235 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:29,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:29,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:21:29,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:29,265 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 17:21:29,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:29,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1200776652] [2020-07-21 17:21:29,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:29,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:21:29,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434466668] [2020-07-21 17:21:29,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:21:29,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:29,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:21:29,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:29,267 INFO L87 Difference]: Start difference. First operand 1337 states and 1588 transitions. Second operand 3 states. [2020-07-21 17:21:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:29,353 INFO L93 Difference]: Finished difference Result 2647 states and 3190 transitions. [2020-07-21 17:21:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:21:29,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-21 17:21:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:29,362 INFO L225 Difference]: With dead ends: 2647 [2020-07-21 17:21:29,362 INFO L226 Difference]: Without dead ends: 1331 [2020-07-21 17:21:29,367 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 17:21:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2020-07-21 17:21:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1331. [2020-07-21 17:21:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2020-07-21 17:21:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1564 transitions. [2020-07-21 17:21:29,442 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1564 transitions. Word has length 174 [2020-07-21 17:21:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:29,442 INFO L479 AbstractCegarLoop]: Abstraction has 1331 states and 1564 transitions. [2020-07-21 17:21:29,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:21:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1564 transitions. [2020-07-21 17:21:29,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 17:21:29,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:29,446 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 17:21:29,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:29,660 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:29,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:29,661 INFO L82 PathProgramCache]: Analyzing trace with hash 761571811, now seen corresponding path program 1 times [2020-07-21 17:21:29,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:29,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1306782291] [2020-07-21 17:21:29,662 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 17:21:29,764 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:21:29,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:29,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 17:21:29,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:29,801 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 17:21:29,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:29,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1306782291] [2020-07-21 17:21:29,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:29,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:21:29,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776100714] [2020-07-21 17:21:29,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:21:29,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:29,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:21:29,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:29,804 INFO L87 Difference]: Start difference. First operand 1331 states and 1564 transitions. Second operand 3 states. [2020-07-21 17:21:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:29,910 INFO L93 Difference]: Finished difference Result 3666 states and 4404 transitions. [2020-07-21 17:21:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:21:29,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 17:21:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:29,925 INFO L225 Difference]: With dead ends: 3666 [2020-07-21 17:21:29,925 INFO L226 Difference]: Without dead ends: 2356 [2020-07-21 17:21:29,931 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 17:21:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2020-07-21 17:21:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2353. [2020-07-21 17:21:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2020-07-21 17:21:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 2780 transitions. [2020-07-21 17:21:30,089 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 2780 transitions. Word has length 175 [2020-07-21 17:21:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:30,089 INFO L479 AbstractCegarLoop]: Abstraction has 2353 states and 2780 transitions. [2020-07-21 17:21:30,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:21:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 2780 transitions. [2020-07-21 17:21:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 17:21:30,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:30,097 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 17:21:30,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:30,313 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:30,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:30,313 INFO L82 PathProgramCache]: Analyzing trace with hash -784428293, now seen corresponding path program 1 times [2020-07-21 17:21:30,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:30,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1381832007] [2020-07-21 17:21:30,314 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 17:21:30,430 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:30,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:30,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 17:21:30,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:30,493 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 17:21:30,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:30,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1381832007] [2020-07-21 17:21:30,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:30,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:21:30,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771679296] [2020-07-21 17:21:30,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:21:30,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:30,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:21:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:21:30,495 INFO L87 Difference]: Start difference. First operand 2353 states and 2780 transitions. Second operand 3 states. [2020-07-21 17:21:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:30,610 INFO L93 Difference]: Finished difference Result 3876 states and 4746 transitions. [2020-07-21 17:21:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:21:30,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 17:21:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:30,624 INFO L225 Difference]: With dead ends: 3876 [2020-07-21 17:21:30,624 INFO L226 Difference]: Without dead ends: 2345 [2020-07-21 17:21:30,630 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 17:21:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2020-07-21 17:21:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 2345. [2020-07-21 17:21:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2345 states. [2020-07-21 17:21:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 2730 transitions. [2020-07-21 17:21:30,770 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 2730 transitions. Word has length 175 [2020-07-21 17:21:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:30,771 INFO L479 AbstractCegarLoop]: Abstraction has 2345 states and 2730 transitions. [2020-07-21 17:21:30,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:21:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2730 transitions. [2020-07-21 17:21:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-21 17:21:30,777 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:30,777 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, 1] [2020-07-21 17:21:30,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:30,991 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1275064779, now seen corresponding path program 1 times [2020-07-21 17:21:30,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:30,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [209866100] [2020-07-21 17:21:30,992 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 17:21:31,097 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:31,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:31,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 17:21:31,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-07-21 17:21:31,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:21:31,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [209866100] [2020-07-21 17:21:31,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:21:31,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 17:21:31,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643222192] [2020-07-21 17:21:31,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:21:31,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:31,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:21:31,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 17:21:31,152 INFO L87 Difference]: Start difference. First operand 2345 states and 2730 transitions. Second operand 6 states. [2020-07-21 17:21:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:31,288 INFO L93 Difference]: Finished difference Result 3727 states and 4389 transitions. [2020-07-21 17:21:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:21:31,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-07-21 17:21:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:31,294 INFO L225 Difference]: With dead ends: 3727 [2020-07-21 17:21:31,295 INFO L226 Difference]: Without dead ends: 896 [2020-07-21 17:21:31,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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 17:21:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-07-21 17:21:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2020-07-21 17:21:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2020-07-21 17:21:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1005 transitions. [2020-07-21 17:21:31,356 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1005 transitions. Word has length 176 [2020-07-21 17:21:31,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:31,357 INFO L479 AbstractCegarLoop]: Abstraction has 896 states and 1005 transitions. [2020-07-21 17:21:31,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:21:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1005 transitions. [2020-07-21 17:21:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-21 17:21:31,361 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:21:31,361 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 17:21:31,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:31,575 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:21:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:21:31,575 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-07-21 17:21:31,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:21:31,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2072109944] [2020-07-21 17:21:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:31,678 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:21:31,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:21:31,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-21 17:21:31,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:21:31,736 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 17:21:31,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:21:31,986 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 17:21:31,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2072109944] [2020-07-21 17:21:31,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 17:21:31,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2020-07-21 17:21:31,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286794996] [2020-07-21 17:21:31,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 17:21:31,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:21:31,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 17:21:31,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-21 17:21:31,989 INFO L87 Difference]: Start difference. First operand 896 states and 1005 transitions. Second operand 6 states. [2020-07-21 17:21:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:21:32,475 INFO L93 Difference]: Finished difference Result 920 states and 1037 transitions. [2020-07-21 17:21:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 17:21:32,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-07-21 17:21:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:21:32,477 INFO L225 Difference]: With dead ends: 920 [2020-07-21 17:21:32,477 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 17:21:32,481 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 17:21:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 17:21:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 17:21:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 17:21:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 17:21:32,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-07-21 17:21:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:21:32,483 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 17:21:32,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 17:21:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 17:21:32,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 17:21:32,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:21:32,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 17:21:35,527 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2020-07-21 17:21:35,922 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 47 [2020-07-21 17:21:36,161 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-07-21 17:21:36,477 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-07-21 17:21:36,793 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-07-21 17:21:36,909 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-07-21 17:21:37,218 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-07-21 17:21:37,526 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-07-21 17:21:37,930 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-07-21 17:21:38,430 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2020-07-21 17:21:38,810 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2020-07-21 17:21:39,507 WARN L193 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 62 [2020-07-21 17:21:39,802 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-07-21 17:21:40,420 WARN L193 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2020-07-21 17:21:40,979 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2020-07-21 17:21:41,433 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2020-07-21 17:21:41,737 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-07-21 17:21:42,581 WARN L193 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 76 [2020-07-21 17:21:42,742 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2020-07-21 17:21:43,062 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 47 [2020-07-21 17:21:43,202 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2020-07-21 17:21:44,023 WARN L193 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 76 [2020-07-21 17:21:44,310 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-07-21 17:21:44,610 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-07-21 17:21:45,445 WARN L193 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 76 [2020-07-21 17:21:45,719 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2020-07-21 17:21:46,147 WARN L193 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2020-07-21 17:21:46,377 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-07-21 17:21:46,618 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2020-07-21 17:21:46,830 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2020-07-21 17:21:47,410 WARN L193 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2020-07-21 17:21:47,570 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2020-07-21 17:21:47,979 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2020-07-21 17:21:48,202 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-07-21 17:21:48,500 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-07-21 17:21:49,163 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2020-07-21 17:21:49,512 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-07-21 17:21:49,753 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2020-07-21 17:21:49,985 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2020-07-21 17:21:50,200 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2020-07-21 17:21:50,474 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-07-21 17:21:50,513 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-21 17:21:50,514 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (<= 2 ~t1_st~0)) (.cse0 (not (= 1 ~t1_pc~0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse5 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~token~0 ~local~0)) .cse4 .cse5) (or .cse1 .cse2 .cse3 .cse4 (not (<= ~t1_pc~0 0)) .cse5 (not (<= ~m_pc~0 0))) (or (not (<= 2 ~E_1~0)) (not (= ~token~0 (+ ~local~0 1))) .cse0 .cse3 (not (<= 2 |old(~m_st~0)|)) .cse5 (<= 2 ~m_st~0)))) [2020-07-21 17:21:50,514 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-21 17:21:50,514 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse4 (= 0 ~m_st~0)) (.cse6 (not (= |old(~token~0)| ~local~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (<= 2 ~m_st~0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 (and .cse4 (= ~token~0 ~local~0) .cse5) .cse6 .cse7 (not (<= ~m_pc~0 0))) (let ((.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~E_M~0))) (or .cse0 .cse1 (and .cse4 .cse8 .cse9 (= ~token~0 (+ ~local~0 1))) .cse3 (and .cse8 .cse9 .cse10) .cse6 .cse11 (not (= 1 |old(~t1_pc~0)|)) .cse7)) (or .cse0 .cse1 .cse2 (and .cse5 .cse10) .cse3 .cse11 .cse7))) [2020-07-21 17:21:50,514 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-21 17:21:50,514 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse3 (<= ~t1_pc~0 0)) (.cse5 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse1 (= ~token~0 ~local~0)) (.cse2 (<= |old(~E_M~0)| ~E_M~0)) (.cse9 (<= 2 ~m_st~0)) (.cse6 (not (<= 2 ~T1_E~0))) (.cse7 (not (= |old(~token~0)| ~local~0))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 (and (= 0 ~m_st~0) .cse1 .cse2 .cse3) .cse4 .cse5 (not (= 0 |old(~m_st~0)|)) .cse6 .cse7 .cse8 (not (<= ~m_pc~0 0))) (or .cse0 .cse4 (and .cse2 .cse3 .cse9) .cse5 .cse6 .cse10 .cse8) (or .cse0 .cse4 (and (= 1 ~t1_pc~0) .cse1 .cse2 .cse9) .cse6 .cse7 .cse10 (not (= 1 |old(~t1_pc~0)|)) .cse8))) [2020-07-21 17:21:50,514 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-21 17:21:50,515 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse2 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (not (= |old(~token~0)| ~local~0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse4 .cse5 (not (<= ~m_pc~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (or .cse0 .cse1 (and (= 1 ~t1_pc~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= 2 ~m_st~0)) .cse3 .cse4 .cse6 (not (= 1 |old(~t1_pc~0)|)) .cse5))) [2020-07-21 17:21:50,515 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-21 17:21:50,515 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse6 (= 0 ~m_st~0)) (.cse4 (not (= |old(~token~0)| ~local~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))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse7 (= 1 ~t1_pc~0)) (.cse8 (<= 2 ~t1_st~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse11 (<= 2 ~m_st~0)) (.cse5 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 (= ~token~0 ~local~0) .cse9) (not (<= ~m_pc~0 0))) (let ((.cse10 (<= 2 ~E_M~0))) (or .cse0 (and .cse7 .cse8 .cse10 .cse11) .cse1 (and .cse6 .cse7 .cse8 .cse10 (= ~token~0 (+ ~local~0 1))) .cse3 .cse4 .cse12 (not (= 1 |old(~t1_pc~0)|)) .cse5)) (or .cse0 .cse1 .cse2 .cse3 .cse12 (and .cse7 .cse8 .cse9 .cse11) .cse5))) [2020-07-21 17:21:50,515 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse3 (not (= |old(~token~0)| ~local~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse6 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (and (= 1 ~t1_pc~0) (= ~token~0 (+ ~local~0 1)) (<= 2 ~m_st~0)) .cse2 .cse3 .cse4 (not (= 1 |old(~t1_pc~0)|)) .cse5) (or .cse0 .cse1 .cse6 (not (= 0 |old(~m_st~0)|)) .cse2 .cse3 .cse5 (not (<= ~m_pc~0 0))) (or .cse0 .cse1 .cse6 .cse2 .cse4 .cse5))) [2020-07-21 17:21:50,515 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-21 17:21:50,515 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-21 17:21:50,515 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-21 17:21:50,516 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-21 17:21:50,516 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-21 17:21:50,516 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse12 (not (<= ~m_pc~0 0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse10 (= 0 ~m_st~0)) (.cse14 (not (= ~token~0 (+ ~local~0 1)))) (.cse13 (not (<= ~t1_pc~0 0))) (.cse7 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~m_st~0)) (.cse6 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse1 .cse3 .cse4 .cse8 .cse6 .cse9) (or .cse7 .cse10 .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12) (or .cse7 .cse10 .cse11 .cse1 .cse2 .cse3 .cse13 .cse6 .cse12) (or .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse12) (or .cse7 .cse10 .cse11 .cse1 .cse3 .cse4 .cse13 .cse6 .cse12) (or .cse7 .cse1 .cse3 .cse13 .cse8 .cse6 .cse9) (or .cse7 .cse14 .cse0 .cse11 .cse1 .cse2 (and .cse10 .cse5) .cse3 .cse6) (or .cse7 .cse14 .cse0 .cse3 .cse8 .cse6 .cse9) (or .cse7 .cse1 .cse2 .cse3 .cse5 .cse13 .cse8 .cse6) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse8 (and .cse5 .cse9) .cse6))) [2020-07-21 17:21:50,516 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse13 (= 0 activate_threads_~tmp~1)) (.cse15 (<= 2 ~m_st~0))) (let ((.cse4 (and .cse13 .cse15)) (.cse11 (not (= ~token~0 ~local~0))) (.cse12 (not (<= ~m_pc~0 0))) (.cse16 (not (<= ~t1_pc~0 0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse2 (not (= ~token~0 (+ ~local~0 1)))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse8 (not (= 0 |old(~m_st~0)|))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse1 (= 0 ~m_st~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse8 .cse9 .cse10 .cse5 .cse11 .cse7 .cse12) (or .cse0 (and .cse13 .cse14 .cse15) .cse3 .cse9 .cse10 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse4 .cse5 .cse16 .cse6 .cse7) (or .cse9 .cse10 .cse5 .cse14 .cse16 .cse7 .cse12) (or .cse13 .cse9 .cse5 .cse16 .cse7 .cse12) (or .cse0 .cse1 .cse8 .cse9 .cse10 .cse5 .cse16 .cse7 .cse12) (or .cse3 .cse9 .cse10 (and .cse13 .cse14) .cse5 .cse11 .cse7) (or .cse0 .cse3 .cse9 .cse4 .cse5 .cse11 .cse6 .cse7) (or .cse1 .cse0 .cse8 .cse9 .cse5 .cse11 .cse16 .cse7 .cse12) (or .cse0 .cse9 .cse10 .cse5 .cse14 .cse16 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse8 .cse9 .cse10 .cse5 (and .cse13 .cse1 .cse14) .cse7)))) [2020-07-21 17:21:50,516 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-21 17:21:50,517 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse4 (not (= ~token~0 ~local~0))) (.cse12 (not (<= ~m_pc~0 0))) (.cse11 (not (= 0 |old(~m_st~0)|))) (.cse10 (= 0 ~m_st~0)) (.cse14 (not (= ~token~0 (+ ~local~0 1)))) (.cse13 (not (<= ~t1_pc~0 0))) (.cse7 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse5 (<= 2 ~t1_st~0)) (.cse9 (<= 2 ~m_st~0)) (.cse6 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse1 .cse3 .cse4 .cse8 .cse6 .cse9) (or .cse7 .cse10 .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12) (or .cse7 .cse10 .cse11 .cse1 .cse2 .cse3 .cse13 .cse6 .cse12) (or .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse12) (or .cse7 .cse10 .cse11 .cse1 .cse3 .cse4 .cse13 .cse6 .cse12) (or .cse7 .cse1 .cse3 .cse13 .cse8 .cse6 .cse9) (or .cse7 .cse14 .cse0 .cse11 .cse1 .cse2 (and .cse10 .cse5) .cse3 .cse6) (or .cse7 .cse14 .cse0 .cse3 .cse8 .cse6 .cse9) (or .cse7 .cse1 .cse2 .cse3 .cse5 .cse13 .cse8 .cse6) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse8 (and .cse5 .cse9) .cse6))) [2020-07-21 17:21:50,517 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-21 17:21:50,517 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-07-21 17:21:50,517 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-21 17:21:50,517 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-21 17:21:50,517 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-21 17:21:50,517 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-21 17:21:50,517 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-21 17:21:50,518 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-21 17:21:50,518 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-21 17:21:50,518 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-21 17:21:50,518 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (= 0 ~m_st~0))) (.cse7 (not (<= ~m_pc~0 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse3 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 ~m_st~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse6 (not (= 1 ~m_i~0))) (.cse5 (= 0 is_transmit1_triggered_~__retres1~1))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 ~t1_st~0)) .cse4 (not (= ~token~0 ~local~0)) .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse4 .cse6 .cse5) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse4 .cse5 .cse6) (or .cse3 .cse4 .cse9 .cse6 .cse5 .cse7) (or .cse0 .cse3 .cse8 .cse4 .cse9 .cse6 .cse5))) [2020-07-21 17:21:50,518 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-21 17:21:50,518 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-21 17:21:50,518 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-21 17:21:50,518 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 17:21:50,519 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 17:21:50,519 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 17:21:50,519 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse14 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (<= |old(~E_1~0)| ~E_1~0)) (.cse15 (<= |old(~M_E~0)| ~M_E~0)) (.cse16 (<= |old(~E_M~0)| ~E_M~0))) (let ((.cse10 (not (<= ~t1_pc~0 0))) (.cse8 (not (= 0 ~m_st~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse12 (and .cse14 .cse13 .cse15 .cse16)) (.cse11 (not (<= ~m_pc~0 0))) (.cse0 (and .cse13 .cse14 .cse15 .cse16)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse6 .cse7 .cse11) (or (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse8 .cse9 .cse3 .cse12 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse5 .cse10 .cse6 .cse7 .cse11) (or .cse1 .cse2 .cse8 .cse9 .cse3 .cse5 .cse12 .cse6 .cse7 .cse11) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7)))) [2020-07-21 17:21:50,519 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-21 17:21:50,519 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-21 17:21:50,519 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-21 17:21:50,519 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-21 17:21:50,520 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (= 0 ~m_st~0) (not (<= 2 ~E_1~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 (= 1 ~m_i~0)) (not (<= ~m_pc~0 0))) [2020-07-21 17:21:50,520 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-21 17:21:50,520 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 17:21:50,520 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-21 17:21:50,520 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-21 17:21:50,520 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-21 17:21:50,520 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 17:21:50,520 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and (= 0 ~m_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (= 1 ~m_i~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (<= 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 17:21:50,521 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-21 17:21:50,521 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-21 17:21:50,521 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-21 17:21:50,521 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-21 17:21:50,521 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-21 17:21:50,521 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-21 17:21:50,522 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse4 (not (<= |old(~m_pc~0)| 0))) (.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 (<= 2 ~T1_E~0))) (.cse6 (not (= 1 ~m_i~0)))) (and (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse3 .cse4 .cse5 (not (<= ~t1_pc~0 0)) .cse6) (or (and (not (= |old(~token~0)| ~local~0)) (<= 2 ~t1_st~0) (<= |old(~E_1~0)| ~E_1~0) (= ~token~0 (+ ~local~0 1))) .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse5 .cse6))) [2020-07-21 17:21:50,522 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse13 (= 1 ~m_i~0)) (.cse9 (<= 2 ~E_1~0)) (.cse12 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~m_st~0)) (.cse14 (<= 2 ~E_M~0))) (let ((.cse4 (not (<= |old(~m_pc~0)| 0))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse0 (not (= 1 ~t1_pc~0))) (.cse1 (not .cse14)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (and .cse9 .cse12 .cse14 .cse10)) (.cse7 (and .cse9 .cse14 .cse13 (= ~token~0 ~local~0) .cse10)) (.cse8 (not .cse13))) (and (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and .cse9 .cse10) .cse1 .cse3 .cse4 .cse5 .cse11 .cse8) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse11 .cse8) (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8)))) [2020-07-21 17:21:50,522 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse4 (not (<= |old(~m_pc~0)| 0))) (.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 (<= 2 ~T1_E~0))) (.cse6 (not (= 1 ~m_i~0)))) (and (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse3 .cse4 .cse5 (not (<= ~t1_pc~0 0)) .cse6) (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse5 .cse6))) [2020-07-21 17:21:50,522 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse6 (not (<= ~t1_pc~0 0))) (.cse3 (not (<= |old(~m_pc~0)| 0))) (.cse9 (<= ~m_pc~0 0)) (.cse5 (<= 2 ~t1_st~0)) (.cse8 (<= |old(~E_1~0)| ~E_1~0)) (.cse10 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 (and .cse8 .cse9)) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse8 .cse9 (= ~token~0 ~local~0)) .cse7) (or (and (not (= |old(~token~0)| ~local~0)) .cse5 .cse8 (= ~token~0 (+ ~local~0 1))) .cse10 .cse0 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse1 .cse2 .cse4 .cse7))) [2020-07-21 17:21:50,522 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse3 (not (<= |old(~m_pc~0)| 0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse9 (<= ~m_pc~0 0)) (.cse8 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (<= 2 ~t1_st~0)) (.cse10 (= ~token~0 ~local~0)) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse8 .cse0 .cse1 (and .cse5 .cse9 .cse10) .cse2 .cse3 .cse4 .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7) (or .cse8 .cse0 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse1 .cse2 .cse4 (and .cse5 .cse10) .cse7))) [2020-07-21 17:21:50,522 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-21 17:21:50,523 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse6 (not (<= ~t1_pc~0 0))) (.cse3 (not (<= |old(~m_pc~0)| 0))) (.cse9 (<= ~m_pc~0 0)) (.cse5 (<= 2 ~t1_st~0)) (.cse8 (<= |old(~E_1~0)| ~E_1~0)) (.cse10 (not (= 1 ~t1_pc~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 (and .cse8 .cse9)) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse8 .cse9 (= ~token~0 ~local~0)) .cse7) (or (and (not (= |old(~token~0)| ~local~0)) .cse5 .cse8 (= ~token~0 (+ ~local~0 1))) .cse10 .cse0 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse1 .cse2 .cse4 .cse7))) [2020-07-21 17:21:50,523 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-21 17:21:50,523 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-21 17:21:50,523 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse11 (not (<= 2 ~m_st~0))) (.cse9 (not (= 1 ~t1_pc~0))) (.cse3 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 0 ~m_st~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse10 (not (= ~token~0 ~local~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (<= |old(~M_E~0)| ~M_E~0)) (.cse7 (not (= 1 ~m_i~0))) (.cse8 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse2 .cse11 .cse4 .cse10 .cse6 .cse7) (or .cse0 .cse9 .cse2 .cse3 .cse11 .cse4 .cse6 .cse7) (or .cse0 .cse2 .cse11 .cse4 .cse5 .cse6 .cse7) (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7 .cse8))) [2020-07-21 17:21:50,523 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-21 17:21:50,523 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 17:21:50,523 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 17:21:50,523 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 17:21:50,523 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse15 (not (<= |old(~m_pc~0)| 0))) (.cse18 (<= ~m_pc~0 0)) (.cse8 (= ~token~0 ~local~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse10 (<= 2 ~m_st~0)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (= 0 |old(~m_st~0)|))) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse16 (= 0 ~m_st~0)) (.cse6 (= 1 ~t1_pc~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse7 (<= |old(~E_1~0)| ~E_1~0)) (.cse9 (<= |old(~E_M~0)| ~E_M~0)) (.cse5 (not (= 1 |old(~t1_pc~0)|))) (.cse11 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse1 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 (and .cse16 .cse17 .cse7 .cse18 .cse9 .cse19) .cse11) (or .cse0 .cse1 .cse13 .cse14 .cse2 .cse15 .cse3 (and .cse16 .cse6 .cse17 .cse7 .cse18 .cse8 .cse9) .cse5 .cse11) (or .cse1 (and .cse7 .cse9 .cse19 .cse10) .cse12 .cse2 .cse3 .cse4 .cse11) (or .cse0 .cse1 .cse12 .cse13 .cse2 .cse15 .cse3 (and .cse16 .cse7 .cse18 .cse8 .cse9 .cse19) .cse11) (or .cse1 .cse12 .cse14 .cse2 .cse3 .cse17 .cse4 .cse11) (or .cse1 (and .cse6 .cse17 .cse7 .cse9 .cse10) .cse14 .cse2 .cse3 .cse4 .cse5 .cse11) (or .cse1 .cse13 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse14 .cse2 .cse3 (and .cse16 .cse6 .cse17 (not (= |old(~token~0)| ~local~0)) .cse7 (= ~token~0 (+ ~local~0 1)) .cse9) .cse5 .cse11))) [2020-07-21 17:21:50,524 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-21 17:21:50,524 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-21 17:21:50,524 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-21 17:21:50,524 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-21 17:21:50,524 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse15 (= 0 ~m_st~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse18 (<= ~m_pc~0 0)) (.cse22 (= ~token~0 ~local~0)) (.cse16 (<= 2 ~E_1~0)) (.cse28 (<= 2 ~T1_E~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse26 (<= 2 ~E_M~0)) (.cse24 (= 1 ~m_i~0)) (.cse19 (<= |old(~E_M~0)| ~E_M~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse27 (<= 2 ~m_st~0))) (let ((.cse13 (and .cse16 .cse28 .cse17 .cse26 .cse24 .cse19 .cse20 .cse27)) (.cse14 (not (<= |old(~m_pc~0)| 0))) (.cse21 (and .cse15 .cse16 .cse28 .cse25 .cse17 .cse26 .cse24 .cse18 .cse22)) (.cse10 (not (= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (= 0 |old(~m_st~0)|))) (.cse5 (and .cse16 .cse28 .cse25 .cse26 .cse24 .cse22 .cse27)) (.cse6 (and .cse15 .cse16 .cse25 .cse17 .cse26 .cse24 (= ~token~0 (+ ~local~0 1)))) (.cse23 (and .cse16 .cse26 .cse24 .cse19 .cse20 .cse27)) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse28)) (.cse7 (and .cse16 .cse25 .cse17 .cse26 .cse24 .cse27)) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (= 1 |old(~t1_pc~0)|))) (.cse9 (not .cse24))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9) (or .cse0 .cse12 .cse2 .cse3 .cse13 .cse4 .cse11 .cse9) (or .cse0 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse4 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse9) (or .cse2 .cse14 .cse4 .cse21 .cse9 .cse10 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8) (or (and .cse15 .cse16 .cse18 .cse22 .cse19 .cse20) .cse14 .cse4 .cse21 .cse9 .cse10 .cse0 .cse23 .cse12 .cse1 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse23 .cse12 .cse3 .cse4 .cse7 .cse11 .cse9) (or .cse0 .cse2 .cse3 .cse4 .cse7 .cse11 .cse8 .cse9)))) [2020-07-21 17:21:50,525 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse18 (<= 2 ~T1_E~0)) (.cse14 (= ~token~0 ~local~0)) (.cse13 (<= 2 ~E_1~0)) (.cse19 (<= 2 ~E_M~0)) (.cse17 (= 1 ~m_i~0)) (.cse15 (<= |old(~E_M~0)| ~E_M~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse20 (<= 2 ~m_st~0))) (let ((.cse10 (and .cse13 .cse19 .cse17 .cse15 .cse16 .cse20)) (.cse8 (not (= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (= 0 |old(~m_st~0)|))) (.cse12 (not (<= |old(~m_pc~0)| 0))) (.cse5 (and .cse13 .cse18 (= 1 ~t1_pc~0) .cse19 .cse17 .cse14 .cse20)) (.cse6 (not (= 1 |old(~t1_pc~0)|))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse11 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse18)) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse17))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse0 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (or .cse0 .cse10 .cse11 .cse3 .cse4 .cse9 .cse7) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse12 .cse4 .cse7) (or .cse8 .cse0 .cse10 .cse11 .cse1 (and (= 0 ~m_st~0) .cse13 (<= ~m_pc~0 0) .cse14 .cse15 .cse16) .cse3 .cse12 .cse4 .cse5 .cse7) (or .cse8 .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (or .cse0 .cse11 .cse2 .cse3 .cse4 .cse9 .cse7)))) [2020-07-21 17:21:50,525 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse15 (= 0 ~m_st~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse18 (<= ~m_pc~0 0)) (.cse22 (= ~token~0 ~local~0)) (.cse16 (<= 2 ~E_1~0)) (.cse28 (<= 2 ~T1_E~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse26 (<= 2 ~E_M~0)) (.cse24 (= 1 ~m_i~0)) (.cse19 (<= |old(~E_M~0)| ~E_M~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse27 (<= 2 ~m_st~0))) (let ((.cse13 (and .cse16 .cse28 .cse17 .cse26 .cse24 .cse19 .cse20 .cse27)) (.cse14 (not (<= |old(~m_pc~0)| 0))) (.cse21 (and .cse15 .cse16 .cse28 .cse25 .cse17 .cse26 .cse24 .cse18 .cse22)) (.cse10 (not (= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (= 0 |old(~m_st~0)|))) (.cse5 (and .cse16 .cse28 .cse25 .cse26 .cse24 .cse22 .cse27)) (.cse6 (and .cse15 .cse16 .cse25 .cse17 .cse26 .cse24 (= ~token~0 (+ ~local~0 1)))) (.cse23 (and .cse16 .cse26 .cse24 .cse19 .cse20 .cse27)) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse28)) (.cse7 (and .cse16 .cse25 .cse17 .cse26 .cse24 .cse27)) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (= 1 |old(~t1_pc~0)|))) (.cse9 (not .cse24))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9) (or .cse0 .cse12 .cse2 .cse3 .cse13 .cse4 .cse11 .cse9) (or .cse0 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse4 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse9) (or .cse2 .cse14 .cse4 .cse21 .cse9 .cse10 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8) (or (and .cse15 .cse16 .cse18 .cse22 .cse19 .cse20) .cse14 .cse4 .cse21 .cse9 .cse10 .cse0 .cse23 .cse12 .cse1 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse23 .cse12 .cse3 .cse4 .cse7 .cse11 .cse9) (or .cse0 .cse2 .cse3 .cse4 .cse7 .cse11 .cse8 .cse9)))) [2020-07-21 17:21:50,525 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-21 17:21:50,525 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse12 (<= 2 ~E_1~0)) (.cse18 (= 1 ~t1_pc~0)) (.cse13 (<= 2 ~t1_st~0)) (.cse19 (<= 2 ~E_M~0)) (.cse14 (<= ~m_pc~0 0))) (let ((.cse15 (<= |old(~E_M~0)| ~E_M~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse11 (not (<= |old(~m_pc~0)| 0))) (.cse17 (and .cse12 .cse18 .cse13 .cse19 .cse14 (= ~token~0 ~local~0))) (.cse8 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse2 (and .cse12 .cse18 .cse13 .cse19 (= ~token~0 (+ ~local~0 1)))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (= 1 |old(~t1_pc~0)|))) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse1 .cse8 .cse9 .cse10 .cse3 .cse11 .cse4 .cse7 (and .cse12 .cse13 .cse14 .cse15 .cse16)) (or .cse0 .cse1 .cse8 .cse9 (and .cse12 .cse14 .cse15 .cse16) .cse2 .cse3 .cse11 .cse4 .cse17 .cse7) (or .cse0 .cse1 .cse9 .cse10 .cse2 .cse3 .cse11 .cse4 .cse17 .cse6 .cse7) (or .cse1 .cse8 .cse3 .cse4 .cse5 .cse7) (or .cse1 .cse9 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse10 .cse2 .cse3 .cse4 .cse6 .cse7) (or .cse1 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-07-21 17:21:50,525 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-21 17:21:50,526 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse15 (= 0 ~m_st~0)) (.cse25 (= 1 ~t1_pc~0)) (.cse18 (<= ~m_pc~0 0)) (.cse22 (= ~token~0 ~local~0)) (.cse16 (<= 2 ~E_1~0)) (.cse28 (<= 2 ~T1_E~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse26 (<= 2 ~E_M~0)) (.cse24 (= 1 ~m_i~0)) (.cse19 (<= |old(~E_M~0)| ~E_M~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse27 (<= 2 ~m_st~0))) (let ((.cse13 (and .cse16 .cse28 .cse17 .cse26 .cse24 .cse19 .cse20 .cse27)) (.cse14 (not (<= |old(~m_pc~0)| 0))) (.cse21 (and .cse15 .cse16 .cse28 .cse25 .cse17 .cse26 .cse24 .cse18 .cse22)) (.cse10 (not (= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (= 0 |old(~m_st~0)|))) (.cse5 (and .cse16 .cse28 .cse25 .cse26 .cse24 .cse22 .cse27)) (.cse6 (and .cse15 .cse16 .cse25 .cse17 .cse26 .cse24 (= ~token~0 (+ ~local~0 1)))) (.cse23 (and .cse16 .cse26 .cse24 .cse19 .cse20 .cse27)) (.cse12 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse28)) (.cse7 (and .cse16 .cse25 .cse17 .cse26 .cse24 .cse27)) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (= 1 |old(~t1_pc~0)|))) (.cse9 (not .cse24))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9) (or .cse0 .cse12 .cse2 .cse3 .cse13 .cse4 .cse11 .cse9) (or .cse0 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse4 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse9) (or .cse2 .cse14 .cse4 .cse21 .cse9 .cse10 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8) (or (and .cse15 .cse16 .cse18 .cse22 .cse19 .cse20) .cse14 .cse4 .cse21 .cse9 .cse10 .cse0 .cse23 .cse12 .cse1 .cse3 .cse5 .cse6 .cse7) (or .cse0 .cse23 .cse12 .cse3 .cse4 .cse7 .cse11 .cse9) (or .cse0 .cse2 .cse3 .cse4 .cse7 .cse11 .cse8 .cse9)))) [2020-07-21 17:21:50,526 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-21 17:21:50,526 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-21 17:21:50,526 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-21 17:21:50,526 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-21 17:21:50,526 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-21 17:21:50,526 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-21 17:21:50,527 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-21 17:21:50,527 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-21 17:21:50,527 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-21 17:21:50,527 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-21 17:21:50,527 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse14 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (<= |old(~E_1~0)| ~E_1~0)) (.cse15 (<= |old(~M_E~0)| ~M_E~0)) (.cse16 (<= |old(~E_M~0)| ~E_M~0))) (let ((.cse10 (not (<= ~t1_pc~0 0))) (.cse8 (not (= 0 ~m_st~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse12 (and .cse14 .cse13 .cse15 .cse16)) (.cse11 (not (<= ~m_pc~0 0))) (.cse0 (and .cse13 .cse14 .cse15 .cse16)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse6 .cse7 .cse11) (or (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse8 .cse9 .cse3 .cse12 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse5 .cse10 .cse6 .cse7 .cse11) (or .cse1 .cse2 .cse8 .cse9 .cse3 .cse5 .cse12 .cse6 .cse7 .cse11) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7)))) [2020-07-21 17:21:50,527 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 17:21:50,527 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 17:21:50,527 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-21 17:21:50,528 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-21 17:21:50,528 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 17:21:50,528 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-21 17:21:50,528 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (<= |old(~E_1~0)| ~E_1~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 (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 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0)))) [2020-07-21 17:21:50,528 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-21 17:21:50,528 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-21 17:21:50,528 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-21 17:21:50,529 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse10 (<= 2 ~t1_st~0)) (.cse3 (<= ~m_pc~0 0)) (.cse5 (<= |old(~E_M~0)| ~E_M~0)) (.cse6 (<= ~t1_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~token~0 ~local~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 .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (= 1 ~m_i~0)) (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 .cse8 .cse9 .cse2 .cse4 .cse7) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,529 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)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~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 (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .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) (not (<= 2 |old(~M_E~0)|)) (and .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,529 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)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~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 (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .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) (not (<= 2 |old(~M_E~0)|)) (and .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,529 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)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~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 (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .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) (not (<= 2 |old(~M_E~0)|)) (and .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,530 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)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~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 (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .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) (not (<= 2 |old(~M_E~0)|)) (and .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,530 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)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~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 (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .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) (not (<= 2 |old(~M_E~0)|)) (and .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,530 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-21 17:21:50,530 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)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~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 (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .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) (not (<= 2 |old(~M_E~0)|)) (and .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,531 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-21 17:21:50,531 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)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~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 (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .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) (not (<= 2 |old(~M_E~0)|)) (and .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,531 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-21 17:21:50,531 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (<= |old(~E_1~0)| ~E_1~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 (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 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0)))) [2020-07-21 17:21:50,531 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= 0 ~m_st~0)) (.cse1 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (<= |old(~E_1~0)| ~E_1~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 (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 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5 .cse6) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0)))) [2020-07-21 17:21:50,532 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)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~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 (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .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) (not (<= 2 |old(~M_E~0)|)) (and .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,532 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-21 17:21:50,532 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)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~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 (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .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) (not (<= 2 |old(~M_E~0)|)) (and .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,532 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-21 17:21:50,532 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)) (.cse3 (<= ~m_pc~0 0)) (.cse4 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (<= 2 ~E_M~0)) (.cse2 (<= |old(~T1_E~0)| ~T1_E~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 (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .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) (not (<= 2 |old(~M_E~0)|)) (and .cse1 .cse8 .cse9 .cse10 .cse2 .cse7) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 17:21:50,533 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-07-21 17:21:50,533 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-21 17:21:50,533 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-21 17:21:50,533 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse8 (not (<= ~t1_pc~0 0))) (.cse1 (not (<= 2 ~E_1~0))) (.cse7 (not (<= 2 ~m_st~0))) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse2 (not (= 1 ~t1_pc~0))) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse9 (not (= ~token~0 ~local~0))) (.cse6 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= ~token~0 (+ ~local~0 1))) .cse2 (not (= 0 ~m_st~0)) .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse0 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6) (or .cse1 .cse0 .cse3 .cse7 .cse5 .cse8 .cse6) (or .cse0 .cse3 .cse5 .cse8 .cse6 (not (<= ~m_pc~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse5 .cse9 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6))) [2020-07-21 17:21:50,533 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-21 17:21:50,533 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-21 17:21:50,533 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-21 17:21:50,533 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-21 17:21:50,534 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-21 17:21:50,534 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-21 17:21:50,534 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 17:21:50,534 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 17:21:50,534 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 17:21:50,534 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 17:21:50,534 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-21 17:21:50,534 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 17:21:50,534 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse14 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (<= |old(~E_1~0)| ~E_1~0)) (.cse15 (<= |old(~M_E~0)| ~M_E~0)) (.cse16 (<= |old(~E_M~0)| ~E_M~0))) (let ((.cse10 (not (<= ~t1_pc~0 0))) (.cse8 (not (= 0 ~m_st~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse12 (and .cse14 .cse13 .cse15 .cse16)) (.cse11 (not (<= ~m_pc~0 0))) (.cse0 (and .cse13 .cse14 .cse15 .cse16)) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse9 (not (<= 2 ~t1_st~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse6 .cse7 .cse11) (or (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse8 .cse9 .cse3 .cse12 .cse6 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse5 .cse10 .cse6 .cse7 .cse11) (or .cse1 .cse2 .cse8 .cse9 .cse3 .cse5 .cse12 .cse6 .cse7 .cse11) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse6 .cse7)))) [2020-07-21 17:21:50,534 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-21 17:21:50,534 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 17:21:50,534 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 17:21:50,535 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-21 17:21:50,535 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-21 17:21:50,535 INFO L271 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2020-07-21 17:21:50,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:21:50 BoogieIcfgContainer [2020-07-21 17:21:50,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 17:21:50,590 INFO L168 Benchmark]: Toolchain (without parser) took 29697.36 ms. Allocated memory was 145.2 MB in the beginning and 589.3 MB in the end (delta: 444.1 MB). Free memory was 102.9 MB in the beginning and 423.2 MB in the end (delta: -320.3 MB). Peak memory consumption was 465.9 MB. Max. memory is 7.1 GB. [2020-07-21 17:21:50,591 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 17:21:50,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.34 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 181.1 MB in the end (delta: -78.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-07-21 17:21:50,592 INFO L168 Benchmark]: Boogie Preprocessor took 43.52 ms. Allocated memory is still 202.9 MB. Free memory was 181.1 MB in the beginning and 178.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-21 17:21:50,592 INFO L168 Benchmark]: RCFGBuilder took 601.14 ms. Allocated memory is still 202.9 MB. Free memory was 178.0 MB in the beginning and 146.9 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2020-07-21 17:21:50,593 INFO L168 Benchmark]: TraceAbstraction took 28608.07 ms. Allocated memory was 202.9 MB in the beginning and 589.3 MB in the end (delta: 386.4 MB). Free memory was 146.2 MB in the beginning and 423.2 MB in the end (delta: -277.0 MB). Peak memory consumption was 451.5 MB. Max. memory is 7.1 GB. [2020-07-21 17:21:50,595 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.61 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 437.34 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 181.1 MB in the end (delta: -78.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.52 ms. Allocated memory is still 202.9 MB. Free memory was 181.1 MB in the beginning and 178.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 601.14 ms. Allocated memory is still 202.9 MB. Free memory was 178.0 MB in the beginning and 146.9 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28608.07 ms. Allocated memory was 202.9 MB in the beginning and 589.3 MB in the end (delta: 386.4 MB). Free memory was 146.2 MB in the beginning and 423.2 MB in the end (delta: -277.0 MB). Peak memory consumption was 451.5 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)) || !(0 == \old(m_st))) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_i) && token == local) && 2 <= m_st)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && token == local + 1)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st)) || !(1 == \old(t1_pc))) || !(1 == m_i)) && (((((((((!(\old(token) == \old(local)) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_i) && token == local) && 2 <= m_st)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && token == local + 1)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i))) && (((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == m_i))) && (((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\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)) || !(1 == m_i))) && ((((((((((((!(2 <= \old(t1_st)) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && m_pc <= 0) && token == local)) || !(1 == m_i)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_i) && token == local) && 2 <= m_st)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && token == local + 1)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((((((((((((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) && 2 <= T1_E) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && m_pc <= 0) && token == local)) || !(1 == m_i)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || (((((2 <= E_1 && 2 <= E_M) && 1 == m_i) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_i) && token == local) && 2 <= m_st)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && token == local + 1)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st))) && (((((((!(2 <= \old(E_M)) || (((((2 <= E_1 && 2 <= E_M) && 1 == m_i) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == m_i))) && (((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((0 == __retres1 || !(2 <= E_1)) || !(token == local + 1)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(1 == m_i)) && (((((((!(2 <= E_1) || 0 == __retres1) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(1 == m_i))) && ((((((!(2 <= E_1) || 0 == __retres1) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 == m_i))) && (((((0 == __retres1 || !(2 <= E_M)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 == m_i)) || !(m_pc <= 0))) && (((((((0 == __retres1 || !(2 <= E_1)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(token == local)) || !(1 == m_i))) && ((((((0 == __retres1 || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local)) || !(1 == m_i)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || (((2 <= E_1 && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || ((((2 <= E_1 && 2 <= E_M) && 1 == m_i) && token == local) && 2 <= m_st)) || !(1 == m_i)) && (((((((2 <= E_1 && 2 <= m_st) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 == m_i))) && (((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) || !(1 == m_i))) && ((((((((!(1 == t1_pc) || !(2 <= E_M)) || !(\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)) || ((((2 <= E_1 && 2 <= E_M) && 1 == m_i) && token == local) && 2 <= m_st)) || !(1 == m_i)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((!(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)) || !(1 == m_i)) || !(m_pc <= 0)) && ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || (((0 == m_st && 1 == t1_pc) && 2 <= E_M) && token == local + 1)) || !(2 <= T1_E)) || ((1 == t1_pc && 2 <= E_M) && 2 <= m_st)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i))) && ((((((!(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))) || !(1 == m_i)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((((((((((((!(2 <= \old(E_M)) || !(0 == \old(m_st))) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_i) && token == local) && 2 <= m_st)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && token == local + 1)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st)) || !(1 == \old(t1_pc))) || !(1 == m_i)) && (((((((((!(\old(token) == \old(local)) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_i) && token == local) && 2 <= m_st)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && token == local + 1)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i))) && (((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == m_i))) && (((((((((!(2 <= \old(E_M)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((((2 <= E_1 && 2 <= T1_E) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\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)) || !(1 == m_i))) && ((((((((((((!(2 <= \old(t1_st)) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || ((((((((0 == m_st && 2 <= E_1) && 2 <= T1_E) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && m_pc <= 0) && token == local)) || !(1 == m_i)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_i) && token == local) && 2 <= m_st)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && token == local + 1)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && ((((((((((((((((((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) && 2 <= T1_E) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && m_pc <= 0) && token == local)) || !(1 == m_i)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || (((((2 <= E_1 && 2 <= E_M) && 1 == m_i) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || ((((((2 <= E_1 && 2 <= T1_E) && 1 == t1_pc) && 2 <= E_M) && 1 == m_i) && token == local) && 2 <= m_st)) || ((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && token == local + 1)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st))) && (((((((!(2 <= \old(E_M)) || (((((2 <= E_1 && 2 <= E_M) && 1 == m_i) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(\old(t1_pc) <= 0)) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == m_i))) && (((((((!(2 <= \old(E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_i) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || !(1 == m_i)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && token == local) && \old(E_M) <= E_M)) || !(m_pc <= 0)) && ((((((((!(2 <= E_1) || (((1 == t1_pc && 2 <= t1_st) && 2 <= E_M) && 2 <= m_st)) || !(2 <= \old(E_M))) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i))) && ((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || (((1 == t1_pc && 2 <= t1_st) && \old(E_M) <= E_M) && 2 <= m_st)) || !(1 == m_i)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= T1_E)) || !(\old(token) == local)) || !(1 == m_i)) || !(m_pc <= 0)) && (((((!(2 <= E_1) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == m_i))) && (((((((!(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))) || !(1 == m_i)) - 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)) || !(1 == m_i)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((0 == m_st && 2 <= E_1) && 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 <= \old(M_E))) || (((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && \old(T1_E) <= T1_E) && 2 <= m_st)) || !(2 <= \old(T1_E)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((!(\old(token) == \old(local)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(1 == m_i)) && (((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 == m_i))) && ((((((((((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && token == local + 1) || !(1 == t1_pc)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(1 == m_i)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((!(2 <= E_1) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= T1_E)) || !(token == local)) || 0 == __retres1) || !(1 == m_i)) || !(m_pc <= 0)) && (((((!(2 <= E_1) || !(1 == t1_pc)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(1 == m_i)) || 0 == __retres1)) && ((((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= T1_E)) || 0 == __retres1) || !(1 == m_i))) && (((((!(2 <= E_M) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 == m_i)) || 0 == __retres1) || !(m_pc <= 0))) && ((((((!(2 <= E_1) || !(2 <= E_M)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 == m_i)) || 0 == __retres1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((!(2 <= E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || 2 <= t1_st) || !(t1_pc <= 0)) || !(1 == m_i)) && ((((((!(2 <= E_M) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 == m_i)) || (\old(E_1) <= E_1 && m_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)) || (((2 <= t1_st && \old(E_1) <= E_1) && m_pc <= 0) && token == local)) || !(1 == m_i))) && ((((((((((!(\old(token) == local) && 2 <= t1_st) && \old(E_1) <= E_1) && token == local + 1) || !(1 == t1_pc)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(1 == m_i)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.6s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2844 SDtfs, 2456 SDslu, 2597 SDs, 0 SdLazy, 1308 SolverSat, 600 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1979 GetRequests, 1936 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2353occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 216 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 5302 PreInvPairs, 5854 NumberOfFragments, 10279 HoareAnnotationTreeSize, 5302 FomulaSimplifications, 13107 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 62 FomulaSimplificationsInter, 32914 FormulaSimplificationTreeSizeReductionInter, 15.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1807 NumberOfCodeBlocks, 1448 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1968 ConstructedInterpolants, 0 QuantifiedInterpolants, 399155 SizeOfPredicates, 21 NumberOfNonLiveVariables, 6820 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 852/875 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...