java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 17:15:58,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 17:15:58,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 17:15:58,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 17:15:58,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 17:15:58,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 17:15:58,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 17:15:58,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 17:15:58,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 17:15:58,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 17:15:58,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 17:15:58,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 17:15:58,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 17:15:58,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 17:15:58,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 17:15:58,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 17:15:58,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 17:15:58,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 17:15:58,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 17:15:58,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 17:15:58,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 17:15:58,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 17:15:58,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 17:15:58,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 17:15:58,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 17:15:58,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 17:15:58,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 17:15:58,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 17:15:58,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 17:15:58,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 17:15:58,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 17:15:58,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 17:15:58,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 17:15:58,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 17:15:58,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 17:15:58,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 17:15:58,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 17:15:58,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 17:15:58,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 17:15:58,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 17:15:58,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 17:15:58,430 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 [2019-10-07 17:15:58,450 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 17:15:58,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 17:15:58,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 17:15:58,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 17:15:58,452 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 17:15:58,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 17:15:58,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 17:15:58,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 17:15:58,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 17:15:58,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 17:15:58,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 17:15:58,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 17:15:58,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 17:15:58,454 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 17:15:58,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 17:15:58,454 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 17:15:58,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 17:15:58,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 17:15:58,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 17:15:58,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 17:15:58,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 17:15:58,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:15:58,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 17:15:58,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 17:15:58,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 17:15:58,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 17:15:58,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 17:15:58,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 17:15:58,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 17:15:58,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 17:15:58,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 17:15:58,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 17:15:58,764 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 17:15:58,764 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 17:15:58,765 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2019-10-07 17:15:58,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b812947/af00b4ee86d14d269401e56c22a96036/FLAGdf71e581b [2019-10-07 17:15:59,338 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 17:15:59,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2019-10-07 17:15:59,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b812947/af00b4ee86d14d269401e56c22a96036/FLAGdf71e581b [2019-10-07 17:15:59,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b812947/af00b4ee86d14d269401e56c22a96036 [2019-10-07 17:15:59,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 17:15:59,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 17:15:59,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 17:15:59,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 17:15:59,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 17:15:59,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:15:59" (1/1) ... [2019-10-07 17:15:59,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45070ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:15:59, skipping insertion in model container [2019-10-07 17:15:59,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:15:59" (1/1) ... [2019-10-07 17:15:59,734 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 17:15:59,791 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 17:16:00,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:16:00,012 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 17:16:00,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:16:00,175 INFO L192 MainTranslator]: Completed translation [2019-10-07 17:16:00,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:00 WrapperNode [2019-10-07 17:16:00,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 17:16:00,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 17:16:00,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 17:16:00,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 17:16:00,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:00" (1/1) ... [2019-10-07 17:16:00,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:00" (1/1) ... [2019-10-07 17:16:00,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:00" (1/1) ... [2019-10-07 17:16:00,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:00" (1/1) ... [2019-10-07 17:16:00,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:00" (1/1) ... [2019-10-07 17:16:00,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:00" (1/1) ... [2019-10-07 17:16:00,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:00" (1/1) ... [2019-10-07 17:16:00,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 17:16:00,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 17:16:00,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 17:16:00,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 17:16:00,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:00" (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 [2019-10-07 17:16:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 17:16:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 17:16:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-07 17:16:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-07 17:16:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-07 17:16:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-07 17:16:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-07 17:16:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-07 17:16:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-07 17:16:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-07 17:16:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-07 17:16:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-07 17:16:00,284 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-07 17:16:00,284 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-07 17:16:00,284 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-07 17:16:00,284 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-07 17:16:00,284 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-07 17:16:00,284 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-07 17:16:00,285 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-07 17:16:00,285 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-07 17:16:00,285 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-07 17:16:00,285 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-07 17:16:00,285 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 17:16:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 17:16:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 17:16:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-07 17:16:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-07 17:16:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-07 17:16:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-07 17:16:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-07 17:16:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-07 17:16:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-07 17:16:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-07 17:16:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-07 17:16:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-07 17:16:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-07 17:16:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-07 17:16:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-07 17:16:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-07 17:16:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-07 17:16:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-07 17:16:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-07 17:16:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-07 17:16:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-07 17:16:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-07 17:16:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 17:16:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 17:16:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 17:16:01,192 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 17:16:01,192 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-07 17:16:01,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:16:01 BoogieIcfgContainer [2019-10-07 17:16:01,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 17:16:01,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 17:16:01,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 17:16:01,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 17:16:01,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 05:15:59" (1/3) ... [2019-10-07 17:16:01,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63646d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:16:01, skipping insertion in model container [2019-10-07 17:16:01,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:16:00" (2/3) ... [2019-10-07 17:16:01,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63646d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:16:01, skipping insertion in model container [2019-10-07 17:16:01,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:16:01" (3/3) ... [2019-10-07 17:16:01,202 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2019-10-07 17:16:01,212 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 17:16:01,221 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 17:16:01,233 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 17:16:01,257 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 17:16:01,258 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 17:16:01,258 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 17:16:01,258 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 17:16:01,258 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 17:16:01,259 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 17:16:01,259 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 17:16:01,259 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 17:16:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-10-07 17:16:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-07 17:16:01,290 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:01,291 INFO L385 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] [2019-10-07 17:16:01,293 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:01,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1953432145, now seen corresponding path program 1 times [2019-10-07 17:16:01,309 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:01,310 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:01,310 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:01,311 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:01,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:16:01,645 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:01,645 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:01,646 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:16:01,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:16:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:16:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:01,668 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-10-07 17:16:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:01,764 INFO L93 Difference]: Finished difference Result 328 states and 445 transitions. [2019-10-07 17:16:01,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:16:01,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-07 17:16:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:01,782 INFO L225 Difference]: With dead ends: 328 [2019-10-07 17:16:01,783 INFO L226 Difference]: Without dead ends: 209 [2019-10-07 17:16:01,788 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-07 17:16:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-10-07 17:16:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-07 17:16:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 270 transitions. [2019-10-07 17:16:01,873 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 270 transitions. Word has length 64 [2019-10-07 17:16:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:01,874 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 270 transitions. [2019-10-07 17:16:01,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:16:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 270 transitions. [2019-10-07 17:16:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-07 17:16:01,881 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:01,881 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 17:16:01,882 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:01,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:01,883 INFO L82 PathProgramCache]: Analyzing trace with hash 244655769, now seen corresponding path program 1 times [2019-10-07 17:16:01,883 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:01,883 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:01,884 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:01,884 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:16:02,092 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:02,093 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:02,094 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:16:02,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:02,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:02,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:02,101 INFO L87 Difference]: Start difference. First operand 209 states and 270 transitions. Second operand 4 states. [2019-10-07 17:16:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:02,289 INFO L93 Difference]: Finished difference Result 590 states and 792 transitions. [2019-10-07 17:16:02,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:02,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-07 17:16:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:02,298 INFO L225 Difference]: With dead ends: 590 [2019-10-07 17:16:02,299 INFO L226 Difference]: Without dead ends: 398 [2019-10-07 17:16:02,305 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-10-07 17:16:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 327. [2019-10-07 17:16:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-10-07 17:16:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 441 transitions. [2019-10-07 17:16:02,363 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 441 transitions. Word has length 78 [2019-10-07 17:16:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:02,364 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 441 transitions. [2019-10-07 17:16:02,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 441 transitions. [2019-10-07 17:16:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-07 17:16:02,371 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:02,372 INFO L385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:02,375 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:02,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:02,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2111280734, now seen corresponding path program 1 times [2019-10-07 17:16:02,376 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:02,376 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:02,376 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:02,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 17:16:02,478 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:02,479 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:02,479 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:16:02,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:16:02,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:16:02,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:02,482 INFO L87 Difference]: Start difference. First operand 327 states and 441 transitions. Second operand 3 states. [2019-10-07 17:16:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:02,566 INFO L93 Difference]: Finished difference Result 835 states and 1143 transitions. [2019-10-07 17:16:02,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:16:02,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-07 17:16:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:02,575 INFO L225 Difference]: With dead ends: 835 [2019-10-07 17:16:02,575 INFO L226 Difference]: Without dead ends: 525 [2019-10-07 17:16:02,579 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-10-07 17:16:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 417. [2019-10-07 17:16:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-10-07 17:16:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 572 transitions. [2019-10-07 17:16:02,649 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 572 transitions. Word has length 112 [2019-10-07 17:16:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:02,650 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 572 transitions. [2019-10-07 17:16:02,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:16:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 572 transitions. [2019-10-07 17:16:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-07 17:16:02,655 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:02,655 INFO L385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:02,655 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash 77978997, now seen corresponding path program 1 times [2019-10-07 17:16:02,656 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:02,657 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:02,657 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:02,657 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 17:16:02,829 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:02,829 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:16:02,830 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:02,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 17:16:02,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:16:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 17:16:03,044 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:16:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 17:16:03,205 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:16:03,205 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 6 [2019-10-07 17:16:03,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:03,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:03,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:16:03,207 INFO L87 Difference]: Start difference. First operand 417 states and 572 transitions. Second operand 4 states. [2019-10-07 17:16:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:03,455 INFO L93 Difference]: Finished difference Result 1202 states and 1771 transitions. [2019-10-07 17:16:03,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:03,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-07 17:16:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:03,463 INFO L225 Difference]: With dead ends: 1202 [2019-10-07 17:16:03,464 INFO L226 Difference]: Without dead ends: 801 [2019-10-07 17:16:03,468 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:16:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-10-07 17:16:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 780. [2019-10-07 17:16:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-10-07 17:16:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1056 transitions. [2019-10-07 17:16:03,572 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1056 transitions. Word has length 113 [2019-10-07 17:16:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:03,573 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1056 transitions. [2019-10-07 17:16:03,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1056 transitions. [2019-10-07 17:16:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-07 17:16:03,577 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:03,578 INFO L385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:03,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:03,785 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:03,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:03,786 INFO L82 PathProgramCache]: Analyzing trace with hash 8310746, now seen corresponding path program 1 times [2019-10-07 17:16:03,787 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:03,787 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:03,787 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:03,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-07 17:16:03,878 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:03,878 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:03,879 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:16:03,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:16:03,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:16:03,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:03,880 INFO L87 Difference]: Start difference. First operand 780 states and 1056 transitions. Second operand 3 states. [2019-10-07 17:16:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:03,962 INFO L93 Difference]: Finished difference Result 1950 states and 2661 transitions. [2019-10-07 17:16:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:16:03,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-07 17:16:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:03,972 INFO L225 Difference]: With dead ends: 1950 [2019-10-07 17:16:03,972 INFO L226 Difference]: Without dead ends: 1187 [2019-10-07 17:16:03,976 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:16:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-10-07 17:16:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1039. [2019-10-07 17:16:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-10-07 17:16:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1391 transitions. [2019-10-07 17:16:04,051 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1391 transitions. Word has length 113 [2019-10-07 17:16:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:04,051 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 1391 transitions. [2019-10-07 17:16:04,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:16:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1391 transitions. [2019-10-07 17:16:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-07 17:16:04,055 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:04,055 INFO L385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:04,056 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash -846455608, now seen corresponding path program 1 times [2019-10-07 17:16:04,056 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:04,057 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:04,057 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:04,057 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-07 17:16:04,137 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:04,137 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:04,137 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:16:04,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:04,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:04,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:04,138 INFO L87 Difference]: Start difference. First operand 1039 states and 1391 transitions. Second operand 4 states. [2019-10-07 17:16:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:04,367 INFO L93 Difference]: Finished difference Result 2291 states and 3090 transitions. [2019-10-07 17:16:04,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:04,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-07 17:16:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:04,379 INFO L225 Difference]: With dead ends: 2291 [2019-10-07 17:16:04,380 INFO L226 Difference]: Without dead ends: 1269 [2019-10-07 17:16:04,385 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-10-07 17:16:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1265. [2019-10-07 17:16:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-10-07 17:16:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1658 transitions. [2019-10-07 17:16:04,465 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1658 transitions. Word has length 114 [2019-10-07 17:16:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:04,468 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1658 transitions. [2019-10-07 17:16:04,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1658 transitions. [2019-10-07 17:16:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-07 17:16:04,473 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:04,473 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:04,473 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:04,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1944182159, now seen corresponding path program 1 times [2019-10-07 17:16:04,475 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:04,475 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:04,476 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:04,476 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 17:16:04,652 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:04,653 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:04,653 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 17:16:04,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 17:16:04,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 17:16:04,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:16:04,655 INFO L87 Difference]: Start difference. First operand 1265 states and 1658 transitions. Second operand 9 states. [2019-10-07 17:16:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:05,843 INFO L93 Difference]: Finished difference Result 4040 states and 5426 transitions. [2019-10-07 17:16:05,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 17:16:05,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-10-07 17:16:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:05,857 INFO L225 Difference]: With dead ends: 4040 [2019-10-07 17:16:05,858 INFO L226 Difference]: Without dead ends: 1908 [2019-10-07 17:16:05,870 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-10-07 17:16:05,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-10-07 17:16:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1685. [2019-10-07 17:16:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-10-07 17:16:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2193 transitions. [2019-10-07 17:16:05,984 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2193 transitions. Word has length 115 [2019-10-07 17:16:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:05,985 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 2193 transitions. [2019-10-07 17:16:05,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 17:16:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2193 transitions. [2019-10-07 17:16:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-07 17:16:05,990 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:05,990 INFO L385 BasicCegarLoop]: trace histogram [5, 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, 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] [2019-10-07 17:16:05,990 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash -453819748, now seen corresponding path program 1 times [2019-10-07 17:16:05,991 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:05,991 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:05,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:05,992 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-07 17:16:06,216 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:06,216 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:16:06,217 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:06,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 17:16:06,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:16:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:16:06,635 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:16:06,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:06,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:06,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:06,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:16:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-07 17:16:07,027 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:16:07,027 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9, 8] total 22 [2019-10-07 17:16:07,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 17:16:07,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 17:16:07,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-10-07 17:16:07,029 INFO L87 Difference]: Start difference. First operand 1685 states and 2193 transitions. Second operand 11 states. [2019-10-07 17:16:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:08,536 INFO L93 Difference]: Finished difference Result 5793 states and 8152 transitions. [2019-10-07 17:16:08,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 17:16:08,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 138 [2019-10-07 17:16:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:08,586 INFO L225 Difference]: With dead ends: 5793 [2019-10-07 17:16:08,586 INFO L226 Difference]: Without dead ends: 4125 [2019-10-07 17:16:08,608 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=1035, Unknown=0, NotChecked=0, Total=1260 [2019-10-07 17:16:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2019-10-07 17:16:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 3784. [2019-10-07 17:16:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-07 17:16:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5107 transitions. [2019-10-07 17:16:08,995 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5107 transitions. Word has length 138 [2019-10-07 17:16:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:08,999 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5107 transitions. [2019-10-07 17:16:08,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 17:16:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5107 transitions. [2019-10-07 17:16:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-07 17:16:09,007 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:09,008 INFO L385 BasicCegarLoop]: trace histogram [5, 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, 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] [2019-10-07 17:16:09,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:09,215 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:09,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:09,216 INFO L82 PathProgramCache]: Analyzing trace with hash -539214046, now seen corresponding path program 1 times [2019-10-07 17:16:09,217 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:09,217 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:09,217 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:09,217 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:09,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-07 17:16:09,359 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:09,359 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:16:09,359 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:09,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 17:16:09,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:16:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:16:09,570 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:16:09,833 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-10-07 17:16:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-07 17:16:10,226 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:16:10,226 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 6] total 18 [2019-10-07 17:16:10,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 17:16:10,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 17:16:10,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-07 17:16:10,227 INFO L87 Difference]: Start difference. First operand 3784 states and 5107 transitions. Second operand 6 states. [2019-10-07 17:16:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:10,514 INFO L93 Difference]: Finished difference Result 7331 states and 9985 transitions. [2019-10-07 17:16:10,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 17:16:10,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-07 17:16:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:10,543 INFO L225 Difference]: With dead ends: 7331 [2019-10-07 17:16:10,543 INFO L226 Difference]: Without dead ends: 3564 [2019-10-07 17:16:10,565 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-10-07 17:16:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-10-07 17:16:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3100. [2019-10-07 17:16:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3100 states. [2019-10-07 17:16:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4064 transitions. [2019-10-07 17:16:10,795 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4064 transitions. Word has length 140 [2019-10-07 17:16:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:10,796 INFO L462 AbstractCegarLoop]: Abstraction has 3100 states and 4064 transitions. [2019-10-07 17:16:10,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 17:16:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4064 transitions. [2019-10-07 17:16:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-07 17:16:10,806 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:10,809 INFO L385 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:11,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:11,015 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1561917984, now seen corresponding path program 1 times [2019-10-07 17:16:11,016 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:11,016 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:11,016 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:11,016 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 17:16:11,149 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:11,150 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:16:11,150 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:11,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 17:16:11,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:16:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:16:11,481 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:16:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 17:16:11,604 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:16:11,604 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 6 [2019-10-07 17:16:11,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:11,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:16:11,606 INFO L87 Difference]: Start difference. First operand 3100 states and 4064 transitions. Second operand 4 states. [2019-10-07 17:16:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:11,909 INFO L93 Difference]: Finished difference Result 6307 states and 8499 transitions. [2019-10-07 17:16:11,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:11,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-07 17:16:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:11,931 INFO L225 Difference]: With dead ends: 6307 [2019-10-07 17:16:11,931 INFO L226 Difference]: Without dead ends: 3225 [2019-10-07 17:16:11,951 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:16:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2019-10-07 17:16:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3201. [2019-10-07 17:16:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3201 states. [2019-10-07 17:16:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 3972 transitions. [2019-10-07 17:16:12,170 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 3972 transitions. Word has length 145 [2019-10-07 17:16:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:12,171 INFO L462 AbstractCegarLoop]: Abstraction has 3201 states and 3972 transitions. [2019-10-07 17:16:12,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 3972 transitions. [2019-10-07 17:16:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-07 17:16:12,176 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:12,176 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:12,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:16:12,381 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2009742356, now seen corresponding path program 1 times [2019-10-07 17:16:12,382 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:12,382 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:12,383 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:12,383 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:12,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-07 17:16:12,451 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:12,451 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:12,452 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:16:12,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:16:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:16:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:12,453 INFO L87 Difference]: Start difference. First operand 3201 states and 3972 transitions. Second operand 4 states. [2019-10-07 17:16:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:12,816 INFO L93 Difference]: Finished difference Result 4855 states and 6297 transitions. [2019-10-07 17:16:12,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:16:12,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-07 17:16:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:12,839 INFO L225 Difference]: With dead ends: 4855 [2019-10-07 17:16:12,839 INFO L226 Difference]: Without dead ends: 3199 [2019-10-07 17:16:12,848 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:16:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2019-10-07 17:16:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3199. [2019-10-07 17:16:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3199 states. [2019-10-07 17:16:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 3941 transitions. [2019-10-07 17:16:13,047 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 3941 transitions. Word has length 154 [2019-10-07 17:16:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:13,048 INFO L462 AbstractCegarLoop]: Abstraction has 3199 states and 3941 transitions. [2019-10-07 17:16:13,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:16:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 3941 transitions. [2019-10-07 17:16:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-07 17:16:13,052 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:13,053 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:13,053 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:13,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:13,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2109454516, now seen corresponding path program 1 times [2019-10-07 17:16:13,053 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:13,054 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:13,054 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:13,054 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:13,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:16:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-07 17:16:13,170 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:13,171 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:16:13,171 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 17:16:13,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 17:16:13,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 17:16:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:16:13,172 INFO L87 Difference]: Start difference. First operand 3199 states and 3941 transitions. Second operand 7 states. [2019-10-07 17:16:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:16:14,079 INFO L93 Difference]: Finished difference Result 7948 states and 9807 transitions. [2019-10-07 17:16:14,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 17:16:14,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-10-07 17:16:14,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:16:14,110 INFO L225 Difference]: With dead ends: 7948 [2019-10-07 17:16:14,111 INFO L226 Difference]: Without dead ends: 5105 [2019-10-07 17:16:14,120 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-07 17:16:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2019-10-07 17:16:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 5053. [2019-10-07 17:16:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5053 states. [2019-10-07 17:16:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5053 states to 5053 states and 6113 transitions. [2019-10-07 17:16:14,416 INFO L78 Accepts]: Start accepts. Automaton has 5053 states and 6113 transitions. Word has length 155 [2019-10-07 17:16:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:16:14,417 INFO L462 AbstractCegarLoop]: Abstraction has 5053 states and 6113 transitions. [2019-10-07 17:16:14,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 17:16:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 5053 states and 6113 transitions. [2019-10-07 17:16:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-07 17:16:14,422 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:16:14,422 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:16:14,422 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:16:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:16:14,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1752141364, now seen corresponding path program 1 times [2019-10-07 17:16:14,423 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:16:14,423 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:16:14,423 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:14,424 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:16:14,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:16:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-07 17:16:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-07 17:16:14,614 INFO L161 tionRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-10-07 17:16:14,614 INFO L451 BasicCegarLoop]: Counterexample might be feasible [2019-10-07 17:16:14,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 05:16:14 BoogieIcfgContainer [2019-10-07 17:16:14,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 17:16:14,872 INFO L168 Benchmark]: Toolchain (without parser) took 15153.24 ms. Allocated memory was 136.3 MB in the beginning and 613.4 MB in the end (delta: 477.1 MB). Free memory was 100.7 MB in the beginning and 271.6 MB in the end (delta: -170.9 MB). Peak memory consumption was 306.2 MB. Max. memory is 7.1 GB. [2019-10-07 17:16:14,874 INFO L168 Benchmark]: CDTParser took 1.67 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 17:16:14,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.02 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 176.8 MB in the end (delta: -76.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-10-07 17:16:14,882 INFO L168 Benchmark]: Boogie Preprocessor took 46.59 ms. Allocated memory is still 200.8 MB. Free memory was 176.8 MB in the beginning and 174.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-10-07 17:16:14,883 INFO L168 Benchmark]: RCFGBuilder took 971.02 ms. Allocated memory is still 200.8 MB. Free memory was 174.7 MB in the beginning and 109.2 MB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 7.1 GB. [2019-10-07 17:16:14,884 INFO L168 Benchmark]: TraceAbstraction took 13672.85 ms. Allocated memory was 200.8 MB in the beginning and 613.4 MB in the end (delta: 412.6 MB). Free memory was 108.5 MB in the beginning and 271.6 MB in the end (delta: -163.1 MB). Peak memory consumption was 249.5 MB. Max. memory is 7.1 GB. [2019-10-07 17:16:14,896 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.67 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 458.02 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 176.8 MB in the end (delta: -76.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.59 ms. Allocated memory is still 200.8 MB. Free memory was 176.8 MB in the beginning and 174.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 971.02 ms. Allocated memory is still 200.8 MB. Free memory was 174.7 MB in the beginning and 109.2 MB in the end (delta: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13672.85 ms. Allocated memory was 200.8 MB in the beginning and 613.4 MB in the end (delta: 412.6 MB). Free memory was 108.5 MB in the beginning and 271.6 MB in the end (delta: -163.1 MB). Peak memory consumption was 249.5 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; [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 [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 [L216] COND TRUE t1_i == 1 [L217] t1_st = 0 [L221] COND TRUE t2_i == 1 [L222] 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) [L329] COND FALSE !(T1_E == 0) [L334] COND FALSE !(T2_E == 0) [L339] COND FALSE !(E_1 == 0) [L344] COND FALSE !(E_2 == 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); [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); [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); [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)) [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) [L362] COND FALSE !(T1_E == 1) [L367] COND FALSE !(T2_E == 1) [L372] COND FALSE !(E_1 == 1) [L377] COND FALSE !(E_2 == 1) [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 [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 ; [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 [L252] return (__retres1); [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 [L91] t1_pc = 1 [L92] t1_st = 2 [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 [L126] t2_pc = 1 [L127] 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 ; [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 [L252] return (__retres1); [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 [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); [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); [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); [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)) [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 [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 [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); [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); [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); [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 [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 [L91] t1_pc = 1 [L92] t1_st = 2 [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, 123 locations, 1 error locations. Result: UNSAFE, OverallTime: 13.6s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2645 SDtfs, 2389 SDslu, 3408 SDs, 0 SdLazy, 2757 SolverSat, 677 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1197 GetRequests, 1100 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5053occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2133 NumberOfCodeBlocks, 2133 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2493 ConstructedInterpolants, 0 QuantifiedInterpolants, 518724 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2727 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 1006/1051 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...