/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 02:04:05,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 02:04:05,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 02:04:05,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 02:04:05,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 02:04:05,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 02:04:05,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 02:04:05,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 02:04:05,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 02:04:05,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 02:04:05,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 02:04:05,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 02:04:05,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 02:04:05,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 02:04:05,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 02:04:05,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 02:04:05,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 02:04:05,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 02:04:05,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 02:04:05,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 02:04:05,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 02:04:05,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 02:04:05,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 02:04:05,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 02:04:05,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 02:04:05,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 02:04:05,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 02:04:05,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 02:04:05,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 02:04:05,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 02:04:05,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 02:04:05,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 02:04:05,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 02:04:05,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 02:04:05,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 02:04:05,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 02:04:05,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 02:04:05,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 02:04:05,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 02:04:05,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 02:04:05,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 02:04:05,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 02:04:05,625 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 02:04:05,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 02:04:05,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 02:04:05,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 02:04:05,627 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 02:04:05,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 02:04:05,628 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 02:04:05,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 02:04:05,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 02:04:05,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 02:04:05,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 02:04:05,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 02:04:05,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 02:04:05,629 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 02:04:05,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 02:04:05,630 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 02:04:05,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 02:04:05,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 02:04:05,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 02:04:05,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 02:04:05,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 02:04:05,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 02:04:05,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 02:04:05,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 02:04:05,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 02:04:05,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 02:04:05,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 02:04:05,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 02:04:05,633 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 02:04:05,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 02:04:05,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 02:04:06,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 02:04:06,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 02:04:06,020 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 02:04:06,021 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 02:04:06,022 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-07-20 02:04:06,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e5038f6/66a4b927665e404886966ec0f5c9818e/FLAG4ea6acc4b [2020-07-20 02:04:06,555 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 02:04:06,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-07-20 02:04:06,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e5038f6/66a4b927665e404886966ec0f5c9818e/FLAG4ea6acc4b [2020-07-20 02:04:06,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5e5038f6/66a4b927665e404886966ec0f5c9818e [2020-07-20 02:04:06,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 02:04:06,914 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 02:04:06,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 02:04:06,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 02:04:06,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 02:04:06,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:04:06" (1/1) ... [2020-07-20 02:04:06,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9b8cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:06, skipping insertion in model container [2020-07-20 02:04:06,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:04:06" (1/1) ... [2020-07-20 02:04:06,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 02:04:06,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 02:04:07,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 02:04:07,201 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 02:04:07,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 02:04:07,352 INFO L208 MainTranslator]: Completed translation [2020-07-20 02:04:07,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:07 WrapperNode [2020-07-20 02:04:07,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 02:04:07,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 02:04:07,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 02:04:07,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 02:04:07,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:07" (1/1) ... [2020-07-20 02:04:07,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:07" (1/1) ... [2020-07-20 02:04:07,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:07" (1/1) ... [2020-07-20 02:04:07,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:07" (1/1) ... [2020-07-20 02:04:07,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:07" (1/1) ... [2020-07-20 02:04:07,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:07" (1/1) ... [2020-07-20 02:04:07,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:07" (1/1) ... [2020-07-20 02:04:07,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 02:04:07,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 02:04:07,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 02:04:07,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 02:04:07,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 02:04:07,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 02:04:07,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 02:04:07,464 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 02:04:07,464 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 02:04:07,464 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 02:04:07,464 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 02:04:07,464 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 02:04:07,465 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 02:04:07,465 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 02:04:07,465 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 02:04:07,465 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 02:04:07,466 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 02:04:07,466 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 02:04:07,466 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 02:04:07,466 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 02:04:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 02:04:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 02:04:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 02:04:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 02:04:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 02:04:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 02:04:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 02:04:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 02:04:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 02:04:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 02:04:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 02:04:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 02:04:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 02:04:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 02:04:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 02:04:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 02:04:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 02:04:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 02:04:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 02:04:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 02:04:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 02:04:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 02:04:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 02:04:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 02:04:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 02:04:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 02:04:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 02:04:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 02:04:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 02:04:07,977 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 02:04:07,977 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 02:04:07,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:04:07 BoogieIcfgContainer [2020-07-20 02:04:07,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 02:04:07,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 02:04:07,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 02:04:07,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 02:04:07,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 02:04:06" (1/3) ... [2020-07-20 02:04:07,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be01e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:04:07, skipping insertion in model container [2020-07-20 02:04:07,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:07" (2/3) ... [2020-07-20 02:04:07,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be01e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:04:07, skipping insertion in model container [2020-07-20 02:04:07,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:04:07" (3/3) ... [2020-07-20 02:04:07,993 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-07-20 02:04:08,004 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 02:04:08,012 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 02:04:08,027 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 02:04:08,054 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 02:04:08,055 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 02:04:08,055 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 02:04:08,055 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 02:04:08,056 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 02:04:08,056 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 02:04:08,056 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 02:04:08,056 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 02:04:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-07-20 02:04:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 02:04:08,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:08,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:08,099 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash -540085109, now seen corresponding path program 1 times [2020-07-20 02:04:08,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:08,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528574927] [2020-07-20 02:04:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 02:04:08,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528574927] [2020-07-20 02:04:08,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:08,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 02:04:08,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658324158] [2020-07-20 02:04:08,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 02:04:08,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:08,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 02:04:08,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-20 02:04:08,702 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 9 states. [2020-07-20 02:04:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:10,841 INFO L93 Difference]: Finished difference Result 522 states and 794 transitions. [2020-07-20 02:04:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 02:04:10,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-07-20 02:04:10,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:10,884 INFO L225 Difference]: With dead ends: 522 [2020-07-20 02:04:10,885 INFO L226 Difference]: Without dead ends: 371 [2020-07-20 02:04:10,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-20 02:04:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-07-20 02:04:11,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 257. [2020-07-20 02:04:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-07-20 02:04:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 346 transitions. [2020-07-20 02:04:11,103 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 346 transitions. Word has length 78 [2020-07-20 02:04:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:11,104 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 346 transitions. [2020-07-20 02:04:11,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 02:04:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2020-07-20 02:04:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 02:04:11,113 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:11,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:11,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 02:04:11,115 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash 211359051, now seen corresponding path program 1 times [2020-07-20 02:04:11,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:11,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765920379] [2020-07-20 02:04:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 02:04:11,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765920379] [2020-07-20 02:04:11,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:11,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:11,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150379204] [2020-07-20 02:04:11,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:11,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:11,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:11,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:11,349 INFO L87 Difference]: Start difference. First operand 257 states and 346 transitions. Second operand 10 states. [2020-07-20 02:04:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:12,541 INFO L93 Difference]: Finished difference Result 599 states and 848 transitions. [2020-07-20 02:04:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 02:04:12,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 02:04:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:12,547 INFO L225 Difference]: With dead ends: 599 [2020-07-20 02:04:12,547 INFO L226 Difference]: Without dead ends: 361 [2020-07-20 02:04:12,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-20 02:04:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-07-20 02:04:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 257. [2020-07-20 02:04:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-07-20 02:04:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2020-07-20 02:04:12,622 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 78 [2020-07-20 02:04:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:12,622 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2020-07-20 02:04:12,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2020-07-20 02:04:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 02:04:12,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:12,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:12,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 02:04:12,631 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2119705461, now seen corresponding path program 1 times [2020-07-20 02:04:12,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:12,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371492581] [2020-07-20 02:04:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 02:04:12,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371492581] [2020-07-20 02:04:12,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:12,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:12,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15210462] [2020-07-20 02:04:12,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:12,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:12,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:12,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:12,861 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand 10 states. [2020-07-20 02:04:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:14,267 INFO L93 Difference]: Finished difference Result 722 states and 1058 transitions. [2020-07-20 02:04:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 02:04:14,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 02:04:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:14,272 INFO L225 Difference]: With dead ends: 722 [2020-07-20 02:04:14,273 INFO L226 Difference]: Without dead ends: 484 [2020-07-20 02:04:14,274 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-07-20 02:04:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-07-20 02:04:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 309. [2020-07-20 02:04:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-07-20 02:04:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 392 transitions. [2020-07-20 02:04:14,314 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 392 transitions. Word has length 78 [2020-07-20 02:04:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:14,315 INFO L479 AbstractCegarLoop]: Abstraction has 309 states and 392 transitions. [2020-07-20 02:04:14,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 392 transitions. [2020-07-20 02:04:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 02:04:14,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:14,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:14,317 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 02:04:14,317 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash -579817174, now seen corresponding path program 1 times [2020-07-20 02:04:14,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:14,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351228962] [2020-07-20 02:04:14,319 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 02:04:14,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351228962] [2020-07-20 02:04:14,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:14,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:14,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801352322] [2020-07-20 02:04:14,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:14,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:14,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:14,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:14,492 INFO L87 Difference]: Start difference. First operand 309 states and 392 transitions. Second operand 10 states. [2020-07-20 02:04:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:15,915 INFO L93 Difference]: Finished difference Result 744 states and 1001 transitions. [2020-07-20 02:04:15,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:04:15,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 02:04:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:15,922 INFO L225 Difference]: With dead ends: 744 [2020-07-20 02:04:15,922 INFO L226 Difference]: Without dead ends: 455 [2020-07-20 02:04:15,925 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-07-20 02:04:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-07-20 02:04:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 329. [2020-07-20 02:04:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2020-07-20 02:04:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 412 transitions. [2020-07-20 02:04:15,969 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 412 transitions. Word has length 78 [2020-07-20 02:04:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:15,971 INFO L479 AbstractCegarLoop]: Abstraction has 329 states and 412 transitions. [2020-07-20 02:04:15,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 412 transitions. [2020-07-20 02:04:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 02:04:15,973 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:15,973 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:15,976 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 02:04:15,976 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash -156170452, now seen corresponding path program 1 times [2020-07-20 02:04:15,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:15,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390036710] [2020-07-20 02:04:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 02:04:16,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390036710] [2020-07-20 02:04:16,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:16,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:16,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637658445] [2020-07-20 02:04:16,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:16,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:16,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:16,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:16,197 INFO L87 Difference]: Start difference. First operand 329 states and 412 transitions. Second operand 10 states. [2020-07-20 02:04:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:17,633 INFO L93 Difference]: Finished difference Result 774 states and 1027 transitions. [2020-07-20 02:04:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 02:04:17,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 02:04:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:17,637 INFO L225 Difference]: With dead ends: 774 [2020-07-20 02:04:17,637 INFO L226 Difference]: Without dead ends: 465 [2020-07-20 02:04:17,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-20 02:04:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-07-20 02:04:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 339. [2020-07-20 02:04:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-07-20 02:04:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 420 transitions. [2020-07-20 02:04:17,670 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 420 transitions. Word has length 78 [2020-07-20 02:04:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:17,670 INFO L479 AbstractCegarLoop]: Abstraction has 339 states and 420 transitions. [2020-07-20 02:04:17,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 420 transitions. [2020-07-20 02:04:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 02:04:17,672 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:17,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:17,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 02:04:17,672 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:17,673 INFO L82 PathProgramCache]: Analyzing trace with hash 118589162, now seen corresponding path program 1 times [2020-07-20 02:04:17,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:17,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084110810] [2020-07-20 02:04:17,673 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 02:04:17,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084110810] [2020-07-20 02:04:17,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:17,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:17,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895318501] [2020-07-20 02:04:17,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:17,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:17,847 INFO L87 Difference]: Start difference. First operand 339 states and 420 transitions. Second operand 10 states. [2020-07-20 02:04:19,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:19,307 INFO L93 Difference]: Finished difference Result 920 states and 1216 transitions. [2020-07-20 02:04:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 02:04:19,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-07-20 02:04:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:19,314 INFO L225 Difference]: With dead ends: 920 [2020-07-20 02:04:19,315 INFO L226 Difference]: Without dead ends: 600 [2020-07-20 02:04:19,317 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-07-20 02:04:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-07-20 02:04:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 375. [2020-07-20 02:04:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-20 02:04:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 445 transitions. [2020-07-20 02:04:19,356 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 445 transitions. Word has length 78 [2020-07-20 02:04:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:19,356 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 445 transitions. [2020-07-20 02:04:19,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 445 transitions. [2020-07-20 02:04:19,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 02:04:19,358 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:19,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:19,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 02:04:19,358 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash 180628776, now seen corresponding path program 1 times [2020-07-20 02:04:19,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:19,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748625136] [2020-07-20 02:04:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 02:04:19,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748625136] [2020-07-20 02:04:19,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:19,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 02:04:19,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681409086] [2020-07-20 02:04:19,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 02:04:19,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:19,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 02:04:19,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-20 02:04:19,505 INFO L87 Difference]: Start difference. First operand 375 states and 445 transitions. Second operand 7 states. [2020-07-20 02:04:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:20,858 INFO L93 Difference]: Finished difference Result 1208 states and 1535 transitions. [2020-07-20 02:04:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:04:20,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2020-07-20 02:04:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:20,875 INFO L225 Difference]: With dead ends: 1208 [2020-07-20 02:04:20,875 INFO L226 Difference]: Without dead ends: 853 [2020-07-20 02:04:20,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-20 02:04:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2020-07-20 02:04:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 751. [2020-07-20 02:04:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2020-07-20 02:04:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 921 transitions. [2020-07-20 02:04:20,953 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 921 transitions. Word has length 78 [2020-07-20 02:04:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:20,954 INFO L479 AbstractCegarLoop]: Abstraction has 751 states and 921 transitions. [2020-07-20 02:04:20,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 02:04:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 921 transitions. [2020-07-20 02:04:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-20 02:04:20,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:20,957 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:20,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 02:04:20,957 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:20,957 INFO L82 PathProgramCache]: Analyzing trace with hash 972462964, now seen corresponding path program 1 times [2020-07-20 02:04:20,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:20,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883524694] [2020-07-20 02:04:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-20 02:04:21,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883524694] [2020-07-20 02:04:21,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332919033] [2020-07-20 02:04:21,142 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@21db58ec 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 [2020-07-20 02:04:21,214 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@21db58ec issued 1 check-sat command(s) [2020-07-20 02:04:21,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:04:21,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 02:04:21,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:04:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 02:04:21,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:04:21,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-07-20 02:04:21,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039048306] [2020-07-20 02:04:21,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:04:21,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:21,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:04:21,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:21,308 INFO L87 Difference]: Start difference. First operand 751 states and 921 transitions. Second operand 3 states. [2020-07-20 02:04:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:21,459 INFO L93 Difference]: Finished difference Result 2037 states and 2550 transitions. [2020-07-20 02:04:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:04:21,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2020-07-20 02:04:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:21,468 INFO L225 Difference]: With dead ends: 2037 [2020-07-20 02:04:21,468 INFO L226 Difference]: Without dead ends: 1033 [2020-07-20 02:04:21,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2020-07-20 02:04:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2020-07-20 02:04:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2020-07-20 02:04:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1261 transitions. [2020-07-20 02:04:21,584 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1261 transitions. Word has length 123 [2020-07-20 02:04:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:21,585 INFO L479 AbstractCegarLoop]: Abstraction has 1033 states and 1261 transitions. [2020-07-20 02:04:21,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:04:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1261 transitions. [2020-07-20 02:04:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-07-20 02:04:21,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:21,590 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:21,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-20 02:04:21,804 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:21,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:21,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1660958730, now seen corresponding path program 1 times [2020-07-20 02:04:21,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:21,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4866346] [2020-07-20 02:04:21,806 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-07-20 02:04:22,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4866346] [2020-07-20 02:04:22,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475967903] [2020-07-20 02:04:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1227aaa 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 [2020-07-20 02:04:22,200 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1227aaa issued 3 check-sat command(s) [2020-07-20 02:04:22,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:04:22,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 02:04:22,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:04:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-20 02:04:22,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:04:22,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-07-20 02:04:22,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585879207] [2020-07-20 02:04:22,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:04:22,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:22,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:04:22,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 02:04:22,281 INFO L87 Difference]: Start difference. First operand 1033 states and 1261 transitions. Second operand 3 states. [2020-07-20 02:04:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:22,481 INFO L93 Difference]: Finished difference Result 2498 states and 3083 transitions. [2020-07-20 02:04:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:04:22,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2020-07-20 02:04:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:22,492 INFO L225 Difference]: With dead ends: 2498 [2020-07-20 02:04:22,492 INFO L226 Difference]: Without dead ends: 1485 [2020-07-20 02:04:22,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 02:04:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2020-07-20 02:04:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1473. [2020-07-20 02:04:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2020-07-20 02:04:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 1781 transitions. [2020-07-20 02:04:22,652 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 1781 transitions. Word has length 158 [2020-07-20 02:04:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:22,652 INFO L479 AbstractCegarLoop]: Abstraction has 1473 states and 1781 transitions. [2020-07-20 02:04:22,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:04:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1781 transitions. [2020-07-20 02:04:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-20 02:04:22,657 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:22,657 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:22,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:04:22,870 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:22,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:22,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1249606409, now seen corresponding path program 1 times [2020-07-20 02:04:22,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:22,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935661373] [2020-07-20 02:04:22,871 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-07-20 02:04:23,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935661373] [2020-07-20 02:04:23,096 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097492100] [2020-07-20 02:04:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7ba18e8d 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 [2020-07-20 02:04:23,203 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7ba18e8d issued 2 check-sat command(s) [2020-07-20 02:04:23,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:04:23,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 02:04:23,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:04:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-07-20 02:04:23,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:04:23,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-20 02:04:23,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587202305] [2020-07-20 02:04:23,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:04:23,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:23,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:04:23,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-20 02:04:23,262 INFO L87 Difference]: Start difference. First operand 1473 states and 1781 transitions. Second operand 3 states. [2020-07-20 02:04:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:23,506 INFO L93 Difference]: Finished difference Result 2919 states and 3592 transitions. [2020-07-20 02:04:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:04:23,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-07-20 02:04:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:23,519 INFO L225 Difference]: With dead ends: 2919 [2020-07-20 02:04:23,520 INFO L226 Difference]: Without dead ends: 1467 [2020-07-20 02:04:23,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-20 02:04:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-07-20 02:04:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2020-07-20 02:04:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2020-07-20 02:04:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1753 transitions. [2020-07-20 02:04:23,730 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1753 transitions. Word has length 176 [2020-07-20 02:04:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:23,731 INFO L479 AbstractCegarLoop]: Abstraction has 1467 states and 1753 transitions. [2020-07-20 02:04:23,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:04:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1753 transitions. [2020-07-20 02:04:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-20 02:04:23,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:23,736 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:23,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 02:04:23,951 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1366701111, now seen corresponding path program 1 times [2020-07-20 02:04:23,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:23,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963981979] [2020-07-20 02:04:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-20 02:04:24,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963981979] [2020-07-20 02:04:24,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657287438] [2020-07-20 02:04:24,213 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@76a810de 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 [2020-07-20 02:04:24,278 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@76a810de issued 1 check-sat command(s) [2020-07-20 02:04:24,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:04:24,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 02:04:24,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:04:24,316 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-20 02:04:24,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:04:24,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 02:04:24,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218003192] [2020-07-20 02:04:24,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:04:24,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:24,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:04:24,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:24,319 INFO L87 Difference]: Start difference. First operand 1467 states and 1753 transitions. Second operand 3 states. [2020-07-20 02:04:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:24,498 INFO L93 Difference]: Finished difference Result 3392 states and 4063 transitions. [2020-07-20 02:04:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:04:24,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-07-20 02:04:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:24,505 INFO L225 Difference]: With dead ends: 3392 [2020-07-20 02:04:24,505 INFO L226 Difference]: Without dead ends: 969 [2020-07-20 02:04:24,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-07-20 02:04:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 967. [2020-07-20 02:04:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2020-07-20 02:04:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1109 transitions. [2020-07-20 02:04:24,644 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1109 transitions. Word has length 177 [2020-07-20 02:04:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:24,644 INFO L479 AbstractCegarLoop]: Abstraction has 967 states and 1109 transitions. [2020-07-20 02:04:24,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:04:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1109 transitions. [2020-07-20 02:04:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-20 02:04:24,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:24,648 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:24,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:04:24,861 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:24,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash -816293866, now seen corresponding path program 1 times [2020-07-20 02:04:24,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:24,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745342974] [2020-07-20 02:04:24,862 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 43 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-07-20 02:04:25,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745342974] [2020-07-20 02:04:25,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319219459] [2020-07-20 02:04:25,110 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1a3732f2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:04:25,278 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1a3732f2 issued 4 check-sat command(s) [2020-07-20 02:04:25,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:04:25,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 02:04:25,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:04:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-20 02:04:25,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:04:25,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 02:04:25,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639422403] [2020-07-20 02:04:25,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:04:25,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:25,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:04:25,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:25,327 INFO L87 Difference]: Start difference. First operand 967 states and 1109 transitions. Second operand 3 states. [2020-07-20 02:04:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:25,429 INFO L93 Difference]: Finished difference Result 1731 states and 2028 transitions. [2020-07-20 02:04:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:04:25,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-07-20 02:04:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:25,436 INFO L225 Difference]: With dead ends: 1731 [2020-07-20 02:04:25,437 INFO L226 Difference]: Without dead ends: 967 [2020-07-20 02:04:25,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2020-07-20 02:04:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2020-07-20 02:04:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2020-07-20 02:04:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1101 transitions. [2020-07-20 02:04:25,534 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1101 transitions. Word has length 177 [2020-07-20 02:04:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:25,537 INFO L479 AbstractCegarLoop]: Abstraction has 967 states and 1101 transitions. [2020-07-20 02:04:25,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:04:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1101 transitions. [2020-07-20 02:04:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-07-20 02:04:25,540 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:25,540 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:25,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-20 02:04:25,755 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:25,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2053123678, now seen corresponding path program 1 times [2020-07-20 02:04:25,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:25,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712831929] [2020-07-20 02:04:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-07-20 02:04:26,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712831929] [2020-07-20 02:04:26,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829940905] [2020-07-20 02:04:26,090 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@54be1258 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:04:26,245 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@54be1258 issued 4 check-sat command(s) [2020-07-20 02:04:26,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:04:26,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 02:04:26,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:04:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-20 02:04:26,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 02:04:26,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-07-20 02:04:26,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582550150] [2020-07-20 02:04:26,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 02:04:26,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:26,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 02:04:26,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-20 02:04:26,358 INFO L87 Difference]: Start difference. First operand 967 states and 1101 transitions. Second operand 12 states. [2020-07-20 02:04:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:28,596 INFO L93 Difference]: Finished difference Result 1223 states and 1418 transitions. [2020-07-20 02:04:28,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 02:04:28,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 178 [2020-07-20 02:04:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:28,606 INFO L225 Difference]: With dead ends: 1223 [2020-07-20 02:04:28,607 INFO L226 Difference]: Without dead ends: 1220 [2020-07-20 02:04:28,608 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-07-20 02:04:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-07-20 02:04:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1172. [2020-07-20 02:04:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2020-07-20 02:04:28,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1335 transitions. [2020-07-20 02:04:28,739 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1335 transitions. Word has length 178 [2020-07-20 02:04:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:28,739 INFO L479 AbstractCegarLoop]: Abstraction has 1172 states and 1335 transitions. [2020-07-20 02:04:28,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 02:04:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1335 transitions. [2020-07-20 02:04:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-07-20 02:04:28,743 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:28,743 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:28,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:04:28,959 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:28,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:28,960 INFO L82 PathProgramCache]: Analyzing trace with hash 5197958, now seen corresponding path program 1 times [2020-07-20 02:04:28,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:28,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303661249] [2020-07-20 02:04:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-07-20 02:04:29,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303661249] [2020-07-20 02:04:29,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259643930] [2020-07-20 02:04:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@69ab1b4a No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:04:29,425 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@69ab1b4a issued 4 check-sat command(s) [2020-07-20 02:04:29,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:04:29,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 02:04:29,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:04:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-07-20 02:04:29,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:04:29,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-07-20 02:04:29,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178894715] [2020-07-20 02:04:29,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:04:29,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:04:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 02:04:29,497 INFO L87 Difference]: Start difference. First operand 1172 states and 1335 transitions. Second operand 3 states. [2020-07-20 02:04:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:29,602 INFO L93 Difference]: Finished difference Result 1969 states and 2271 transitions. [2020-07-20 02:04:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:04:29,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-07-20 02:04:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:29,613 INFO L225 Difference]: With dead ends: 1969 [2020-07-20 02:04:29,613 INFO L226 Difference]: Without dead ends: 1186 [2020-07-20 02:04:29,617 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 02:04:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-07-20 02:04:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2020-07-20 02:04:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2020-07-20 02:04:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1353 transitions. [2020-07-20 02:04:29,735 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1353 transitions. Word has length 182 [2020-07-20 02:04:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:29,736 INFO L479 AbstractCegarLoop]: Abstraction has 1186 states and 1353 transitions. [2020-07-20 02:04:29,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:04:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1353 transitions. [2020-07-20 02:04:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-07-20 02:04:29,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:29,739 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:29,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-20 02:04:29,954 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1390323253, now seen corresponding path program 1 times [2020-07-20 02:04:29,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:29,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801173699] [2020-07-20 02:04:29,956 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2cf61104 [2020-07-20 02:04:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 02:04:29,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 02:04:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 02:04:30,014 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 02:04:30,094 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 02:04:30,095 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 02:04:30,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-20 02:04:30,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 02:04:30 BoogieIcfgContainer [2020-07-20 02:04:30,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 02:04:30,290 INFO L168 Benchmark]: Toolchain (without parser) took 23372.77 ms. Allocated memory was 137.9 MB in the beginning and 520.6 MB in the end (delta: 382.7 MB). Free memory was 103.0 MB in the beginning and 325.8 MB in the end (delta: -222.8 MB). Peak memory consumption was 160.0 MB. Max. memory is 7.1 GB. [2020-07-20 02:04:30,293 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 02:04:30,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.01 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.6 MB in the beginning and 179.8 MB in the end (delta: -77.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-20 02:04:30,301 INFO L168 Benchmark]: Boogie Preprocessor took 47.22 ms. Allocated memory is still 201.9 MB. Free memory was 179.8 MB in the beginning and 177.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-20 02:04:30,301 INFO L168 Benchmark]: RCFGBuilder took 582.43 ms. Allocated memory is still 201.9 MB. Free memory was 177.3 MB in the beginning and 144.7 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2020-07-20 02:04:30,303 INFO L168 Benchmark]: TraceAbstraction took 22298.76 ms. Allocated memory was 201.9 MB in the beginning and 520.6 MB in the end (delta: 318.8 MB). Free memory was 144.0 MB in the beginning and 325.8 MB in the end (delta: -181.8 MB). Peak memory consumption was 137.0 MB. Max. memory is 7.1 GB. [2020-07-20 02:04:30,307 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 438.01 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.6 MB in the beginning and 179.8 MB in the end (delta: -77.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.22 ms. Allocated memory is still 201.9 MB. Free memory was 179.8 MB in the beginning and 177.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 582.43 ms. Allocated memory is still 201.9 MB. Free memory was 177.3 MB in the beginning and 144.7 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22298.76 ms. Allocated memory was 201.9 MB in the beginning and 520.6 MB in the end (delta: 318.8 MB). Free memory was 144.0 MB in the beginning and 325.8 MB in the end (delta: -181.8 MB). Peak memory consumption was 137.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=6, \old(M_E)=17, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=7, \old(t1_i)=16, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L479] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L390] m_i = 1 [L391] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L479] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L480] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=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, token=0] [L423] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=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, token=0] [L424] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L424] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=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, token=0] [L425] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L261] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L266] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L271] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L276] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L425] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=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, token=0] [L426] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=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, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=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, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=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, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=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, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=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, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=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, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, tmp=0, tmp___0=0, token=0] [L426] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=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, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L289] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L294] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L299] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L304] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L427] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=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, token=0] [L430] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=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, token=0] [L433] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, local=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, token=0] [L434] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L208] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=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, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=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, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=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, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, tmp=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, tmp=1, tmp_ndt_1=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=2, local=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, token=0] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=2, local=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, tmp_var=0, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=2, local=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, tmp_var=0, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, tmp_var=0, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, token=0] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, __retres1=0, E_1=1, E_M=2, local=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, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=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, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=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, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, __retres1=1, E_1=1, E_M=2, local=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, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=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, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=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, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, token=0] [L51] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=1, E_M=2, local=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, tmp_var=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L228] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=2, local=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, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=2, local=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, token=0] [L93] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=2, local=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, token=0] [L109] token += 1 [L110] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=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, token=1] [L111] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=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, token=1] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=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, token=1] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=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, token=1] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=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, token=1] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=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, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=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, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, __retres1=1, E_1=2, E_M=1, local=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, token=1] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=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, token=1] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=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, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L37] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L59] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L64] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L65] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.0s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2615 SDtfs, 5568 SDslu, 1387 SDs, 0 SdLazy, 7548 SolverSat, 2751 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1815 GetRequests, 1626 SyntacticMatches, 4 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1473occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1034 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3071 NumberOfCodeBlocks, 2721 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2867 ConstructedInterpolants, 0 QuantifiedInterpolants, 871578 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3416 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 1204/1280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...