/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -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-d623d84 [2020-07-21 12:15:53,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 12:15:53,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 12:15:53,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 12:15:53,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 12:15:53,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 12:15:53,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 12:15:53,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 12:15:53,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 12:15:53,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 12:15:53,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 12:15:53,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 12:15:53,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 12:15:53,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 12:15:53,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 12:15:53,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 12:15:53,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 12:15:53,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 12:15:53,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 12:15:53,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 12:15:53,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 12:15:53,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 12:15:53,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 12:15:53,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 12:15:53,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 12:15:53,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 12:15:53,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 12:15:53,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 12:15:53,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 12:15:53,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 12:15:53,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 12:15:53,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 12:15:53,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 12:15:53,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 12:15:53,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 12:15:53,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 12:15:53,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 12:15:53,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 12:15:53,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 12:15:53,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 12:15:53,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 12:15:53,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 12:15:53,820 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 12:15:53,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 12:15:53,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 12:15:53,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 12:15:53,822 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 12:15:53,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 12:15:53,822 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 12:15:53,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 12:15:53,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 12:15:53,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 12:15:53,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 12:15:53,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 12:15:53,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 12:15:53,825 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 12:15:53,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 12:15:53,825 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 12:15:53,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 12:15:53,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 12:15:53,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 12:15:53,826 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 12:15:53,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 12:15:53,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 12:15:53,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 12:15:53,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 12:15:53,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 12:15:53,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 12:15:53,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:53,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 12:15:53,828 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 12:15:53,828 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-21 12:15:54,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 12:15:54,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 12:15:54,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 12:15:54,137 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 12:15:54,137 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 12:15:54,138 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-07-21 12:15:54,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eaaf08fa/856ad62e5e5041eb93f621a2144d1c75/FLAGf2259cbe7 [2020-07-21 12:15:54,688 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 12:15:54,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-07-21 12:15:54,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eaaf08fa/856ad62e5e5041eb93f621a2144d1c75/FLAGf2259cbe7 [2020-07-21 12:15:55,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eaaf08fa/856ad62e5e5041eb93f621a2144d1c75 [2020-07-21 12:15:55,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 12:15:55,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 12:15:55,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 12:15:55,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 12:15:55,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 12:15:55,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:15:55" (1/1) ... [2020-07-21 12:15:55,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e755a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55, skipping insertion in model container [2020-07-21 12:15:55,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:15:55" (1/1) ... [2020-07-21 12:15:55,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 12:15:55,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 12:15:55,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 12:15:55,349 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 12:15:55,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 12:15:55,519 INFO L208 MainTranslator]: Completed translation [2020-07-21 12:15:55,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55 WrapperNode [2020-07-21 12:15:55,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 12:15:55,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 12:15:55,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 12:15:55,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 12:15:55,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55" (1/1) ... [2020-07-21 12:15:55,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55" (1/1) ... [2020-07-21 12:15:55,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55" (1/1) ... [2020-07-21 12:15:55,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55" (1/1) ... [2020-07-21 12:15:55,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55" (1/1) ... [2020-07-21 12:15:55,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55" (1/1) ... [2020-07-21 12:15:55,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55" (1/1) ... [2020-07-21 12:15:55,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 12:15:55,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 12:15:55,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 12:15:55,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 12:15:55,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 12:15:55,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 12:15:55,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 12:15:55,631 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 12:15:55,631 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-21 12:15:55,631 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-21 12:15:55,631 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-07-21 12:15:55,631 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-21 12:15:55,632 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-21 12:15:55,632 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-07-21 12:15:55,632 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-21 12:15:55,632 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 12:15:55,632 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 12:15:55,632 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 12:15:55,633 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-21 12:15:55,633 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-21 12:15:55,633 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-21 12:15:55,633 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-21 12:15:55,633 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-21 12:15:55,633 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-21 12:15:55,634 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 12:15:55,634 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 12:15:55,634 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 12:15:55,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 12:15:55,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 12:15:55,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 12:15:55,634 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 12:15:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-21 12:15:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-21 12:15:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-07-21 12:15:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-21 12:15:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-21 12:15:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-21 12:15:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-07-21 12:15:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-21 12:15:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 12:15:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 12:15:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 12:15:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-21 12:15:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-21 12:15:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-21 12:15:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-21 12:15:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-21 12:15:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 12:15:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 12:15:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 12:15:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 12:15:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 12:15:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 12:15:56,169 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 12:15:56,169 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-21 12:15:56,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:15:56 BoogieIcfgContainer [2020-07-21 12:15:56,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 12:15:56,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 12:15:56,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 12:15:56,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 12:15:56,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 12:15:55" (1/3) ... [2020-07-21 12:15:56,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397f611a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:15:56, skipping insertion in model container [2020-07-21 12:15:56,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:55" (2/3) ... [2020-07-21 12:15:56,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397f611a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:15:56, skipping insertion in model container [2020-07-21 12:15:56,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:15:56" (3/3) ... [2020-07-21 12:15:56,183 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-07-21 12:15:56,194 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 12:15:56,202 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 12:15:56,216 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 12:15:56,246 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 12:15:56,246 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 12:15:56,247 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 12:15:56,247 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 12:15:56,247 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 12:15:56,247 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 12:15:56,248 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 12:15:56,248 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 12:15:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2020-07-21 12:15:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-21 12:15:56,287 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:56,288 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-07-21 12:15:56,288 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:56,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1996614335, now seen corresponding path program 1 times [2020-07-21 12:15:56,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:56,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2105337761] [2020-07-21 12:15:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:56,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:15:56,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:56,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:56,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2105337761] [2020-07-21 12:15:56,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:56,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:56,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410171032] [2020-07-21 12:15:56,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:56,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:56,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:56,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:56,577 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 3 states. [2020-07-21 12:15:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:56,646 INFO L93 Difference]: Finished difference Result 320 states and 454 transitions. [2020-07-21 12:15:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:56,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-07-21 12:15:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:56,665 INFO L225 Difference]: With dead ends: 320 [2020-07-21 12:15:56,666 INFO L226 Difference]: Without dead ends: 160 [2020-07-21 12:15:56,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-07-21 12:15:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2020-07-21 12:15:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-21 12:15:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 212 transitions. [2020-07-21 12:15:56,766 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 212 transitions. Word has length 90 [2020-07-21 12:15:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:56,768 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 212 transitions. [2020-07-21 12:15:56,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2020-07-21 12:15:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-21 12:15:56,772 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:56,772 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-07-21 12:15:56,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:56,983 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:56,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash -387310403, now seen corresponding path program 1 times [2020-07-21 12:15:56,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:56,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [141671733] [2020-07-21 12:15:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:57,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:15:57,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:57,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:57,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [141671733] [2020-07-21 12:15:57,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:57,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:57,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912425433] [2020-07-21 12:15:57,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:57,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:57,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:57,136 INFO L87 Difference]: Start difference. First operand 160 states and 212 transitions. Second operand 3 states. [2020-07-21 12:15:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:57,207 INFO L93 Difference]: Finished difference Result 432 states and 593 transitions. [2020-07-21 12:15:57,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:57,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-07-21 12:15:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:57,214 INFO L225 Difference]: With dead ends: 432 [2020-07-21 12:15:57,214 INFO L226 Difference]: Without dead ends: 294 [2020-07-21 12:15:57,216 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-07-21 12:15:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 288. [2020-07-21 12:15:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-07-21 12:15:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 396 transitions. [2020-07-21 12:15:57,276 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 396 transitions. Word has length 90 [2020-07-21 12:15:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:57,278 INFO L479 AbstractCegarLoop]: Abstraction has 288 states and 396 transitions. [2020-07-21 12:15:57,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 396 transitions. [2020-07-21 12:15:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-21 12:15:57,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:57,292 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-07-21 12:15:57,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:57,499 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:57,500 INFO L82 PathProgramCache]: Analyzing trace with hash 16326453, now seen corresponding path program 1 times [2020-07-21 12:15:57,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:57,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684094818] [2020-07-21 12:15:57,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:57,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:15:57,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:57,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:57,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684094818] [2020-07-21 12:15:57,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:57,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:57,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617303975] [2020-07-21 12:15:57,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:57,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:57,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:57,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:57,628 INFO L87 Difference]: Start difference. First operand 288 states and 396 transitions. Second operand 3 states. [2020-07-21 12:15:57,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:57,659 INFO L93 Difference]: Finished difference Result 548 states and 754 transitions. [2020-07-21 12:15:57,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:57,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-07-21 12:15:57,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:57,665 INFO L225 Difference]: With dead ends: 548 [2020-07-21 12:15:57,665 INFO L226 Difference]: Without dead ends: 281 [2020-07-21 12:15:57,667 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-07-21 12:15:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2020-07-21 12:15:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-07-21 12:15:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 383 transitions. [2020-07-21 12:15:57,710 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 383 transitions. Word has length 91 [2020-07-21 12:15:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:57,711 INFO L479 AbstractCegarLoop]: Abstraction has 281 states and 383 transitions. [2020-07-21 12:15:57,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 383 transitions. [2020-07-21 12:15:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-21 12:15:57,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:57,713 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-07-21 12:15:57,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:57,921 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:57,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1717777997, now seen corresponding path program 1 times [2020-07-21 12:15:57,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:57,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1964244525] [2020-07-21 12:15:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:58,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 12:15:58,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:58,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:58,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1964244525] [2020-07-21 12:15:58,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:58,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 12:15:58,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307404499] [2020-07-21 12:15:58,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 12:15:58,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:58,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 12:15:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:15:58,114 INFO L87 Difference]: Start difference. First operand 281 states and 383 transitions. Second operand 5 states. [2020-07-21 12:15:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:58,830 INFO L93 Difference]: Finished difference Result 835 states and 1202 transitions. [2020-07-21 12:15:58,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 12:15:58,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-07-21 12:15:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:58,837 INFO L225 Difference]: With dead ends: 835 [2020-07-21 12:15:58,837 INFO L226 Difference]: Without dead ends: 574 [2020-07-21 12:15:58,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-21 12:15:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-07-21 12:15:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 523. [2020-07-21 12:15:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-07-21 12:15:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 714 transitions. [2020-07-21 12:15:58,888 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 714 transitions. Word has length 91 [2020-07-21 12:15:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:58,888 INFO L479 AbstractCegarLoop]: Abstraction has 523 states and 714 transitions. [2020-07-21 12:15:58,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 12:15:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 714 transitions. [2020-07-21 12:15:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-21 12:15:58,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:58,890 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-07-21 12:15:59,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:59,104 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2107195379, now seen corresponding path program 1 times [2020-07-21 12:15:59,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:59,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [977658028] [2020-07-21 12:15:59,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:59,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 12:15:59,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:59,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:59,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [977658028] [2020-07-21 12:15:59,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:59,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 12:15:59,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471983553] [2020-07-21 12:15:59,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 12:15:59,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:59,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 12:15:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:15:59,290 INFO L87 Difference]: Start difference. First operand 523 states and 714 transitions. Second operand 5 states. [2020-07-21 12:15:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:59,653 INFO L93 Difference]: Finished difference Result 1026 states and 1421 transitions. [2020-07-21 12:15:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 12:15:59,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-07-21 12:15:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:59,660 INFO L225 Difference]: With dead ends: 1026 [2020-07-21 12:15:59,661 INFO L226 Difference]: Without dead ends: 523 [2020-07-21 12:15:59,663 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:15:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-07-21 12:15:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2020-07-21 12:15:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-07-21 12:15:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 702 transitions. [2020-07-21 12:15:59,732 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 702 transitions. Word has length 91 [2020-07-21 12:15:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:59,732 INFO L479 AbstractCegarLoop]: Abstraction has 523 states and 702 transitions. [2020-07-21 12:15:59,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 12:15:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 702 transitions. [2020-07-21 12:15:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-21 12:15:59,734 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:59,734 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-07-21 12:15:59,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:59,948 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash 381568563, now seen corresponding path program 1 times [2020-07-21 12:15:59,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:59,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [286298877] [2020-07-21 12:15:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:00,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 12:16:00,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:16:00,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:00,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [286298877] [2020-07-21 12:16:00,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:00,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 12:16:00,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801039219] [2020-07-21 12:16:00,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 12:16:00,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:00,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 12:16:00,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:16:00,080 INFO L87 Difference]: Start difference. First operand 523 states and 702 transitions. Second operand 5 states. [2020-07-21 12:16:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:00,442 INFO L93 Difference]: Finished difference Result 1026 states and 1397 transitions. [2020-07-21 12:16:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 12:16:00,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-07-21 12:16:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:00,447 INFO L225 Difference]: With dead ends: 1026 [2020-07-21 12:16:00,447 INFO L226 Difference]: Without dead ends: 523 [2020-07-21 12:16:00,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:16:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-07-21 12:16:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2020-07-21 12:16:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-07-21 12:16:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 690 transitions. [2020-07-21 12:16:00,500 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 690 transitions. Word has length 91 [2020-07-21 12:16:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:00,500 INFO L479 AbstractCegarLoop]: Abstraction has 523 states and 690 transitions. [2020-07-21 12:16:00,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 12:16:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 690 transitions. [2020-07-21 12:16:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-21 12:16:00,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:00,502 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-07-21 12:16:00,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:00,715 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:00,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:00,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1573255181, now seen corresponding path program 1 times [2020-07-21 12:16:00,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:00,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1511945023] [2020-07-21 12:16:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:00,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 12:16:00,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:16:00,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:00,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1511945023] [2020-07-21 12:16:00,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:00,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 12:16:00,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302801932] [2020-07-21 12:16:00,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 12:16:00,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:00,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 12:16:00,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:16:00,827 INFO L87 Difference]: Start difference. First operand 523 states and 690 transitions. Second operand 5 states. [2020-07-21 12:16:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:01,300 INFO L93 Difference]: Finished difference Result 1306 states and 1859 transitions. [2020-07-21 12:16:01,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 12:16:01,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-07-21 12:16:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:01,307 INFO L225 Difference]: With dead ends: 1306 [2020-07-21 12:16:01,307 INFO L226 Difference]: Without dead ends: 803 [2020-07-21 12:16:01,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:16:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2020-07-21 12:16:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 669. [2020-07-21 12:16:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-07-21 12:16:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 850 transitions. [2020-07-21 12:16:01,355 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 850 transitions. Word has length 91 [2020-07-21 12:16:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:01,355 INFO L479 AbstractCegarLoop]: Abstraction has 669 states and 850 transitions. [2020-07-21 12:16:01,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 12:16:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 850 transitions. [2020-07-21 12:16:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-21 12:16:01,357 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:01,357 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-07-21 12:16:01,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:01,572 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:01,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1097571891, now seen corresponding path program 1 times [2020-07-21 12:16:01,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:01,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [115232445] [2020-07-21 12:16:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:01,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 12:16:01,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:16:01,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:01,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [115232445] [2020-07-21 12:16:01,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:01,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 12:16:01,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864468248] [2020-07-21 12:16:01,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 12:16:01,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:01,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 12:16:01,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:16:01,695 INFO L87 Difference]: Start difference. First operand 669 states and 850 transitions. Second operand 5 states. [2020-07-21 12:16:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:02,239 INFO L93 Difference]: Finished difference Result 1630 states and 2230 transitions. [2020-07-21 12:16:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 12:16:02,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-07-21 12:16:02,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:02,247 INFO L225 Difference]: With dead ends: 1630 [2020-07-21 12:16:02,248 INFO L226 Difference]: Without dead ends: 981 [2020-07-21 12:16:02,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-21 12:16:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2020-07-21 12:16:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 735. [2020-07-21 12:16:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2020-07-21 12:16:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 907 transitions. [2020-07-21 12:16:02,305 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 907 transitions. Word has length 91 [2020-07-21 12:16:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:02,305 INFO L479 AbstractCegarLoop]: Abstraction has 735 states and 907 transitions. [2020-07-21 12:16:02,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 12:16:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 907 transitions. [2020-07-21 12:16:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-21 12:16:02,307 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:02,307 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-07-21 12:16:02,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:02,520 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:02,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:02,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1274167371, now seen corresponding path program 1 times [2020-07-21 12:16:02,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:02,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1789037303] [2020-07-21 12:16:02,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:02,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 12:16:02,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:16:02,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:02,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1789037303] [2020-07-21 12:16:02,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:02,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:16:02,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649978884] [2020-07-21 12:16:02,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:16:02,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:16:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:02,621 INFO L87 Difference]: Start difference. First operand 735 states and 907 transitions. Second operand 3 states. [2020-07-21 12:16:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:02,697 INFO L93 Difference]: Finished difference Result 2141 states and 2709 transitions. [2020-07-21 12:16:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:16:02,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-07-21 12:16:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:02,706 INFO L225 Difference]: With dead ends: 2141 [2020-07-21 12:16:02,706 INFO L226 Difference]: Without dead ends: 1427 [2020-07-21 12:16:02,709 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-07-21 12:16:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1419. [2020-07-21 12:16:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2020-07-21 12:16:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1753 transitions. [2020-07-21 12:16:02,822 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1753 transitions. Word has length 91 [2020-07-21 12:16:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:02,822 INFO L479 AbstractCegarLoop]: Abstraction has 1419 states and 1753 transitions. [2020-07-21 12:16:02,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:16:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1753 transitions. [2020-07-21 12:16:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-07-21 12:16:02,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:02,827 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-07-21 12:16:03,040 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:03,040 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:03,040 INFO L82 PathProgramCache]: Analyzing trace with hash -498935573, now seen corresponding path program 1 times [2020-07-21 12:16:03,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:03,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1055799306] [2020-07-21 12:16:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:03,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 12:16:03,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:16:03,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:03,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1055799306] [2020-07-21 12:16:03,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:03,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:16:03,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135166582] [2020-07-21 12:16:03,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:16:03,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:03,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:16:03,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:03,139 INFO L87 Difference]: Start difference. First operand 1419 states and 1753 transitions. Second operand 3 states. [2020-07-21 12:16:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:03,277 INFO L93 Difference]: Finished difference Result 4167 states and 5302 transitions. [2020-07-21 12:16:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:16:03,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-07-21 12:16:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:03,294 INFO L225 Difference]: With dead ends: 4167 [2020-07-21 12:16:03,294 INFO L226 Difference]: Without dead ends: 2770 [2020-07-21 12:16:03,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2020-07-21 12:16:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2770. [2020-07-21 12:16:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2770 states. [2020-07-21 12:16:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3508 transitions. [2020-07-21 12:16:03,500 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3508 transitions. Word has length 111 [2020-07-21 12:16:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:03,501 INFO L479 AbstractCegarLoop]: Abstraction has 2770 states and 3508 transitions. [2020-07-21 12:16:03,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:16:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3508 transitions. [2020-07-21 12:16:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-21 12:16:03,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:03,507 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:16:03,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:03,721 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:03,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:03,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1684603705, now seen corresponding path program 1 times [2020-07-21 12:16:03,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:03,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2121980148] [2020-07-21 12:16:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:03,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:16:03,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:16:03,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:03,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2121980148] [2020-07-21 12:16:03,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:03,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:16:03,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037727992] [2020-07-21 12:16:03,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:16:03,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:03,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:16:03,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:03,864 INFO L87 Difference]: Start difference. First operand 2770 states and 3508 transitions. Second operand 3 states. [2020-07-21 12:16:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:04,002 INFO L93 Difference]: Finished difference Result 4161 states and 5440 transitions. [2020-07-21 12:16:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:16:04,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2020-07-21 12:16:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:04,019 INFO L225 Difference]: With dead ends: 4161 [2020-07-21 12:16:04,019 INFO L226 Difference]: Without dead ends: 2770 [2020-07-21 12:16:04,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2020-07-21 12:16:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2761. [2020-07-21 12:16:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2020-07-21 12:16:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3459 transitions. [2020-07-21 12:16:04,190 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3459 transitions. Word has length 154 [2020-07-21 12:16:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:04,190 INFO L479 AbstractCegarLoop]: Abstraction has 2761 states and 3459 transitions. [2020-07-21 12:16:04,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:16:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3459 transitions. [2020-07-21 12:16:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-07-21 12:16:04,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:04,196 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, 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] [2020-07-21 12:16:04,409 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:04,410 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:04,410 INFO L82 PathProgramCache]: Analyzing trace with hash 51909053, now seen corresponding path program 1 times [2020-07-21 12:16:04,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:04,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1548546301] [2020-07-21 12:16:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:04,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:16:04,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-21 12:16:04,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:04,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1548546301] [2020-07-21 12:16:04,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:04,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:16:04,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302695515] [2020-07-21 12:16:04,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:16:04,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:04,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:16:04,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:04,572 INFO L87 Difference]: Start difference. First operand 2761 states and 3459 transitions. Second operand 3 states. [2020-07-21 12:16:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:04,790 INFO L93 Difference]: Finished difference Result 7709 states and 10115 transitions. [2020-07-21 12:16:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:16:04,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2020-07-21 12:16:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:04,821 INFO L225 Difference]: With dead ends: 7709 [2020-07-21 12:16:04,822 INFO L226 Difference]: Without dead ends: 4975 [2020-07-21 12:16:04,835 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4975 states. [2020-07-21 12:16:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4975 to 4705. [2020-07-21 12:16:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4705 states. [2020-07-21 12:16:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 6143 transitions. [2020-07-21 12:16:05,214 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 6143 transitions. Word has length 155 [2020-07-21 12:16:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:05,214 INFO L479 AbstractCegarLoop]: Abstraction has 4705 states and 6143 transitions. [2020-07-21 12:16:05,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:16:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 6143 transitions. [2020-07-21 12:16:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-21 12:16:05,222 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:05,222 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, 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] [2020-07-21 12:16:05,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:05,438 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:05,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:05,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1239740628, now seen corresponding path program 1 times [2020-07-21 12:16:05,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:05,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155072947] [2020-07-21 12:16:05,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:05,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:16:05,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 12:16:05,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:05,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155072947] [2020-07-21 12:16:05,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:05,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:16:05,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961174140] [2020-07-21 12:16:05,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:16:05,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:05,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:16:05,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:05,557 INFO L87 Difference]: Start difference. First operand 4705 states and 6143 transitions. Second operand 3 states. [2020-07-21 12:16:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:05,940 INFO L93 Difference]: Finished difference Result 11391 states and 16036 transitions. [2020-07-21 12:16:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:16:05,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-07-21 12:16:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:05,983 INFO L225 Difference]: With dead ends: 11391 [2020-07-21 12:16:05,983 INFO L226 Difference]: Without dead ends: 6713 [2020-07-21 12:16:06,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6713 states. [2020-07-21 12:16:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6713 to 6691. [2020-07-21 12:16:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6691 states. [2020-07-21 12:16:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6691 states to 6691 states and 8846 transitions. [2020-07-21 12:16:06,492 INFO L78 Accepts]: Start accepts. Automaton has 6691 states and 8846 transitions. Word has length 156 [2020-07-21 12:16:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:06,494 INFO L479 AbstractCegarLoop]: Abstraction has 6691 states and 8846 transitions. [2020-07-21 12:16:06,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:16:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 6691 states and 8846 transitions. [2020-07-21 12:16:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-07-21 12:16:06,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:06,505 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-21 12:16:06,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:06,720 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2138837808, now seen corresponding path program 1 times [2020-07-21 12:16:06,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:06,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905609691] [2020-07-21 12:16:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:06,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 12:16:06,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-21 12:16:06,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:06,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905609691] [2020-07-21 12:16:06,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:06,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:16:06,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704101210] [2020-07-21 12:16:06,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:16:06,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:16:06,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:06,870 INFO L87 Difference]: Start difference. First operand 6691 states and 8846 transitions. Second operand 3 states. [2020-07-21 12:16:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:07,190 INFO L93 Difference]: Finished difference Result 13359 states and 18172 transitions. [2020-07-21 12:16:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:16:07,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2020-07-21 12:16:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:07,242 INFO L225 Difference]: With dead ends: 13359 [2020-07-21 12:16:07,243 INFO L226 Difference]: Without dead ends: 6697 [2020-07-21 12:16:07,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6697 states. [2020-07-21 12:16:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6697 to 6691. [2020-07-21 12:16:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6691 states. [2020-07-21 12:16:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6691 states to 6691 states and 8660 transitions. [2020-07-21 12:16:07,796 INFO L78 Accepts]: Start accepts. Automaton has 6691 states and 8660 transitions. Word has length 201 [2020-07-21 12:16:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:07,797 INFO L479 AbstractCegarLoop]: Abstraction has 6691 states and 8660 transitions. [2020-07-21 12:16:07,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:16:07,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6691 states and 8660 transitions. [2020-07-21 12:16:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-21 12:16:07,807 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:07,807 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, 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] [2020-07-21 12:16:08,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:08,022 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:08,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2088155021, now seen corresponding path program 1 times [2020-07-21 12:16:08,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:08,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054069302] [2020-07-21 12:16:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:08,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 12:16:08,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-21 12:16:08,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:08,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054069302] [2020-07-21 12:16:08,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:08,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 12:16:08,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120980866] [2020-07-21 12:16:08,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 12:16:08,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:08,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 12:16:08,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:16:08,189 INFO L87 Difference]: Start difference. First operand 6691 states and 8660 transitions. Second operand 6 states. [2020-07-21 12:16:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:08,616 INFO L93 Difference]: Finished difference Result 11275 states and 14897 transitions. [2020-07-21 12:16:08,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 12:16:08,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2020-07-21 12:16:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:08,639 INFO L225 Difference]: With dead ends: 11275 [2020-07-21 12:16:08,640 INFO L226 Difference]: Without dead ends: 4605 [2020-07-21 12:16:08,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 12:16:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4605 states. [2020-07-21 12:16:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4605 to 4605. [2020-07-21 12:16:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2020-07-21 12:16:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 5707 transitions. [2020-07-21 12:16:08,916 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 5707 transitions. Word has length 157 [2020-07-21 12:16:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:08,917 INFO L479 AbstractCegarLoop]: Abstraction has 4605 states and 5707 transitions. [2020-07-21 12:16:08,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 12:16:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 5707 transitions. [2020-07-21 12:16:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-07-21 12:16:08,923 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:08,923 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, 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, 1, 1] [2020-07-21 12:16:09,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:09,139 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:09,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:09,139 INFO L82 PathProgramCache]: Analyzing trace with hash -800092708, now seen corresponding path program 1 times [2020-07-21 12:16:09,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:09,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1616140501] [2020-07-21 12:16:09,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:09,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 12:16:09,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:16:09,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:09,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1616140501] [2020-07-21 12:16:09,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:09,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:16:09,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417489876] [2020-07-21 12:16:09,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:16:09,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:09,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:16:09,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:09,276 INFO L87 Difference]: Start difference. First operand 4605 states and 5707 transitions. Second operand 3 states. [2020-07-21 12:16:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:09,618 INFO L93 Difference]: Finished difference Result 8171 states and 10234 transitions. [2020-07-21 12:16:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:16:09,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2020-07-21 12:16:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:09,656 INFO L225 Difference]: With dead ends: 8171 [2020-07-21 12:16:09,656 INFO L226 Difference]: Without dead ends: 4611 [2020-07-21 12:16:09,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2020-07-21 12:16:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4605. [2020-07-21 12:16:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2020-07-21 12:16:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 5577 transitions. [2020-07-21 12:16:10,017 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 5577 transitions. Word has length 170 [2020-07-21 12:16:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:10,020 INFO L479 AbstractCegarLoop]: Abstraction has 4605 states and 5577 transitions. [2020-07-21 12:16:10,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:16:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 5577 transitions. [2020-07-21 12:16:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-07-21 12:16:10,028 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:10,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:16:10,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:10,230 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:10,230 INFO L82 PathProgramCache]: Analyzing trace with hash 772310041, now seen corresponding path program 1 times [2020-07-21 12:16:10,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:10,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1957853976] [2020-07-21 12:16:10,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:10,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:16:10,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 12:16:10,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:10,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1957853976] [2020-07-21 12:16:10,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:10,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:16:10,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293799953] [2020-07-21 12:16:10,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:16:10,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:16:10,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:10,432 INFO L87 Difference]: Start difference. First operand 4605 states and 5577 transitions. Second operand 3 states. [2020-07-21 12:16:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:10,751 INFO L93 Difference]: Finished difference Result 11661 states and 14747 transitions. [2020-07-21 12:16:10,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:16:10,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2020-07-21 12:16:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:10,783 INFO L225 Difference]: With dead ends: 11661 [2020-07-21 12:16:10,783 INFO L226 Difference]: Without dead ends: 7079 [2020-07-21 12:16:10,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7079 states. [2020-07-21 12:16:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7079 to 6555. [2020-07-21 12:16:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6555 states. [2020-07-21 12:16:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6555 states to 6555 states and 7969 transitions. [2020-07-21 12:16:11,627 INFO L78 Accepts]: Start accepts. Automaton has 6555 states and 7969 transitions. Word has length 165 [2020-07-21 12:16:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:11,628 INFO L479 AbstractCegarLoop]: Abstraction has 6555 states and 7969 transitions. [2020-07-21 12:16:11,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:16:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6555 states and 7969 transitions. [2020-07-21 12:16:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-07-21 12:16:11,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:11,640 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, 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-07-21 12:16:11,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:11,854 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash 369088344, now seen corresponding path program 1 times [2020-07-21 12:16:11,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:11,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1202441055] [2020-07-21 12:16:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:11,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 12:16:11,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-21 12:16:11,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:11,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1202441055] [2020-07-21 12:16:11,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:11,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:16:11,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163844653] [2020-07-21 12:16:11,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:16:11,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:11,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:16:11,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:11,982 INFO L87 Difference]: Start difference. First operand 6555 states and 7969 transitions. Second operand 3 states. [2020-07-21 12:16:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:12,232 INFO L93 Difference]: Finished difference Result 11635 states and 14079 transitions. [2020-07-21 12:16:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:16:12,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2020-07-21 12:16:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:12,257 INFO L225 Difference]: With dead ends: 11635 [2020-07-21 12:16:12,257 INFO L226 Difference]: Without dead ends: 6561 [2020-07-21 12:16:12,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:16:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6561 states. [2020-07-21 12:16:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6561 to 6553. [2020-07-21 12:16:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6553 states. [2020-07-21 12:16:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 7821 transitions. [2020-07-21 12:16:12,662 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 7821 transitions. Word has length 158 [2020-07-21 12:16:12,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:12,663 INFO L479 AbstractCegarLoop]: Abstraction has 6553 states and 7821 transitions. [2020-07-21 12:16:12,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:16:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 7821 transitions. [2020-07-21 12:16:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-07-21 12:16:12,674 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:12,674 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, 1] [2020-07-21 12:16:12,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:12,888 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:12,888 INFO L82 PathProgramCache]: Analyzing trace with hash -207236985, now seen corresponding path program 1 times [2020-07-21 12:16:12,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:12,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1785897022] [2020-07-21 12:16:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:13,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 12:16:13,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-07-21 12:16:13,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:13,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1785897022] [2020-07-21 12:16:13,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:13,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 12:16:13,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319204878] [2020-07-21 12:16:13,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 12:16:13,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 12:16:13,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:16:13,064 INFO L87 Difference]: Start difference. First operand 6553 states and 7821 transitions. Second operand 6 states. [2020-07-21 12:16:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:13,232 INFO L93 Difference]: Finished difference Result 11157 states and 13482 transitions. [2020-07-21 12:16:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 12:16:13,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2020-07-21 12:16:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:13,247 INFO L225 Difference]: With dead ends: 11157 [2020-07-21 12:16:13,247 INFO L226 Difference]: Without dead ends: 2436 [2020-07-21 12:16:13,261 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 12:16:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2020-07-21 12:16:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2020-07-21 12:16:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2436 states. [2020-07-21 12:16:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 2776 transitions. [2020-07-21 12:16:13,376 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 2776 transitions. Word has length 208 [2020-07-21 12:16:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:13,376 INFO L479 AbstractCegarLoop]: Abstraction has 2436 states and 2776 transitions. [2020-07-21 12:16:13,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 12:16:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 2776 transitions. [2020-07-21 12:16:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-07-21 12:16:13,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:13,381 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-07-21 12:16:13,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:13,596 INFO L427 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash -931195261, now seen corresponding path program 1 times [2020-07-21 12:16:13,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:13,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [156929776] [2020-07-21 12:16:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:16:13,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 12:16:13,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:16:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-07-21 12:16:13,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:16:13,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [156929776] [2020-07-21 12:16:13,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:16:13,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 12:16:13,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154318611] [2020-07-21 12:16:13,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 12:16:13,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:16:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 12:16:13,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:16:13,835 INFO L87 Difference]: Start difference. First operand 2436 states and 2776 transitions. Second operand 6 states. [2020-07-21 12:16:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:16:13,938 INFO L93 Difference]: Finished difference Result 4949 states and 5738 transitions. [2020-07-21 12:16:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 12:16:13,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2020-07-21 12:16:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:16:13,947 INFO L225 Difference]: With dead ends: 4949 [2020-07-21 12:16:13,947 INFO L226 Difference]: Without dead ends: 2534 [2020-07-21 12:16:13,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 12:16:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2020-07-21 12:16:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2518. [2020-07-21 12:16:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2020-07-21 12:16:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 2839 transitions. [2020-07-21 12:16:14,078 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 2839 transitions. Word has length 208 [2020-07-21 12:16:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:16:14,078 INFO L479 AbstractCegarLoop]: Abstraction has 2518 states and 2839 transitions. [2020-07-21 12:16:14,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 12:16:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 2839 transitions. [2020-07-21 12:16:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-07-21 12:16:14,082 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:16:14,083 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-07-21 12:16:14,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:14,297 INFO L427 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:16:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:16:14,297 INFO L82 PathProgramCache]: Analyzing trace with hash 89354437, now seen corresponding path program 1 times [2020-07-21 12:16:14,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:16:14,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675616080] [2020-07-21 12:16:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 12:16:14,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 12:16:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 12:16:14,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 12:16:14,678 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 12:16:14,679 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 12:16:14,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:16:15,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 12:16:15 BoogieIcfgContainer [2020-07-21 12:16:15,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 12:16:15,076 INFO L168 Benchmark]: Toolchain (without parser) took 19991.76 ms. Allocated memory was 138.9 MB in the beginning and 932.2 MB in the end (delta: 793.2 MB). Free memory was 103.5 MB in the beginning and 559.2 MB in the end (delta: -455.6 MB). Peak memory consumption was 337.6 MB. Max. memory is 7.1 GB. [2020-07-21 12:16:15,076 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 12:16:15,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.14 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.3 MB in the beginning and 179.2 MB in the end (delta: -75.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2020-07-21 12:16:15,077 INFO L168 Benchmark]: Boogie Preprocessor took 47.48 ms. Allocated memory is still 203.4 MB. Free memory was 179.2 MB in the beginning and 177.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-07-21 12:16:15,078 INFO L168 Benchmark]: RCFGBuilder took 607.14 ms. Allocated memory is still 203.4 MB. Free memory was 177.1 MB in the beginning and 141.3 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. [2020-07-21 12:16:15,081 INFO L168 Benchmark]: TraceAbstraction took 18896.59 ms. Allocated memory was 203.4 MB in the beginning and 932.2 MB in the end (delta: 728.8 MB). Free memory was 141.3 MB in the beginning and 559.2 MB in the end (delta: -417.9 MB). Peak memory consumption was 310.9 MB. Max. memory is 7.1 GB. [2020-07-21 12:16:15,085 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.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 435.14 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 103.3 MB in the beginning and 179.2 MB in the end (delta: -75.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.48 ms. Allocated memory is still 203.4 MB. Free memory was 179.2 MB in the beginning and 177.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 607.14 ms. Allocated memory is still 203.4 MB. Free memory was 177.1 MB in the beginning and 141.3 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18896.59 ms. Allocated memory was 203.4 MB in the beginning and 932.2 MB in the end (delta: 728.8 MB). Free memory was 141.3 MB in the beginning and 559.2 MB in the end (delta: -417.9 MB). Peak memory consumption was 310.9 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)=15, \old(E_2)=6, \old(M_E)=10, \old(m_i)=3, \old(m_pc)=4, \old(m_st)=8, \old(T1_E)=14, \old(t1_i)=11, \old(t1_pc)=13, \old(t1_st)=12, \old(T2_E)=7, \old(t2_i)=9, \old(t2_pc)=16, \old(t2_st)=5, 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=1, 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=1, 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=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)=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: 18.6s, OverallIterations: 21, TraceHistogramMax: 3, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5021 SDtfs, 3534 SDslu, 4564 SDs, 0 SdLazy, 1506 SolverSat, 637 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2650 GetRequests, 2599 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6691occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 1306 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2868 NumberOfCodeBlocks, 2868 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2640 ConstructedInterpolants, 0 QuantifiedInterpolants, 508670 SizeOfPredicates, 22 NumberOfNonLiveVariables, 11976 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 693/693 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...