/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-20 12:26:14,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 12:26:14,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 12:26:14,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 12:26:14,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 12:26:14,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 12:26:14,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 12:26:14,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 12:26:14,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 12:26:14,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 12:26:14,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 12:26:14,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 12:26:14,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 12:26:14,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 12:26:14,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 12:26:14,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 12:26:14,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 12:26:14,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 12:26:14,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 12:26:14,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 12:26:14,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 12:26:14,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 12:26:14,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 12:26:14,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 12:26:14,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 12:26:14,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 12:26:14,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 12:26:14,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 12:26:14,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 12:26:14,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 12:26:14,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 12:26:14,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 12:26:14,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 12:26:14,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 12:26:14,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 12:26:14,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 12:26:14,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 12:26:14,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 12:26:14,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 12:26:14,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 12:26:14,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 12:26:14,755 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-20 12:26:14,790 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 12:26:14,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 12:26:14,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 12:26:14,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 12:26:14,792 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 12:26:14,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 12:26:14,792 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 12:26:14,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 12:26:14,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 12:26:14,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 12:26:14,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 12:26:14,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 12:26:14,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 12:26:14,794 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 12:26:14,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 12:26:14,794 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 12:26:14,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 12:26:14,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 12:26:14,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 12:26:14,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 12:26:14,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 12:26:14,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 12:26:14,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 12:26:14,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 12:26:14,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 12:26:14,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 12:26:14,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:14,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 12:26:14,797 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 12:26:14,797 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-20 12:26:15,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 12:26:15,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 12:26:15,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 12:26:15,092 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 12:26:15,092 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 12:26:15,094 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-20 12:26:15,176 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a309c39/7a140bc55fa141749d721e28b3e0ccb8/FLAGb3d317d4c [2020-07-20 12:26:15,684 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 12:26:15,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-07-20 12:26:15,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a309c39/7a140bc55fa141749d721e28b3e0ccb8/FLAGb3d317d4c [2020-07-20 12:26:16,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a309c39/7a140bc55fa141749d721e28b3e0ccb8 [2020-07-20 12:26:16,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 12:26:16,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 12:26:16,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 12:26:16,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 12:26:16,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 12:26:16,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:26:16" (1/1) ... [2020-07-20 12:26:16,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653358de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16, skipping insertion in model container [2020-07-20 12:26:16,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:26:16" (1/1) ... [2020-07-20 12:26:16,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 12:26:16,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 12:26:16,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 12:26:16,303 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 12:26:16,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 12:26:16,460 INFO L208 MainTranslator]: Completed translation [2020-07-20 12:26:16,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16 WrapperNode [2020-07-20 12:26:16,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 12:26:16,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 12:26:16,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 12:26:16,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 12:26:16,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16" (1/1) ... [2020-07-20 12:26:16,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16" (1/1) ... [2020-07-20 12:26:16,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16" (1/1) ... [2020-07-20 12:26:16,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16" (1/1) ... [2020-07-20 12:26:16,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16" (1/1) ... [2020-07-20 12:26:16,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16" (1/1) ... [2020-07-20 12:26:16,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16" (1/1) ... [2020-07-20 12:26:16,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 12:26:16,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 12:26:16,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 12:26:16,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 12:26:16,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16" (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-20 12:26:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 12:26:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 12:26:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 12:26:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 12:26:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 12:26:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-07-20 12:26:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 12:26:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 12:26:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-07-20 12:26:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 12:26:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 12:26:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 12:26:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 12:26:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 12:26:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 12:26:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 12:26:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 12:26:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 12:26:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 12:26:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 12:26:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 12:26:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 12:26:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 12:26:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 12:26:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 12:26:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 12:26:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 12:26:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 12:26:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-07-20 12:26:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 12:26:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 12:26:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 12:26:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-07-20 12:26:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 12:26:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 12:26:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 12:26:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 12:26:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 12:26:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 12:26:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 12:26:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 12:26:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 12:26:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 12:26:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 12:26:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 12:26:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 12:26:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 12:26:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 12:26:17,126 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 12:26:17,126 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-20 12:26:17,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:26:17 BoogieIcfgContainer [2020-07-20 12:26:17,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 12:26:17,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 12:26:17,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 12:26:17,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 12:26:17,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:26:16" (1/3) ... [2020-07-20 12:26:17,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7486ffb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:26:17, skipping insertion in model container [2020-07-20 12:26:17,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:26:16" (2/3) ... [2020-07-20 12:26:17,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7486ffb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:26:17, skipping insertion in model container [2020-07-20 12:26:17,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:26:17" (3/3) ... [2020-07-20 12:26:17,145 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-07-20 12:26:17,157 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 12:26:17,175 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 12:26:17,189 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 12:26:17,216 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 12:26:17,216 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 12:26:17,217 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 12:26:17,217 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 12:26:17,217 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 12:26:17,217 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 12:26:17,218 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 12:26:17,218 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 12:26:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2020-07-20 12:26:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 12:26:17,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:17,268 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-20 12:26:17,269 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:17,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1996614335, now seen corresponding path program 1 times [2020-07-20 12:26:17,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:17,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1614895973] [2020-07-20 12:26:17,283 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-20 12:26:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:17,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:17,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:17,545 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-20 12:26:17,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:17,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1614895973] [2020-07-20 12:26:17,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:17,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:17,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706960303] [2020-07-20 12:26:17,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:17,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:17,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:17,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:17,572 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 3 states. [2020-07-20 12:26:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:17,650 INFO L93 Difference]: Finished difference Result 320 states and 454 transitions. [2020-07-20 12:26:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:17,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-07-20 12:26:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:17,670 INFO L225 Difference]: With dead ends: 320 [2020-07-20 12:26:17,670 INFO L226 Difference]: Without dead ends: 160 [2020-07-20 12:26:17,676 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-20 12:26:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-07-20 12:26:17,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2020-07-20 12:26:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-20 12:26:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 212 transitions. [2020-07-20 12:26:17,762 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 212 transitions. Word has length 90 [2020-07-20 12:26:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:17,764 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 212 transitions. [2020-07-20 12:26:17,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2020-07-20 12:26:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-07-20 12:26:17,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:17,769 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-20 12:26:17,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:17,984 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:17,986 INFO L82 PathProgramCache]: Analyzing trace with hash -387310403, now seen corresponding path program 1 times [2020-07-20 12:26:17,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:17,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1440933642] [2020-07-20 12:26:17,987 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-20 12:26:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:18,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:18,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:18,127 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-20 12:26:18,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:18,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1440933642] [2020-07-20 12:26:18,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:18,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:18,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301273509] [2020-07-20 12:26:18,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:18,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:18,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:18,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:18,132 INFO L87 Difference]: Start difference. First operand 160 states and 212 transitions. Second operand 3 states. [2020-07-20 12:26:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:18,206 INFO L93 Difference]: Finished difference Result 432 states and 593 transitions. [2020-07-20 12:26:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:18,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-07-20 12:26:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:18,213 INFO L225 Difference]: With dead ends: 432 [2020-07-20 12:26:18,213 INFO L226 Difference]: Without dead ends: 294 [2020-07-20 12:26:18,217 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-20 12:26:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-07-20 12:26:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 288. [2020-07-20 12:26:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-07-20 12:26:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 396 transitions. [2020-07-20 12:26:18,281 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 396 transitions. Word has length 90 [2020-07-20 12:26:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:18,282 INFO L479 AbstractCegarLoop]: Abstraction has 288 states and 396 transitions. [2020-07-20 12:26:18,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 396 transitions. [2020-07-20 12:26:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 12:26:18,287 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:18,287 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-20 12:26:18,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:18,497 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 16326453, now seen corresponding path program 1 times [2020-07-20 12:26:18,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:18,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [657335145] [2020-07-20 12:26:18,499 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-20 12:26:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:18,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:18,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:18,627 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-20 12:26:18,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:18,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [657335145] [2020-07-20 12:26:18,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:18,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:18,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179305594] [2020-07-20 12:26:18,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:18,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:18,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:18,631 INFO L87 Difference]: Start difference. First operand 288 states and 396 transitions. Second operand 3 states. [2020-07-20 12:26:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:18,683 INFO L93 Difference]: Finished difference Result 548 states and 754 transitions. [2020-07-20 12:26:18,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:18,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-07-20 12:26:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:18,688 INFO L225 Difference]: With dead ends: 548 [2020-07-20 12:26:18,688 INFO L226 Difference]: Without dead ends: 281 [2020-07-20 12:26:18,690 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-20 12:26:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-07-20 12:26:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2020-07-20 12:26:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2020-07-20 12:26:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 383 transitions. [2020-07-20 12:26:18,722 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 383 transitions. Word has length 91 [2020-07-20 12:26:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:18,722 INFO L479 AbstractCegarLoop]: Abstraction has 281 states and 383 transitions. [2020-07-20 12:26:18,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 383 transitions. [2020-07-20 12:26:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 12:26:18,725 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:18,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:26:18,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:18,939 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:18,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:18,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1717777997, now seen corresponding path program 1 times [2020-07-20 12:26:18,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:18,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599948529] [2020-07-20 12:26:18,941 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-20 12:26:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:19,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 12:26:19,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:19,142 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-20 12:26:19,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:19,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599948529] [2020-07-20 12:26:19,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:19,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:26:19,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018113750] [2020-07-20 12:26:19,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:26:19,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:19,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:26:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:26:19,145 INFO L87 Difference]: Start difference. First operand 281 states and 383 transitions. Second operand 5 states. [2020-07-20 12:26:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:19,849 INFO L93 Difference]: Finished difference Result 835 states and 1202 transitions. [2020-07-20 12:26:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:26:19,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-07-20 12:26:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:19,856 INFO L225 Difference]: With dead ends: 835 [2020-07-20 12:26:19,857 INFO L226 Difference]: Without dead ends: 574 [2020-07-20 12:26:19,859 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-20 12:26:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-07-20 12:26:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 523. [2020-07-20 12:26:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-07-20 12:26:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 714 transitions. [2020-07-20 12:26:19,912 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 714 transitions. Word has length 91 [2020-07-20 12:26:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:19,913 INFO L479 AbstractCegarLoop]: Abstraction has 523 states and 714 transitions. [2020-07-20 12:26:19,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:26:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 714 transitions. [2020-07-20 12:26:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 12:26:19,915 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:19,915 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-20 12:26:20,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:20,130 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:20,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2107195379, now seen corresponding path program 1 times [2020-07-20 12:26:20,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:20,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [366258183] [2020-07-20 12:26:20,133 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-20 12:26:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:20,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 12:26:20,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:20,289 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-20 12:26:20,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:20,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [366258183] [2020-07-20 12:26:20,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:20,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:26:20,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133182447] [2020-07-20 12:26:20,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:26:20,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:20,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:26:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:26:20,292 INFO L87 Difference]: Start difference. First operand 523 states and 714 transitions. Second operand 5 states. [2020-07-20 12:26:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:20,689 INFO L93 Difference]: Finished difference Result 1026 states and 1421 transitions. [2020-07-20 12:26:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:26:20,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-07-20 12:26:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:20,698 INFO L225 Difference]: With dead ends: 1026 [2020-07-20 12:26:20,699 INFO L226 Difference]: Without dead ends: 523 [2020-07-20 12:26:20,701 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-20 12:26:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-07-20 12:26:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2020-07-20 12:26:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-07-20 12:26:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 702 transitions. [2020-07-20 12:26:20,787 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 702 transitions. Word has length 91 [2020-07-20 12:26:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:20,787 INFO L479 AbstractCegarLoop]: Abstraction has 523 states and 702 transitions. [2020-07-20 12:26:20,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:26:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 702 transitions. [2020-07-20 12:26:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 12:26:20,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:20,792 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-20 12:26:21,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:21,006 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:21,007 INFO L82 PathProgramCache]: Analyzing trace with hash 381568563, now seen corresponding path program 1 times [2020-07-20 12:26:21,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:21,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1870482274] [2020-07-20 12:26:21,009 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-20 12:26:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:21,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 12:26:21,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:21,156 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-20 12:26:21,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:21,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1870482274] [2020-07-20 12:26:21,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:21,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:26:21,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983343326] [2020-07-20 12:26:21,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:26:21,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:21,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:26:21,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:26:21,160 INFO L87 Difference]: Start difference. First operand 523 states and 702 transitions. Second operand 5 states. [2020-07-20 12:26:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:21,499 INFO L93 Difference]: Finished difference Result 1026 states and 1397 transitions. [2020-07-20 12:26:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:26:21,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-07-20 12:26:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:21,504 INFO L225 Difference]: With dead ends: 1026 [2020-07-20 12:26:21,505 INFO L226 Difference]: Without dead ends: 523 [2020-07-20 12:26:21,507 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-20 12:26:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-07-20 12:26:21,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2020-07-20 12:26:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-07-20 12:26:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 690 transitions. [2020-07-20 12:26:21,547 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 690 transitions. Word has length 91 [2020-07-20 12:26:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:21,548 INFO L479 AbstractCegarLoop]: Abstraction has 523 states and 690 transitions. [2020-07-20 12:26:21,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:26:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 690 transitions. [2020-07-20 12:26:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 12:26:21,549 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:21,549 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-20 12:26:21,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:21,764 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:21,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1573255181, now seen corresponding path program 1 times [2020-07-20 12:26:21,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:21,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [215224839] [2020-07-20 12:26:21,765 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-20 12:26:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:21,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 12:26:21,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:21,905 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-20 12:26:21,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:21,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [215224839] [2020-07-20 12:26:21,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:21,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:26:21,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108963347] [2020-07-20 12:26:21,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:26:21,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:21,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:26:21,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:26:21,909 INFO L87 Difference]: Start difference. First operand 523 states and 690 transitions. Second operand 5 states. [2020-07-20 12:26:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:22,433 INFO L93 Difference]: Finished difference Result 1306 states and 1859 transitions. [2020-07-20 12:26:22,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:26:22,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-07-20 12:26:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:22,440 INFO L225 Difference]: With dead ends: 1306 [2020-07-20 12:26:22,441 INFO L226 Difference]: Without dead ends: 803 [2020-07-20 12:26:22,444 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-20 12:26:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2020-07-20 12:26:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 669. [2020-07-20 12:26:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-07-20 12:26:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 850 transitions. [2020-07-20 12:26:22,498 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 850 transitions. Word has length 91 [2020-07-20 12:26:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:22,499 INFO L479 AbstractCegarLoop]: Abstraction has 669 states and 850 transitions. [2020-07-20 12:26:22,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:26:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 850 transitions. [2020-07-20 12:26:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 12:26:22,500 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:22,500 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-20 12:26:22,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:22,715 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1097571891, now seen corresponding path program 1 times [2020-07-20 12:26:22,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:22,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1021122411] [2020-07-20 12:26:22,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 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-20 12:26:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:22,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 12:26:22,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:22,834 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-20 12:26:22,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:22,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1021122411] [2020-07-20 12:26:22,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:22,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:26:22,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708129864] [2020-07-20 12:26:22,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:26:22,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:22,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:26:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:26:22,836 INFO L87 Difference]: Start difference. First operand 669 states and 850 transitions. Second operand 5 states. [2020-07-20 12:26:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:23,384 INFO L93 Difference]: Finished difference Result 1630 states and 2230 transitions. [2020-07-20 12:26:23,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:26:23,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-07-20 12:26:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:23,393 INFO L225 Difference]: With dead ends: 1630 [2020-07-20 12:26:23,393 INFO L226 Difference]: Without dead ends: 981 [2020-07-20 12:26:23,397 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-20 12:26:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2020-07-20 12:26:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 735. [2020-07-20 12:26:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2020-07-20 12:26:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 907 transitions. [2020-07-20 12:26:23,449 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 907 transitions. Word has length 91 [2020-07-20 12:26:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:23,450 INFO L479 AbstractCegarLoop]: Abstraction has 735 states and 907 transitions. [2020-07-20 12:26:23,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:26:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 907 transitions. [2020-07-20 12:26:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 12:26:23,451 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:23,451 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-20 12:26:23,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:23,667 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:23,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1274167371, now seen corresponding path program 1 times [2020-07-20 12:26:23,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:23,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [289460109] [2020-07-20 12:26:23,669 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-20 12:26:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:23,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 12:26:23,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:23,792 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-20 12:26:23,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:23,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [289460109] [2020-07-20 12:26:23,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:23,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:23,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066412925] [2020-07-20 12:26:23,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:23,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:23,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:23,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:23,795 INFO L87 Difference]: Start difference. First operand 735 states and 907 transitions. Second operand 3 states. [2020-07-20 12:26:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:23,881 INFO L93 Difference]: Finished difference Result 2141 states and 2709 transitions. [2020-07-20 12:26:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:23,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-07-20 12:26:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:23,891 INFO L225 Difference]: With dead ends: 2141 [2020-07-20 12:26:23,892 INFO L226 Difference]: Without dead ends: 1427 [2020-07-20 12:26:23,896 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-20 12:26:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-07-20 12:26:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1419. [2020-07-20 12:26:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2020-07-20 12:26:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1753 transitions. [2020-07-20 12:26:23,997 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1753 transitions. Word has length 91 [2020-07-20 12:26:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:23,998 INFO L479 AbstractCegarLoop]: Abstraction has 1419 states and 1753 transitions. [2020-07-20 12:26:23,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1753 transitions. [2020-07-20 12:26:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-07-20 12:26:24,003 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:24,003 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-20 12:26:24,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:24,217 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash -498935573, now seen corresponding path program 1 times [2020-07-20 12:26:24,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:24,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1771174845] [2020-07-20 12:26:24,219 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-20 12:26:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:24,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:26:24,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:24,339 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-20 12:26:24,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:24,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1771174845] [2020-07-20 12:26:24,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:24,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:24,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688077062] [2020-07-20 12:26:24,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:24,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:24,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:24,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:24,342 INFO L87 Difference]: Start difference. First operand 1419 states and 1753 transitions. Second operand 3 states. [2020-07-20 12:26:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:24,505 INFO L93 Difference]: Finished difference Result 4167 states and 5302 transitions. [2020-07-20 12:26:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:24,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-07-20 12:26:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:24,524 INFO L225 Difference]: With dead ends: 4167 [2020-07-20 12:26:24,524 INFO L226 Difference]: Without dead ends: 2770 [2020-07-20 12:26:24,531 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-20 12:26:24,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2020-07-20 12:26:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2770. [2020-07-20 12:26:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2770 states. [2020-07-20 12:26:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3508 transitions. [2020-07-20 12:26:24,712 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3508 transitions. Word has length 111 [2020-07-20 12:26:24,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:24,713 INFO L479 AbstractCegarLoop]: Abstraction has 2770 states and 3508 transitions. [2020-07-20 12:26:24,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3508 transitions. [2020-07-20 12:26:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-20 12:26:24,718 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:24,718 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-20 12:26:24,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:24,933 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1684603705, now seen corresponding path program 1 times [2020-07-20 12:26:24,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:24,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1480211039] [2020-07-20 12:26:24,934 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-20 12:26:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:25,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:25,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:25,062 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-20 12:26:25,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:25,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1480211039] [2020-07-20 12:26:25,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:25,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:25,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241649755] [2020-07-20 12:26:25,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:25,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:25,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:25,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:25,065 INFO L87 Difference]: Start difference. First operand 2770 states and 3508 transitions. Second operand 3 states. [2020-07-20 12:26:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:25,238 INFO L93 Difference]: Finished difference Result 4161 states and 5440 transitions. [2020-07-20 12:26:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:25,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2020-07-20 12:26:25,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:25,261 INFO L225 Difference]: With dead ends: 4161 [2020-07-20 12:26:25,262 INFO L226 Difference]: Without dead ends: 2770 [2020-07-20 12:26:25,271 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-20 12:26:25,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2020-07-20 12:26:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2761. [2020-07-20 12:26:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2020-07-20 12:26:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3459 transitions. [2020-07-20 12:26:25,472 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3459 transitions. Word has length 154 [2020-07-20 12:26:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:25,473 INFO L479 AbstractCegarLoop]: Abstraction has 2761 states and 3459 transitions. [2020-07-20 12:26:25,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3459 transitions. [2020-07-20 12:26:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-07-20 12:26:25,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:25,478 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-20 12:26:25,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:25,693 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash 51909053, now seen corresponding path program 1 times [2020-07-20 12:26:25,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:25,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1711080558] [2020-07-20 12:26:25,694 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-20 12:26:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:25,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:25,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:25,822 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-20 12:26:25,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:25,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1711080558] [2020-07-20 12:26:25,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:25,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:25,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354906774] [2020-07-20 12:26:25,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:25,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:25,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:25,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:25,824 INFO L87 Difference]: Start difference. First operand 2761 states and 3459 transitions. Second operand 3 states. [2020-07-20 12:26:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:26,078 INFO L93 Difference]: Finished difference Result 7709 states and 10115 transitions. [2020-07-20 12:26:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:26,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2020-07-20 12:26:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:26,112 INFO L225 Difference]: With dead ends: 7709 [2020-07-20 12:26:26,112 INFO L226 Difference]: Without dead ends: 4975 [2020-07-20 12:26:26,126 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-20 12:26:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4975 states. [2020-07-20 12:26:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4975 to 4705. [2020-07-20 12:26:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4705 states. [2020-07-20 12:26:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 6143 transitions. [2020-07-20 12:26:26,474 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 6143 transitions. Word has length 155 [2020-07-20 12:26:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:26,475 INFO L479 AbstractCegarLoop]: Abstraction has 4705 states and 6143 transitions. [2020-07-20 12:26:26,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 6143 transitions. [2020-07-20 12:26:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-07-20 12:26:26,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:26,484 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-20 12:26:26,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:26,760 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:26,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1239740628, now seen corresponding path program 1 times [2020-07-20 12:26:26,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:26,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [576997556] [2020-07-20 12:26:26,761 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-20 12:26:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:26,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:26,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:26,893 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-20 12:26:26,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:26,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [576997556] [2020-07-20 12:26:26,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:26,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:26,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744102304] [2020-07-20 12:26:26,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:26,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:26,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:26,895 INFO L87 Difference]: Start difference. First operand 4705 states and 6143 transitions. Second operand 3 states. [2020-07-20 12:26:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:27,177 INFO L93 Difference]: Finished difference Result 11391 states and 16036 transitions. [2020-07-20 12:26:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:27,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-07-20 12:26:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:27,223 INFO L225 Difference]: With dead ends: 11391 [2020-07-20 12:26:27,223 INFO L226 Difference]: Without dead ends: 6713 [2020-07-20 12:26:27,254 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-20 12:26:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6713 states. [2020-07-20 12:26:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6713 to 6691. [2020-07-20 12:26:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6691 states. [2020-07-20 12:26:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6691 states to 6691 states and 8846 transitions. [2020-07-20 12:26:27,770 INFO L78 Accepts]: Start accepts. Automaton has 6691 states and 8846 transitions. Word has length 156 [2020-07-20 12:26:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:27,771 INFO L479 AbstractCegarLoop]: Abstraction has 6691 states and 8846 transitions. [2020-07-20 12:26:27,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6691 states and 8846 transitions. [2020-07-20 12:26:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-07-20 12:26:27,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:27,785 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-20 12:26:27,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:28,000 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2138837808, now seen corresponding path program 1 times [2020-07-20 12:26:28,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:28,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [331026836] [2020-07-20 12:26:28,002 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-20 12:26:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:28,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:26:28,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:28,160 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-20 12:26:28,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:28,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [331026836] [2020-07-20 12:26:28,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:28,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:28,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867730426] [2020-07-20 12:26:28,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:28,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:28,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:28,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:28,162 INFO L87 Difference]: Start difference. First operand 6691 states and 8846 transitions. Second operand 3 states. [2020-07-20 12:26:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:28,529 INFO L93 Difference]: Finished difference Result 13359 states and 18172 transitions. [2020-07-20 12:26:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:28,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2020-07-20 12:26:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:28,588 INFO L225 Difference]: With dead ends: 13359 [2020-07-20 12:26:28,588 INFO L226 Difference]: Without dead ends: 6697 [2020-07-20 12:26:28,628 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-20 12:26:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6697 states. [2020-07-20 12:26:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6697 to 6691. [2020-07-20 12:26:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6691 states. [2020-07-20 12:26:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6691 states to 6691 states and 8660 transitions. [2020-07-20 12:26:29,081 INFO L78 Accepts]: Start accepts. Automaton has 6691 states and 8660 transitions. Word has length 201 [2020-07-20 12:26:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:29,082 INFO L479 AbstractCegarLoop]: Abstraction has 6691 states and 8660 transitions. [2020-07-20 12:26:29,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6691 states and 8660 transitions. [2020-07-20 12:26:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-20 12:26:29,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:29,200 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-20 12:26:29,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:29,401 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:29,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2088155021, now seen corresponding path program 1 times [2020-07-20 12:26:29,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:29,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183342796] [2020-07-20 12:26:29,402 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-20 12:26:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:29,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 12:26:29,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:29,546 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-20 12:26:29,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:29,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183342796] [2020-07-20 12:26:29,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:29,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 12:26:29,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381710290] [2020-07-20 12:26:29,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:26:29,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:29,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:26:29,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:29,550 INFO L87 Difference]: Start difference. First operand 6691 states and 8660 transitions. Second operand 6 states. [2020-07-20 12:26:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:29,816 INFO L93 Difference]: Finished difference Result 11275 states and 14897 transitions. [2020-07-20 12:26:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:26:29,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2020-07-20 12:26:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:29,841 INFO L225 Difference]: With dead ends: 11275 [2020-07-20 12:26:29,841 INFO L226 Difference]: Without dead ends: 4605 [2020-07-20 12:26:29,858 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-20 12:26:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4605 states. [2020-07-20 12:26:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4605 to 4605. [2020-07-20 12:26:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2020-07-20 12:26:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 5707 transitions. [2020-07-20 12:26:30,305 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 5707 transitions. Word has length 157 [2020-07-20 12:26:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:30,305 INFO L479 AbstractCegarLoop]: Abstraction has 4605 states and 5707 transitions. [2020-07-20 12:26:30,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:26:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 5707 transitions. [2020-07-20 12:26:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-20 12:26:30,312 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:30,312 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:26:30,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:30,527 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:30,528 INFO L82 PathProgramCache]: Analyzing trace with hash 684520347, now seen corresponding path program 1 times [2020-07-20 12:26:30,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:30,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [899215829] [2020-07-20 12:26:30,529 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-20 12:26:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:30,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 12:26:30,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 12:26:30,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 12:26:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-07-20 12:26:30,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [899215829] [2020-07-20 12:26:30,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 12:26:30,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2020-07-20 12:26:30,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049137046] [2020-07-20 12:26:30,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:26:30,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:30,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:26:30,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:30,893 INFO L87 Difference]: Start difference. First operand 4605 states and 5707 transitions. Second operand 5 states. [2020-07-20 12:26:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:31,584 INFO L93 Difference]: Finished difference Result 8807 states and 11159 transitions. [2020-07-20 12:26:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:26:31,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2020-07-20 12:26:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:31,610 INFO L225 Difference]: With dead ends: 8807 [2020-07-20 12:26:31,610 INFO L226 Difference]: Without dead ends: 5246 [2020-07-20 12:26:31,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2020-07-20 12:26:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 5184. [2020-07-20 12:26:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5184 states. [2020-07-20 12:26:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 6526 transitions. [2020-07-20 12:26:32,015 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 6526 transitions. Word has length 157 [2020-07-20 12:26:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:32,016 INFO L479 AbstractCegarLoop]: Abstraction has 5184 states and 6526 transitions. [2020-07-20 12:26:32,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:26:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 6526 transitions. [2020-07-20 12:26:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-07-20 12:26:32,022 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:32,022 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, 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-20 12:26:32,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:32,239 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:32,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1968783871, now seen corresponding path program 1 times [2020-07-20 12:26:32,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:32,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531832024] [2020-07-20 12:26:32,241 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-20 12:26:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:32,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:26:32,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:26:32,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:32,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531832024] [2020-07-20 12:26:32,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:32,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:32,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185044068] [2020-07-20 12:26:32,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:32,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:32,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:32,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:32,371 INFO L87 Difference]: Start difference. First operand 5184 states and 6526 transitions. Second operand 3 states. [2020-07-20 12:26:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:32,544 INFO L93 Difference]: Finished difference Result 9156 states and 11661 transitions. [2020-07-20 12:26:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:32,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2020-07-20 12:26:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:32,573 INFO L225 Difference]: With dead ends: 9156 [2020-07-20 12:26:32,574 INFO L226 Difference]: Without dead ends: 5032 [2020-07-20 12:26:32,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 161 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-20 12:26:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2020-07-20 12:26:32,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 5026. [2020-07-20 12:26:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5026 states. [2020-07-20 12:26:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 6070 transitions. [2020-07-20 12:26:32,860 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 6070 transitions. Word has length 163 [2020-07-20 12:26:32,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:32,861 INFO L479 AbstractCegarLoop]: Abstraction has 5026 states and 6070 transitions. [2020-07-20 12:26:32,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:32,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 6070 transitions. [2020-07-20 12:26:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-07-20 12:26:32,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:32,870 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-20 12:26:33,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:33,085 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:33,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1700862448, now seen corresponding path program 1 times [2020-07-20 12:26:33,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:33,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1207343845] [2020-07-20 12:26:33,086 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-20 12:26:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:33,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:33,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-20 12:26:33,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:33,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1207343845] [2020-07-20 12:26:33,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:33,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:33,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081043120] [2020-07-20 12:26:33,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:33,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:33,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:33,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:33,356 INFO L87 Difference]: Start difference. First operand 5026 states and 6070 transitions. Second operand 3 states. [2020-07-20 12:26:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:33,612 INFO L93 Difference]: Finished difference Result 12599 states and 15757 transitions. [2020-07-20 12:26:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:33,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2020-07-20 12:26:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:33,648 INFO L225 Difference]: With dead ends: 12599 [2020-07-20 12:26:33,648 INFO L226 Difference]: Without dead ends: 7595 [2020-07-20 12:26:33,662 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 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-20 12:26:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7595 states. [2020-07-20 12:26:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7595 to 7071. [2020-07-20 12:26:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7071 states. [2020-07-20 12:26:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7071 states to 7071 states and 8533 transitions. [2020-07-20 12:26:34,058 INFO L78 Accepts]: Start accepts. Automaton has 7071 states and 8533 transitions. Word has length 207 [2020-07-20 12:26:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:34,059 INFO L479 AbstractCegarLoop]: Abstraction has 7071 states and 8533 transitions. [2020-07-20 12:26:34,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 7071 states and 8533 transitions. [2020-07-20 12:26:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-07-20 12:26:34,072 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:34,073 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-20 12:26:34,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:34,287 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash -207236985, now seen corresponding path program 1 times [2020-07-20 12:26:34,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:34,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468414350] [2020-07-20 12:26:34,288 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-20 12:26:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:34,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 12:26:34,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:34,569 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-20 12:26:34,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:34,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468414350] [2020-07-20 12:26:34,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:34,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 12:26:34,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647139870] [2020-07-20 12:26:34,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:26:34,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:26:34,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:34,572 INFO L87 Difference]: Start difference. First operand 7071 states and 8533 transitions. Second operand 6 states. [2020-07-20 12:26:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:34,834 INFO L93 Difference]: Finished difference Result 12083 states and 14756 transitions. [2020-07-20 12:26:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:26:34,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2020-07-20 12:26:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:34,850 INFO L225 Difference]: With dead ends: 12083 [2020-07-20 12:26:34,850 INFO L226 Difference]: Without dead ends: 2634 [2020-07-20 12:26:34,866 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-20 12:26:34,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2020-07-20 12:26:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2634. [2020-07-20 12:26:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2634 states. [2020-07-20 12:26:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3036 transitions. [2020-07-20 12:26:35,014 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3036 transitions. Word has length 208 [2020-07-20 12:26:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:35,015 INFO L479 AbstractCegarLoop]: Abstraction has 2634 states and 3036 transitions. [2020-07-20 12:26:35,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:26:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3036 transitions. [2020-07-20 12:26:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-07-20 12:26:35,019 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:35,020 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-20 12:26:35,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:35,233 INFO L427 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:35,233 INFO L82 PathProgramCache]: Analyzing trace with hash -931195261, now seen corresponding path program 1 times [2020-07-20 12:26:35,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:35,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804591090] [2020-07-20 12:26:35,234 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-20 12:26:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:35,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 12:26:35,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:35,410 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-20 12:26:35,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:35,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804591090] [2020-07-20 12:26:35,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:35,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 12:26:35,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201537764] [2020-07-20 12:26:35,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:26:35,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:26:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:35,413 INFO L87 Difference]: Start difference. First operand 2634 states and 3036 transitions. Second operand 6 states. [2020-07-20 12:26:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:35,557 INFO L93 Difference]: Finished difference Result 5333 states and 6246 transitions. [2020-07-20 12:26:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:26:35,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2020-07-20 12:26:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:35,569 INFO L225 Difference]: With dead ends: 5333 [2020-07-20 12:26:35,569 INFO L226 Difference]: Without dead ends: 2720 [2020-07-20 12:26:35,574 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-20 12:26:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2020-07-20 12:26:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2704. [2020-07-20 12:26:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2020-07-20 12:26:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3081 transitions. [2020-07-20 12:26:35,763 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3081 transitions. Word has length 208 [2020-07-20 12:26:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:35,764 INFO L479 AbstractCegarLoop]: Abstraction has 2704 states and 3081 transitions. [2020-07-20 12:26:35,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:26:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3081 transitions. [2020-07-20 12:26:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-07-20 12:26:35,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:35,770 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-20 12:26:35,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:35,984 INFO L427 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash 89354437, now seen corresponding path program 1 times [2020-07-20 12:26:35,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:35,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [636888083] [2020-07-20 12:26:35,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 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-20 12:26:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 12:26:36,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 12:26:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 12:26:36,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 12:26:36,565 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 12:26:36,565 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 12:26:36,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:36,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 12:26:36 BoogieIcfgContainer [2020-07-20 12:26:36,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 12:26:36,993 INFO L168 Benchmark]: Toolchain (without parser) took 20974.89 ms. Allocated memory was 137.4 MB in the beginning and 922.7 MB in the end (delta: 785.4 MB). Free memory was 100.1 MB in the beginning and 759.4 MB in the end (delta: -659.3 MB). Peak memory consumption was 126.1 MB. Max. memory is 7.1 GB. [2020-07-20 12:26:36,993 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-20 12:26:36,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.73 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 179.0 MB in the end (delta: -79.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-07-20 12:26:36,994 INFO L168 Benchmark]: Boogie Preprocessor took 52.96 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 177.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-20 12:26:36,995 INFO L168 Benchmark]: RCFGBuilder took 620.87 ms. Allocated memory is still 201.9 MB. Free memory was 177.0 MB in the beginning and 140.9 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2020-07-20 12:26:37,000 INFO L168 Benchmark]: TraceAbstraction took 19852.02 ms. Allocated memory was 201.9 MB in the beginning and 922.7 MB in the end (delta: 720.9 MB). Free memory was 140.3 MB in the beginning and 759.4 MB in the end (delta: -619.1 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB. [2020-07-20 12:26:37,004 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.32 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 442.73 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 179.0 MB in the end (delta: -79.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.96 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 177.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 620.87 ms. Allocated memory is still 201.9 MB. Free memory was 177.0 MB in the beginning and 140.9 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19852.02 ms. Allocated memory was 201.9 MB in the beginning and 922.7 MB in the end (delta: 720.9 MB). Free memory was 140.3 MB in the beginning and 759.4 MB in the end (delta: -619.1 MB). Peak memory consumption was 101.8 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: 19.5s, OverallIterations: 21, TraceHistogramMax: 3, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5052 SDtfs, 3798 SDslu, 4578 SDs, 0 SdLazy, 1813 SolverSat, 713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2841 GetRequests, 2784 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7071occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 1360 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2902 NumberOfCodeBlocks, 2902 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2830 ConstructedInterpolants, 0 QuantifiedInterpolants, 580244 SizeOfPredicates, 25 NumberOfNonLiveVariables, 12079 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 778/807 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...