/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-72570d3
[2020-08-22 17:04:32,685 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-08-22 17:04:32,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-08-22 17:04:32,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-08-22 17:04:32,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-08-22 17:04:32,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-08-22 17:04:32,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-08-22 17:04:32,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-08-22 17:04:32,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-08-22 17:04:32,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-08-22 17:04:32,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-08-22 17:04:32,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-08-22 17:04:32,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-08-22 17:04:32,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-08-22 17:04:32,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-08-22 17:04:32,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-08-22 17:04:32,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-08-22 17:04:32,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-08-22 17:04:32,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-08-22 17:04:32,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-08-22 17:04:32,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-08-22 17:04:32,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-08-22 17:04:32,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-08-22 17:04:32,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-08-22 17:04:32,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-08-22 17:04:32,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-08-22 17:04:32,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-08-22 17:04:32,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-08-22 17:04:32,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-08-22 17:04:32,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-08-22 17:04:32,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-08-22 17:04:32,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-08-22 17:04:32,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-08-22 17:04:32,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-08-22 17:04:32,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-08-22 17:04:32,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-08-22 17:04:32,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-08-22 17:04:32,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-08-22 17:04:32,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-08-22 17:04:32,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-08-22 17:04:32,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-08-22 17:04:32,751 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-08-22 17:04:32,779 INFO L113 SettingsManager]: Loading preferences was successful
[2020-08-22 17:04:32,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-08-22 17:04:32,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-08-22 17:04:32,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-08-22 17:04:32,785 INFO L138 SettingsManager]: * Use SBE=true
[2020-08-22 17:04:32,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-08-22 17:04:32,787 INFO L138 SettingsManager]: * sizeof long=4
[2020-08-22 17:04:32,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-08-22 17:04:32,788 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-08-22 17:04:32,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-08-22 17:04:32,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-08-22 17:04:32,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-08-22 17:04:32,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-08-22 17:04:32,789 INFO L138 SettingsManager]: * sizeof long double=12
[2020-08-22 17:04:32,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-08-22 17:04:32,789 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-08-22 17:04:32,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-08-22 17:04:32,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-08-22 17:04:32,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-08-22 17:04:32,793 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-08-22 17:04:32,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-08-22 17:04:32,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-08-22 17:04:32,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-08-22 17:04:32,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-08-22 17:04:32,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-08-22 17:04:32,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-08-22 17:04:32,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-08-22 17:04:32,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-08-22 17:04:32,796 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-08-22 17:04:32,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-08-22 17:04:33,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-08-22 17:04:33,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-08-22 17:04:33,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-08-22 17:04:33,134 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-08-22 17:04:33,134 INFO L275 PluginConnector]: CDTParser initialized
[2020-08-22 17:04:33,135 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c
[2020-08-22 17:04:33,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1f3d6fe/324e5f521c7c4a5b8ca0c52d5e84922a/FLAGd4032a456
[2020-08-22 17:04:33,720 INFO L306 CDTParser]: Found 1 translation units.
[2020-08-22 17:04:33,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c
[2020-08-22 17:04:33,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1f3d6fe/324e5f521c7c4a5b8ca0c52d5e84922a/FLAGd4032a456
[2020-08-22 17:04:34,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1f3d6fe/324e5f521c7c4a5b8ca0c52d5e84922a
[2020-08-22 17:04:34,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-08-22 17:04:34,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-08-22 17:04:34,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-08-22 17:04:34,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-08-22 17:04:34,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-08-22 17:04:34,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:04:34" (1/1) ...
[2020-08-22 17:04:34,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d04bb86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34, skipping insertion in model container
[2020-08-22 17:04:34,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:04:34" (1/1) ...
[2020-08-22 17:04:34,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-08-22 17:04:34,148 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-08-22 17:04:34,401 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-08-22 17:04:34,414 INFO L203 MainTranslator]: Completed pre-run
[2020-08-22 17:04:34,590 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-08-22 17:04:34,615 INFO L208 MainTranslator]: Completed translation
[2020-08-22 17:04:34,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34 WrapperNode
[2020-08-22 17:04:34,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-08-22 17:04:34,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-08-22 17:04:34,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-08-22 17:04:34,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-08-22 17:04:34,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34" (1/1) ...
[2020-08-22 17:04:34,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34" (1/1) ...
[2020-08-22 17:04:34,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34" (1/1) ...
[2020-08-22 17:04:34,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34" (1/1) ...
[2020-08-22 17:04:34,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34" (1/1) ...
[2020-08-22 17:04:34,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34" (1/1) ...
[2020-08-22 17:04:34,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34" (1/1) ...
[2020-08-22 17:04:34,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-08-22 17:04:34,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-08-22 17:04:34,669 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-08-22 17:04:34,670 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-08-22 17:04:34,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34" (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-08-22 17:04:34,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-08-22 17:04:34,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-08-22 17:04:34,743 INFO L138 BoogieDeclarations]: Found implementation of procedure error
[2020-08-22 17:04:34,743 INFO L138 BoogieDeclarations]: Found implementation of procedure master
[2020-08-22 17:04:34,743 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1
[2020-08-22 17:04:34,743 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2
[2020-08-22 17:04:34,743 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered
[2020-08-22 17:04:34,744 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered
[2020-08-22 17:04:34,744 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered
[2020-08-22 17:04:34,744 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels
[2020-08-22 17:04:34,744 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads
[2020-08-22 17:04:34,745 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread
[2020-08-22 17:04:34,745 INFO L138 BoogieDeclarations]: Found implementation of procedure eval
[2020-08-22 17:04:34,746 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events
[2020-08-22 17:04:34,746 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events
[2020-08-22 17:04:34,747 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads
[2020-08-22 17:04:34,747 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify
[2020-08-22 17:04:34,747 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events
[2020-08-22 17:04:34,748 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events
[2020-08-22 17:04:34,748 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model
[2020-08-22 17:04:34,748 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation
[2020-08-22 17:04:34,748 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation
[2020-08-22 17:04:34,748 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-08-22 17:04:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-08-22 17:04:34,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-08-22 17:04:34,749 INFO L130 BoogieDeclarations]: Found specification of procedure error
[2020-08-22 17:04:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered
[2020-08-22 17:04:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered
[2020-08-22 17:04:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered
[2020-08-22 17:04:34,750 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify
[2020-08-22 17:04:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure master
[2020-08-22 17:04:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1
[2020-08-22 17:04:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2
[2020-08-22 17:04:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels
[2020-08-22 17:04:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads
[2020-08-22 17:04:34,751 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread
[2020-08-22 17:04:34,752 INFO L130 BoogieDeclarations]: Found specification of procedure eval
[2020-08-22 17:04:34,752 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events
[2020-08-22 17:04:34,752 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events
[2020-08-22 17:04:34,752 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads
[2020-08-22 17:04:34,752 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events
[2020-08-22 17:04:34,752 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events
[2020-08-22 17:04:34,753 INFO L130 BoogieDeclarations]: Found specification of procedure init_model
[2020-08-22 17:04:34,753 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation
[2020-08-22 17:04:34,753 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation
[2020-08-22 17:04:34,753 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-08-22 17:04:34,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-08-22 17:04:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-08-22 17:04:35,317 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-08-22 17:04:35,318 INFO L295 CfgBuilder]: Removed 6 assume(true) statements.
[2020-08-22 17:04:35,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:04:35 BoogieIcfgContainer
[2020-08-22 17:04:35,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-08-22 17:04:35,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-08-22 17:04:35,326 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-08-22 17:04:35,330 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-08-22 17:04:35,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 05:04:34" (1/3) ...
[2020-08-22 17:04:35,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c64973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:04:35, skipping insertion in model container
[2020-08-22 17:04:35,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:04:34" (2/3) ...
[2020-08-22 17:04:35,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c64973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:04:35, skipping insertion in model container
[2020-08-22 17:04:35,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:04:35" (3/3) ...
[2020-08-22 17:04:35,334 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c
[2020-08-22 17:04:35,345 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-08-22 17:04:35,353 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-08-22 17:04:35,368 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-08-22 17:04:35,396 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-08-22 17:04:35,396 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-08-22 17:04:35,397 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-08-22 17:04:35,397 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-08-22 17:04:35,397 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-08-22 17:04:35,397 INFO L380 AbstractCegarLoop]: Difference is false
[2020-08-22 17:04:35,398 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-08-22 17:04:35,398 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-08-22 17:04:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states.
[2020-08-22 17:04:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-08-22 17:04:35,435 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:35,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:35,437 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:35,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1996614335, now seen corresponding path program 1 times
[2020-08-22 17:04:35,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:35,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991386572]
[2020-08-22 17:04:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:35,889 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 43
[2020-08-22 17:04:35,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:35,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:35,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:35,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:36,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:36,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:36,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:36,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:36,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:36,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:36,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:36,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991386572]
[2020-08-22 17:04:36,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:36,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-08-22 17:04:36,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351214033]
[2020-08-22 17:04:36,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-08-22 17:04:36,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:36,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-08-22 17:04:36,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-08-22 17:04:36,194 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 8 states.
[2020-08-22 17:04:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:37,757 INFO L93 Difference]: Finished difference Result 412 states and 626 transitions.
[2020-08-22 17:04:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2020-08-22 17:04:37,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90
[2020-08-22 17:04:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:37,790 INFO L225 Difference]: With dead ends: 412
[2020-08-22 17:04:37,791 INFO L226 Difference]: Without dead ends: 247
[2020-08-22 17:04:37,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210
[2020-08-22 17:04:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states.
[2020-08-22 17:04:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160.
[2020-08-22 17:04:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states.
[2020-08-22 17:04:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 212 transitions.
[2020-08-22 17:04:37,881 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 212 transitions. Word has length 90
[2020-08-22 17:04:37,881 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:37,881 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 212 transitions.
[2020-08-22 17:04:37,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-08-22 17:04:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions.
[2020-08-22 17:04:37,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-08-22 17:04:37,889 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:37,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:37,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-08-22 17:04:37,893 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash -387310403, now seen corresponding path program 1 times
[2020-08-22 17:04:37,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:37,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264586256]
[2020-08-22 17:04:37,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:38,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264586256]
[2020-08-22 17:04:38,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:38,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-08-22 17:04:38,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325455383]
[2020-08-22 17:04:38,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-08-22 17:04:38,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:38,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-08-22 17:04:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2020-08-22 17:04:38,186 INFO L87 Difference]: Start difference. First operand 160 states and 212 transitions. Second operand 9 states.
[2020-08-22 17:04:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:40,467 INFO L93 Difference]: Finished difference Result 579 states and 839 transitions.
[2020-08-22 17:04:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2020-08-22 17:04:40,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90
[2020-08-22 17:04:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:40,477 INFO L225 Difference]: With dead ends: 579
[2020-08-22 17:04:40,478 INFO L226 Difference]: Without dead ends: 439
[2020-08-22 17:04:40,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306
[2020-08-22 17:04:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states.
[2020-08-22 17:04:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 294.
[2020-08-22 17:04:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states.
[2020-08-22 17:04:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 393 transitions.
[2020-08-22 17:04:40,560 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 393 transitions. Word has length 90
[2020-08-22 17:04:40,560 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:40,560 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 393 transitions.
[2020-08-22 17:04:40,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-08-22 17:04:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 393 transitions.
[2020-08-22 17:04:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-08-22 17:04:40,570 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:40,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:40,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-08-22 17:04:40,571 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1952833149, now seen corresponding path program 1 times
[2020-08-22 17:04:40,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:40,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421048271]
[2020-08-22 17:04:40,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:40,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421048271]
[2020-08-22 17:04:40,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:40,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-08-22 17:04:40,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646208810]
[2020-08-22 17:04:40,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-08-22 17:04:40,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:40,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-08-22 17:04:40,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2020-08-22 17:04:40,794 INFO L87 Difference]: Start difference. First operand 294 states and 393 transitions. Second operand 10 states.
[2020-08-22 17:04:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:42,088 INFO L93 Difference]: Finished difference Result 704 states and 993 transitions.
[2020-08-22 17:04:42,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2020-08-22 17:04:42,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90
[2020-08-22 17:04:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:42,094 INFO L225 Difference]: With dead ends: 704
[2020-08-22 17:04:42,094 INFO L226 Difference]: Without dead ends: 430
[2020-08-22 17:04:42,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2020-08-22 17:04:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2020-08-22 17:04:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 294.
[2020-08-22 17:04:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states.
[2020-08-22 17:04:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 386 transitions.
[2020-08-22 17:04:42,153 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 386 transitions. Word has length 90
[2020-08-22 17:04:42,156 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:42,157 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 386 transitions.
[2020-08-22 17:04:42,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-08-22 17:04:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 386 transitions.
[2020-08-22 17:04:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-08-22 17:04:42,160 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:42,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:42,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-08-22 17:04:42,161 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash 227206333, now seen corresponding path program 1 times
[2020-08-22 17:04:42,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:42,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910175035]
[2020-08-22 17:04:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:42,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910175035]
[2020-08-22 17:04:42,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:42,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-08-22 17:04:42,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93113242]
[2020-08-22 17:04:42,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-08-22 17:04:42,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:42,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-08-22 17:04:42,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2020-08-22 17:04:42,516 INFO L87 Difference]: Start difference. First operand 294 states and 386 transitions. Second operand 10 states.
[2020-08-22 17:04:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:43,825 INFO L93 Difference]: Finished difference Result 700 states and 971 transitions.
[2020-08-22 17:04:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2020-08-22 17:04:43,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90
[2020-08-22 17:04:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:43,829 INFO L225 Difference]: With dead ends: 700
[2020-08-22 17:04:43,830 INFO L226 Difference]: Without dead ends: 426
[2020-08-22 17:04:43,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210
[2020-08-22 17:04:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states.
[2020-08-22 17:04:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 294.
[2020-08-22 17:04:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states.
[2020-08-22 17:04:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 379 transitions.
[2020-08-22 17:04:43,866 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 379 transitions. Word has length 90
[2020-08-22 17:04:43,866 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:43,867 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 379 transitions.
[2020-08-22 17:04:43,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-08-22 17:04:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 379 transitions.
[2020-08-22 17:04:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-08-22 17:04:43,868 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:43,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:43,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-08-22 17:04:43,869 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:43,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:43,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1418466941, now seen corresponding path program 1 times
[2020-08-22 17:04:43,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:43,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351523251]
[2020-08-22 17:04:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:43,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:43,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:43,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:43,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:43,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:44,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:44,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:44,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:44,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:44,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:44,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:44,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351523251]
[2020-08-22 17:04:44,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:44,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-08-22 17:04:44,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380772677]
[2020-08-22 17:04:44,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-08-22 17:04:44,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:44,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-08-22 17:04:44,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2020-08-22 17:04:44,033 INFO L87 Difference]: Start difference. First operand 294 states and 379 transitions. Second operand 10 states.
[2020-08-22 17:04:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:45,718 INFO L93 Difference]: Finished difference Result 855 states and 1230 transitions.
[2020-08-22 17:04:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2020-08-22 17:04:45,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90
[2020-08-22 17:04:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:45,725 INFO L225 Difference]: With dead ends: 855
[2020-08-22 17:04:45,726 INFO L226 Difference]: Without dead ends: 581
[2020-08-22 17:04:45,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420
[2020-08-22 17:04:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states.
[2020-08-22 17:04:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 366.
[2020-08-22 17:04:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states.
[2020-08-22 17:04:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 457 transitions.
[2020-08-22 17:04:45,795 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 457 transitions. Word has length 90
[2020-08-22 17:04:45,796 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:45,796 INFO L479 AbstractCegarLoop]: Abstraction has 366 states and 457 transitions.
[2020-08-22 17:04:45,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-08-22 17:04:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 457 transitions.
[2020-08-22 17:04:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-08-22 17:04:45,798 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:45,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:45,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-08-22 17:04:45,799 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:45,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1504622653, now seen corresponding path program 1 times
[2020-08-22 17:04:45,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:45,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683724353]
[2020-08-22 17:04:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:45,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683724353]
[2020-08-22 17:04:45,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:45,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-08-22 17:04:46,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818946329]
[2020-08-22 17:04:46,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-08-22 17:04:46,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:46,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-08-22 17:04:46,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2020-08-22 17:04:46,002 INFO L87 Difference]: Start difference. First operand 366 states and 457 transitions. Second operand 10 states.
[2020-08-22 17:04:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:47,529 INFO L93 Difference]: Finished difference Result 877 states and 1164 transitions.
[2020-08-22 17:04:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2020-08-22 17:04:47,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90
[2020-08-22 17:04:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:47,535 INFO L225 Difference]: With dead ends: 877
[2020-08-22 17:04:47,536 INFO L226 Difference]: Without dead ends: 532
[2020-08-22 17:04:47,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306
[2020-08-22 17:04:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states.
[2020-08-22 17:04:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 376.
[2020-08-22 17:04:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states.
[2020-08-22 17:04:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 465 transitions.
[2020-08-22 17:04:47,590 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 465 transitions. Word has length 90
[2020-08-22 17:04:47,591 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:47,591 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 465 transitions.
[2020-08-22 17:04:47,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-08-22 17:04:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 465 transitions.
[2020-08-22 17:04:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-08-22 17:04:47,592 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:47,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:47,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-08-22 17:04:47,593 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash -523963457, now seen corresponding path program 1 times
[2020-08-22 17:04:47,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:47,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515680366]
[2020-08-22 17:04:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:47,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515680366]
[2020-08-22 17:04:47,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:47,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-08-22 17:04:47,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768071483]
[2020-08-22 17:04:47,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-08-22 17:04:47,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:47,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-08-22 17:04:47,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2020-08-22 17:04:47,784 INFO L87 Difference]: Start difference. First operand 376 states and 465 transitions. Second operand 10 states.
[2020-08-22 17:04:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:49,611 INFO L93 Difference]: Finished difference Result 915 states and 1208 transitions.
[2020-08-22 17:04:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2020-08-22 17:04:49,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90
[2020-08-22 17:04:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:49,618 INFO L225 Difference]: With dead ends: 915
[2020-08-22 17:04:49,618 INFO L226 Difference]: Without dead ends: 560
[2020-08-22 17:04:49,622 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342
[2020-08-22 17:04:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states.
[2020-08-22 17:04:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 396.
[2020-08-22 17:04:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states.
[2020-08-22 17:04:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 485 transitions.
[2020-08-22 17:04:49,691 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 485 transitions. Word has length 90
[2020-08-22 17:04:49,692 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:49,692 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 485 transitions.
[2020-08-22 17:04:49,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-08-22 17:04:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 485 transitions.
[2020-08-22 17:04:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-08-22 17:04:49,695 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:49,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:49,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-08-22 17:04:49,696 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash -275816963, now seen corresponding path program 1 times
[2020-08-22 17:04:49,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:49,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817108804]
[2020-08-22 17:04:49,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:49,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817108804]
[2020-08-22 17:04:49,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:49,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-08-22 17:04:49,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698525457]
[2020-08-22 17:04:49,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-08-22 17:04:49,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-08-22 17:04:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2020-08-22 17:04:49,974 INFO L87 Difference]: Start difference. First operand 396 states and 485 transitions. Second operand 10 states.
[2020-08-22 17:04:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:51,662 INFO L93 Difference]: Finished difference Result 939 states and 1222 transitions.
[2020-08-22 17:04:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2020-08-22 17:04:51,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90
[2020-08-22 17:04:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:51,670 INFO L225 Difference]: With dead ends: 939
[2020-08-22 17:04:51,670 INFO L226 Difference]: Without dead ends: 564
[2020-08-22 17:04:51,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342
[2020-08-22 17:04:51,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states.
[2020-08-22 17:04:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 406.
[2020-08-22 17:04:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states.
[2020-08-22 17:04:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 493 transitions.
[2020-08-22 17:04:51,716 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 493 transitions. Word has length 90
[2020-08-22 17:04:51,718 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:51,718 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 493 transitions.
[2020-08-22 17:04:51,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-08-22 17:04:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 493 transitions.
[2020-08-22 17:04:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-08-22 17:04:51,720 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:51,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:51,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-08-22 17:04:51,720 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:51,721 INFO L82 PathProgramCache]: Analyzing trace with hash -348203521, now seen corresponding path program 1 times
[2020-08-22 17:04:51,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:51,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622696994]
[2020-08-22 17:04:51,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:51,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622696994]
[2020-08-22 17:04:51,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:51,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-08-22 17:04:51,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474598910]
[2020-08-22 17:04:51,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-08-22 17:04:51,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:51,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-08-22 17:04:51,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2020-08-22 17:04:51,915 INFO L87 Difference]: Start difference. First operand 406 states and 493 transitions. Second operand 10 states.
[2020-08-22 17:04:53,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:53,764 INFO L93 Difference]: Finished difference Result 1144 states and 1493 transitions.
[2020-08-22 17:04:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2020-08-22 17:04:53,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90
[2020-08-22 17:04:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:53,770 INFO L225 Difference]: With dead ends: 1144
[2020-08-22 17:04:53,770 INFO L226 Difference]: Without dead ends: 758
[2020-08-22 17:04:53,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600
[2020-08-22 17:04:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states.
[2020-08-22 17:04:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 467.
[2020-08-22 17:04:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states.
[2020-08-22 17:04:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 547 transitions.
[2020-08-22 17:04:53,823 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 547 transitions. Word has length 90
[2020-08-22 17:04:53,823 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:53,823 INFO L479 AbstractCegarLoop]: Abstraction has 467 states and 547 transitions.
[2020-08-22 17:04:53,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-08-22 17:04:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 547 transitions.
[2020-08-22 17:04:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-08-22 17:04:53,825 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:53,825 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:53,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-08-22 17:04:53,825 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:53,826 INFO L82 PathProgramCache]: Analyzing trace with hash -286163907, now seen corresponding path program 1 times
[2020-08-22 17:04:53,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:53,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538901107]
[2020-08-22 17:04:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:53,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538901107]
[2020-08-22 17:04:53,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:53,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-08-22 17:04:53,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340556537]
[2020-08-22 17:04:53,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-08-22 17:04:53,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-08-22 17:04:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-08-22 17:04:53,945 INFO L87 Difference]: Start difference. First operand 467 states and 547 transitions. Second operand 7 states.
[2020-08-22 17:04:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:55,627 INFO L93 Difference]: Finished difference Result 1503 states and 1877 transitions.
[2020-08-22 17:04:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2020-08-22 17:04:55,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90
[2020-08-22 17:04:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:55,635 INFO L225 Difference]: With dead ends: 1503
[2020-08-22 17:04:55,636 INFO L226 Difference]: Without dead ends: 1058
[2020-08-22 17:04:55,638 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182
[2020-08-22 17:04:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states.
[2020-08-22 17:04:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 847.
[2020-08-22 17:04:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states.
[2020-08-22 17:04:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1018 transitions.
[2020-08-22 17:04:55,721 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1018 transitions. Word has length 90
[2020-08-22 17:04:55,721 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:55,721 INFO L479 AbstractCegarLoop]: Abstraction has 847 states and 1018 transitions.
[2020-08-22 17:04:55,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-08-22 17:04:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1018 transitions.
[2020-08-22 17:04:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2020-08-22 17:04:55,723 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:55,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:55,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-08-22 17:04:55,724 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1417763379, now seen corresponding path program 1 times
[2020-08-22 17:04:55,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:55,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258812854]
[2020-08-22 17:04:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-08-22 17:04:55,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258812854]
[2020-08-22 17:04:55,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:55,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-08-22 17:04:55,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641270919]
[2020-08-22 17:04:55,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-08-22 17:04:55,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-08-22 17:04:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-08-22 17:04:55,878 INFO L87 Difference]: Start difference. First operand 847 states and 1018 transitions. Second operand 7 states.
[2020-08-22 17:04:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:57,544 INFO L93 Difference]: Finished difference Result 2813 states and 3701 transitions.
[2020-08-22 17:04:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2020-08-22 17:04:57,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91
[2020-08-22 17:04:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:57,557 INFO L225 Difference]: With dead ends: 2813
[2020-08-22 17:04:57,557 INFO L226 Difference]: Without dead ends: 1993
[2020-08-22 17:04:57,561 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182
[2020-08-22 17:04:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states.
[2020-08-22 17:04:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1710.
[2020-08-22 17:04:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states.
[2020-08-22 17:04:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2141 transitions.
[2020-08-22 17:04:57,751 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2141 transitions. Word has length 91
[2020-08-22 17:04:57,751 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:57,752 INFO L479 AbstractCegarLoop]: Abstraction has 1710 states and 2141 transitions.
[2020-08-22 17:04:57,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-08-22 17:04:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2141 transitions.
[2020-08-22 17:04:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2020-08-22 17:04:57,754 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:57,755 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:57,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-08-22 17:04:57,755 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:57,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1387972843, now seen corresponding path program 1 times
[2020-08-22 17:04:57,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:57,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635572192]
[2020-08-22 17:04:57,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2020-08-22 17:04:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2020-08-22 17:04:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2020-08-22 17:04:57,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635572192]
[2020-08-22 17:04:57,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:57,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-08-22 17:04:57,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463291702]
[2020-08-22 17:04:57,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-08-22 17:04:57,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:57,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-08-22 17:04:57,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2020-08-22 17:04:57,938 INFO L87 Difference]: Start difference. First operand 1710 states and 2141 transitions. Second operand 9 states.
[2020-08-22 17:04:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:04:59,362 INFO L93 Difference]: Finished difference Result 3845 states and 5084 transitions.
[2020-08-22 17:04:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2020-08-22 17:04:59,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111
[2020-08-22 17:04:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:04:59,378 INFO L225 Difference]: With dead ends: 3845
[2020-08-22 17:04:59,378 INFO L226 Difference]: Without dead ends: 2157
[2020-08-22 17:04:59,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272
[2020-08-22 17:04:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states.
[2020-08-22 17:04:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1767.
[2020-08-22 17:04:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states.
[2020-08-22 17:04:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2232 transitions.
[2020-08-22 17:04:59,588 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2232 transitions. Word has length 111
[2020-08-22 17:04:59,588 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:04:59,588 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 2232 transitions.
[2020-08-22 17:04:59,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-08-22 17:04:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2232 transitions.
[2020-08-22 17:04:59,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2020-08-22 17:04:59,590 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:04:59,590 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:04:59,591 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-08-22 17:04:59,591 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:04:59,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:04:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash 36587625, now seen corresponding path program 1 times
[2020-08-22 17:04:59,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:04:59,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155022872]
[2020-08-22 17:04:59,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:04:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:04:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:04:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:04:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:04:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:04:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:04:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:04:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:04:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:04:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:04:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:04:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2020-08-22 17:04:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2020-08-22 17:04:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:04:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2020-08-22 17:04:59,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155022872]
[2020-08-22 17:04:59,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:04:59,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-08-22 17:04:59,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929912376]
[2020-08-22 17:04:59,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-08-22 17:04:59,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:04:59,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-08-22 17:04:59,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-08-22 17:04:59,747 INFO L87 Difference]: Start difference. First operand 1767 states and 2232 transitions. Second operand 8 states.
[2020-08-22 17:05:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:05:01,977 INFO L93 Difference]: Finished difference Result 5835 states and 7942 transitions.
[2020-08-22 17:05:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2020-08-22 17:05:01,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111
[2020-08-22 17:05:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:05:01,997 INFO L225 Difference]: With dead ends: 5835
[2020-08-22 17:05:01,998 INFO L226 Difference]: Without dead ends: 3120
[2020-08-22 17:05:02,013 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342
[2020-08-22 17:05:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states.
[2020-08-22 17:05:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2788.
[2020-08-22 17:05:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states.
[2020-08-22 17:05:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3646 transitions.
[2020-08-22 17:05:02,377 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3646 transitions. Word has length 111
[2020-08-22 17:05:02,378 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:05:02,378 INFO L479 AbstractCegarLoop]: Abstraction has 2788 states and 3646 transitions.
[2020-08-22 17:05:02,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-08-22 17:05:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3646 transitions.
[2020-08-22 17:05:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2020-08-22 17:05:02,383 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:05:02,383 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:05:02,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-08-22 17:05:02,384 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:05:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:05:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1178118941, now seen corresponding path program 1 times
[2020-08-22 17:05:02,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:05:02,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955210349]
[2020-08-22 17:05:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:05:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:05:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:05:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:05:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:05:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:05:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:05:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:05:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:05:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:05:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:05:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:05:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2020-08-22 17:05:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2020-08-22 17:05:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105
[2020-08-22 17:05:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2020-08-22 17:05:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:05:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:05:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:05:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:05:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2020-08-22 17:05:02,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955210349]
[2020-08-22 17:05:02,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:05:02,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-08-22 17:05:02,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364110398]
[2020-08-22 17:05:02,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-08-22 17:05:02,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:05:02,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-08-22 17:05:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2020-08-22 17:05:02,587 INFO L87 Difference]: Start difference. First operand 2788 states and 3646 transitions. Second operand 9 states.
[2020-08-22 17:05:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:05:05,087 INFO L93 Difference]: Finished difference Result 8089 states and 11637 transitions.
[2020-08-22 17:05:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2020-08-22 17:05:05,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155
[2020-08-22 17:05:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:05:05,127 INFO L225 Difference]: With dead ends: 8089
[2020-08-22 17:05:05,127 INFO L226 Difference]: Without dead ends: 5323
[2020-08-22 17:05:05,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420
[2020-08-22 17:05:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states.
[2020-08-22 17:05:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 4852.
[2020-08-22 17:05:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states.
[2020-08-22 17:05:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6633 transitions.
[2020-08-22 17:05:05,746 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6633 transitions. Word has length 155
[2020-08-22 17:05:05,746 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:05:05,746 INFO L479 AbstractCegarLoop]: Abstraction has 4852 states and 6633 transitions.
[2020-08-22 17:05:05,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-08-22 17:05:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6633 transitions.
[2020-08-22 17:05:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2020-08-22 17:05:05,752 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:05:05,752 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:05:05,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-08-22 17:05:05,753 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:05:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:05:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash -390866386, now seen corresponding path program 1 times
[2020-08-22 17:05:05,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:05:05,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988206184]
[2020-08-22 17:05:05,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:05:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:05:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:05:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:05:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:05:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:05:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:05:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:05:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:05:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:05:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:05:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:05:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2020-08-22 17:05:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94
[2020-08-22 17:05:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106
[2020-08-22 17:05:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:05,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2020-08-22 17:05:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:06,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:05:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:06,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:05:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:06,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:05:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:06,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:05:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked.
[2020-08-22 17:05:06,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988206184]
[2020-08-22 17:05:06,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:05:06,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-08-22 17:05:06,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463786052]
[2020-08-22 17:05:06,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-08-22 17:05:06,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:05:06,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-08-22 17:05:06,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2020-08-22 17:05:06,184 INFO L87 Difference]: Start difference. First operand 4852 states and 6633 transitions. Second operand 10 states.
[2020-08-22 17:05:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:05:09,926 INFO L93 Difference]: Finished difference Result 12975 states and 19533 transitions.
[2020-08-22 17:05:09,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2020-08-22 17:05:09,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156
[2020-08-22 17:05:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:05:10,005 INFO L225 Difference]: With dead ends: 12975
[2020-08-22 17:05:10,006 INFO L226 Difference]: Without dead ends: 6726
[2020-08-22 17:05:10,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552
[2020-08-22 17:05:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states.
[2020-08-22 17:05:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6726 to 6174.
[2020-08-22 17:05:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6174 states.
[2020-08-22 17:05:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 8297 transitions.
[2020-08-22 17:05:10,888 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 8297 transitions. Word has length 156
[2020-08-22 17:05:10,888 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:05:10,888 INFO L479 AbstractCegarLoop]: Abstraction has 6174 states and 8297 transitions.
[2020-08-22 17:05:10,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-08-22 17:05:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 8297 transitions.
[2020-08-22 17:05:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208
[2020-08-22 17:05:10,898 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:05:10,899 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-08-22 17:05:10,899 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-08-22 17:05:10,899 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:05:10,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:05:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1382123670, now seen corresponding path program 1 times
[2020-08-22 17:05:10,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:05:10,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741876884]
[2020-08-22 17:05:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:05:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:10,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:05:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:10,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-08-22 17:05:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:10,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2020-08-22 17:05:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2020-08-22 17:05:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-08-22 17:05:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-08-22 17:05:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:05:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:05:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:05:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2020-08-22 17:05:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2020-08-22 17:05:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2020-08-22 17:05:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2020-08-22 17:05:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100
[2020-08-22 17:05:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2020-08-22 17:05:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2020-08-22 17:05:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:05:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:05:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:05:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2020-08-22 17:05:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156
[2020-08-22 17:05:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2020-08-22 17:05:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-08-22 17:05:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-08-22 17:05:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2020-08-22 17:05:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2020-08-22 17:05:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-08-22 17:05:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked.
[2020-08-22 17:05:11,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741876884]
[2020-08-22 17:05:11,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-08-22 17:05:11,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-08-22 17:05:11,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865037652]
[2020-08-22 17:05:11,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-08-22 17:05:11,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-08-22 17:05:11,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-08-22 17:05:11,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2020-08-22 17:05:11,242 INFO L87 Difference]: Start difference. First operand 6174 states and 8297 transitions. Second operand 11 states.
[2020-08-22 17:05:11,896 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 32
[2020-08-22 17:05:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-08-22 17:05:14,151 INFO L93 Difference]: Finished difference Result 12270 states and 16979 transitions.
[2020-08-22 17:05:14,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2020-08-22 17:05:14,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207
[2020-08-22 17:05:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-08-22 17:05:14,167 INFO L225 Difference]: With dead ends: 12270
[2020-08-22 17:05:14,167 INFO L226 Difference]: Without dead ends: 3143
[2020-08-22 17:05:14,190 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650
[2020-08-22 17:05:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states.
[2020-08-22 17:05:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 2950.
[2020-08-22 17:05:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2950 states.
[2020-08-22 17:05:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3443 transitions.
[2020-08-22 17:05:14,462 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3443 transitions. Word has length 207
[2020-08-22 17:05:14,463 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-08-22 17:05:14,463 INFO L479 AbstractCegarLoop]: Abstraction has 2950 states and 3443 transitions.
[2020-08-22 17:05:14,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-08-22 17:05:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3443 transitions.
[2020-08-22 17:05:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2020-08-22 17:05:14,468 INFO L414 BasicCegarLoop]: Found error trace
[2020-08-22 17:05:14,469 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, 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, 1, 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-08-22 17:05:14,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-08-22 17:05:14,469 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-08-22 17:05:14,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-08-22 17:05:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash 89354437, now seen corresponding path program 1 times
[2020-08-22 17:05:14,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-08-22 17:05:14,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888007409]
[2020-08-22 17:05:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-08-22 17:05:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-08-22 17:05:14,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-08-22 17:05:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-08-22 17:05:14,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-08-22 17:05:14,663 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-08-22 17:05:14,663 INFO L520 BasicCegarLoop]: Counterexample might be feasible
[2020-08-22 17:05:14,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-08-22 17:05:14,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 05:05:14 BoogieIcfgContainer
[2020-08-22 17:05:14,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-08-22 17:05:14,849 INFO L168 Benchmark]: Toolchain (without parser) took 40766.12 ms. Allocated memory was 140.0 MB in the beginning and 717.2 MB in the end (delta: 577.2 MB). Free memory was 101.8 MB in the beginning and 285.7 MB in the end (delta: -183.8 MB). Peak memory consumption was 393.4 MB. Max. memory is 7.1 GB.
[2020-08-22 17:05:14,849 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-08-22 17:05:14,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 532.43 ms. Allocated memory was 140.0 MB in the beginning and 201.9 MB in the end (delta: 61.9 MB). Free memory was 101.6 MB in the beginning and 177.8 MB in the end (delta: -76.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB.
[2020-08-22 17:05:14,851 INFO L168 Benchmark]: Boogie Preprocessor took 52.04 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 175.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB.
[2020-08-22 17:05:14,851 INFO L168 Benchmark]: RCFGBuilder took 655.67 ms. Allocated memory is still 201.9 MB. Free memory was 175.6 MB in the beginning and 139.0 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB.
[2020-08-22 17:05:14,852 INFO L168 Benchmark]: TraceAbstraction took 39520.57 ms. Allocated memory was 201.9 MB in the beginning and 717.2 MB in the end (delta: 515.4 MB). Free memory was 139.0 MB in the beginning and 285.7 MB in the end (delta: -146.7 MB). Peak memory consumption was 368.7 MB. Max. memory is 7.1 GB.
[2020-08-22 17:05:14,855 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.25 ms. Allocated memory is still 140.0 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 532.43 ms. Allocated memory was 140.0 MB in the beginning and 201.9 MB in the end (delta: 61.9 MB). Free memory was 101.6 MB in the beginning and 177.8 MB in the end (delta: -76.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 52.04 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 175.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 655.67 ms. Allocated memory is still 201.9 MB. Free memory was 175.6 MB in the beginning and 139.0 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 39520.57 ms. Allocated memory was 201.9 MB in the beginning and 717.2 MB in the end (delta: 515.4 MB). Free memory was 139.0 MB in the beginning and 285.7 MB in the end (delta: -146.7 MB). Peak memory consumption was 368.7 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L15] int m_pc = 0;
[L16] int t1_pc = 0;
[L17] int t2_pc = 0;
[L18] int m_st ;
[L19] int t1_st ;
[L20] int t2_st ;
[L21] int m_i ;
[L22] int t1_i ;
[L23] int t2_i ;
[L24] int M_E = 2;
[L25] int T1_E = 2;
[L26] int T2_E = 2;
[L27] int E_1 = 2;
[L28] int E_2 = 2;
VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0]
[L563] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0]
[L567] CALL init_model()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0]
[L477] m_i = 1
[L478] t1_i = 1
[L479] t2_i = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L567] RET init_model()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L568] CALL start_simulation()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L504] int kernel_st ;
[L505] int tmp ;
[L506] int tmp___0 ;
[L510] kernel_st = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L511] FCALL update_channels()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L512] CALL init_threads()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L211] COND TRUE m_i == 1
[L212] m_st = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L216] COND TRUE t1_i == 1
[L217] t1_st = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L221] COND TRUE t2_i == 1
[L222] t2_st = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L512] RET init_threads()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L513] CALL fire_delta_events()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L324] COND FALSE !(M_E == 0)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L329] COND FALSE !(T1_E == 0)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L334] COND FALSE !(T2_E == 0)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L339] COND FALSE !(E_1 == 0)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L344] COND FALSE !(E_2 == 0)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L513] RET fire_delta_events()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L514] CALL activate_threads()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L387] int tmp ;
[L388] int tmp___0 ;
[L389] int tmp___1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L393] CALL, EXPR is_master_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L143] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L146] COND FALSE !(m_pc == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L156] __retres1 = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L158] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L393] RET, EXPR is_master_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L393] tmp = is_master_triggered()
[L395] COND FALSE !(\read(tmp))
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0]
[L401] CALL, EXPR is_transmit1_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L162] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L165] COND FALSE !(t1_pc == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L175] __retres1 = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L177] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L401] RET, EXPR is_transmit1_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0]
[L401] tmp___0 = is_transmit1_triggered()
[L403] COND FALSE !(\read(tmp___0))
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0]
[L409] CALL, EXPR is_transmit2_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L181] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L184] COND FALSE !(t2_pc == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L194] __retres1 = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L196] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L409] RET, EXPR is_transmit2_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit2_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0]
[L409] tmp___1 = is_transmit2_triggered()
[L411] COND FALSE !(\read(tmp___1))
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0]
[L514] RET activate_threads()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L515] CALL reset_delta_events()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L357] COND FALSE !(M_E == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L362] COND FALSE !(T1_E == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L367] COND FALSE !(T2_E == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L372] COND FALSE !(E_1 == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L377] COND FALSE !(E_2 == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L515] RET reset_delta_events()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L518] COND TRUE 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L521] kernel_st = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L522] CALL eval()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L257] int tmp ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L261] COND TRUE 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L264] CALL, EXPR exists_runnable_thread()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L231] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L234] COND TRUE m_st == 0
[L235] __retres1 = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L252] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L264] RET, EXPR exists_runnable_thread()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L264] tmp = exists_runnable_thread()
[L266] COND TRUE \read(tmp)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1]
[L271] COND TRUE m_st == 0
[L272] int tmp_ndt_1;
[L273] tmp_ndt_1 = __VERIFIER_nondet_int()
[L274] COND FALSE !(\read(tmp_ndt_1))
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0]
[L285] COND TRUE t1_st == 0
[L286] int tmp_ndt_2;
[L287] tmp_ndt_2 = __VERIFIER_nondet_int()
[L288] COND TRUE \read(tmp_ndt_2)
[L290] t1_st = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1]
[L291] CALL transmit1()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L78] COND TRUE t1_pc == 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L89] COND TRUE 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L91] t1_pc = 1
[L92] t1_st = 2
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0]
[L291] RET transmit1()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1]
[L299] COND TRUE t2_st == 0
[L300] int tmp_ndt_3;
[L301] tmp_ndt_3 = __VERIFIER_nondet_int()
[L302] COND TRUE \read(tmp_ndt_3)
[L304] t2_st = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1]
[L305] CALL transmit2()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1]
[L113] COND TRUE t2_pc == 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1]
[L124] COND TRUE 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1]
[L126] t2_pc = 1
[L127] t2_st = 2
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L305] RET transmit2()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1]
[L261] COND TRUE 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1]
[L264] CALL, EXPR exists_runnable_thread()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L231] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L234] COND TRUE m_st == 0
[L235] __retres1 = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L252] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L264] RET, EXPR exists_runnable_thread()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1]
[L264] tmp = exists_runnable_thread()
[L266] COND TRUE \read(tmp)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=1]
[L271] COND TRUE m_st == 0
[L272] int tmp_ndt_1;
[L273] tmp_ndt_1 = __VERIFIER_nondet_int()
[L274] COND TRUE \read(tmp_ndt_1)
[L276] m_st = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-1, tmp_ndt_3=1]
[L277] CALL master()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L37] COND TRUE m_pc == 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L48] COND TRUE 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L51] E_1 = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L52] CALL immediate_notify()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L425] CALL activate_threads()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L387] int tmp ;
[L388] int tmp___0 ;
[L389] int tmp___1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L393] CALL, EXPR is_master_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L143] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L146] COND FALSE !(m_pc == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L156] __retres1 = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L158] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L393] RET, EXPR is_master_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L393] tmp = is_master_triggered()
[L395] COND FALSE !(\read(tmp))
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0]
[L401] CALL, EXPR is_transmit1_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L162] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L165] COND TRUE t1_pc == 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L166] COND TRUE E_1 == 1
[L167] __retres1 = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L177] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L401] RET, EXPR is_transmit1_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0]
[L401] tmp___0 = is_transmit1_triggered()
[L403] COND TRUE \read(tmp___0)
[L404] t1_st = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1]
[L409] CALL, EXPR is_transmit2_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L181] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L184] COND TRUE t2_pc == 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L185] COND FALSE !(E_2 == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L194] __retres1 = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L196] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L409] RET, EXPR is_transmit2_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_transmit2_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1]
[L409] tmp___1 = is_transmit2_triggered()
[L411] COND FALSE !(\read(tmp___1))
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0]
[L425] RET activate_threads()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L52] RET immediate_notify()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L53] E_1 = 2
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L56] COND TRUE 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L58] m_pc = 1
[L59] m_st = 2
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L277] RET master()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-1, tmp_ndt_3=1]
[L285] COND TRUE t1_st == 0
[L286] int tmp_ndt_2;
[L287] tmp_ndt_2 = __VERIFIER_nondet_int()
[L288] COND TRUE \read(tmp_ndt_2)
[L290] t1_st = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, tmp_ndt_3=1]
[L291] CALL transmit1()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L78] COND FALSE !(t1_pc == 0)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L81] COND TRUE t1_pc == 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L97] E_2 = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L98] CALL immediate_notify()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L425] CALL activate_threads()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L387] int tmp ;
[L388] int tmp___0 ;
[L389] int tmp___1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L393] CALL, EXPR is_master_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L143] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L146] COND TRUE m_pc == 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L147] COND FALSE !(M_E == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L156] __retres1 = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L158] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L393] RET, EXPR is_master_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L393] tmp = is_master_triggered()
[L395] COND FALSE !(\read(tmp))
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0]
[L401] CALL, EXPR is_transmit1_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L162] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L165] COND TRUE t1_pc == 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L166] COND FALSE !(E_1 == 1)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L175] __retres1 = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L177] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L401] RET, EXPR is_transmit1_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0]
[L401] tmp___0 = is_transmit1_triggered()
[L403] COND FALSE !(\read(tmp___0))
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0]
[L409] CALL, EXPR is_transmit2_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L181] int __retres1 ;
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L184] COND TRUE t2_pc == 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L185] COND TRUE E_2 == 1
[L186] __retres1 = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L196] return (__retres1);
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2]
[L409] RET, EXPR is_transmit2_triggered()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_transmit2_triggered()=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0]
[L409] tmp___1 = is_transmit2_triggered()
[L411] COND TRUE \read(tmp___1)
[L412] t2_st = 0
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1]
[L425] RET activate_threads()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0]
[L98] RET immediate_notify()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0]
[L99] E_2 = 2
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0]
[L89] COND TRUE 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0]
[L91] t1_pc = 1
[L92] t1_st = 2
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0]
[L291] RET transmit1()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, tmp_ndt_3=1]
[L299] COND TRUE t2_st == 0
[L300] int tmp_ndt_3;
[L301] tmp_ndt_3 = __VERIFIER_nondet_int()
[L302] COND TRUE \read(tmp_ndt_3)
[L304] t2_st = 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, tmp_ndt_3=1]
[L305] CALL transmit2()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1]
[L113] COND FALSE !(t2_pc == 0)
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1]
[L116] COND TRUE t2_pc == 1
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1]
[L132] CALL error()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1]
[L11] __VERIFIER_error()
VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 23 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 39.2s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2606 SDtfs, 11528 SDslu, 735 SDs, 0 SdLazy, 15843 SolverSat, 5833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 756 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6174occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 3916 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1939 NumberOfCodeBlocks, 1939 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1715 ConstructedInterpolants, 0 QuantifiedInterpolants, 487945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 237/237 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 incorrect!
Received shutdown request...