/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:23:50,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:23:50,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:23:50,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:23:50,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:23:50,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:23:50,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:23:50,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:23:50,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:23:50,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:23:50,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:23:50,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:23:50,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:23:50,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:23:50,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:23:50,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:23:50,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:23:50,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:23:50,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:23:50,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:23:50,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:23:50,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:23:50,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:23:50,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:23:50,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:23:50,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:23:50,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:23:50,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:23:50,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:23:50,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:23:50,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:23:50,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:23:50,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:23:50,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:23:50,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:23:50,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:23:50,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:23:50,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:23:50,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:23:50,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:23:50,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:23:50,443 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:23:50,456 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:23:50,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:23:50,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:23:50,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:23:50,458 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:23:50,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:23:50,459 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:23:50,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:23:50,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:23:50,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:23:50,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:23:50,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:23:50,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:23:50,460 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:23:50,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:23:50,461 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:23:50,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:23:50,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:23:50,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:23:50,461 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:23:50,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:23:50,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:23:50,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:23:50,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:23:50,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:23:50,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:23:50,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:23:50,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:23:50,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:23:50,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:23:50,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:23:50,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:23:50,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:23:50,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:23:50,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2019-11-06 22:23:50,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fecc58d/23b7311c28f14139a2690bf2117a0ba5/FLAG1c5cb0ef8 [2019-11-06 22:23:51,273 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:23:51,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2019-11-06 22:23:51,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fecc58d/23b7311c28f14139a2690bf2117a0ba5/FLAG1c5cb0ef8 [2019-11-06 22:23:51,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fecc58d/23b7311c28f14139a2690bf2117a0ba5 [2019-11-06 22:23:51,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:23:51,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:23:51,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:23:51,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:23:51,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:23:51,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:51" (1/1) ... [2019-11-06 22:23:51,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6745a18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:51, skipping insertion in model container [2019-11-06 22:23:51,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:51" (1/1) ... [2019-11-06 22:23:51,643 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:23:51,679 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:23:51,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:23:51,882 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:23:52,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:23:52,025 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:23:52,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:52 WrapperNode [2019-11-06 22:23:52,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:23:52,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:23:52,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:23:52,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:23:52,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:52" (1/1) ... [2019-11-06 22:23:52,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:52" (1/1) ... [2019-11-06 22:23:52,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:52" (1/1) ... [2019-11-06 22:23:52,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:52" (1/1) ... [2019-11-06 22:23:52,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:52" (1/1) ... [2019-11-06 22:23:52,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:52" (1/1) ... [2019-11-06 22:23:52,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:52" (1/1) ... [2019-11-06 22:23:52,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:23:52,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:23:52,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:23:52,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:23:52,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:23:52,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:23:52,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:23:52,132 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-06 22:23:52,132 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-11-06 22:23:52,132 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-11-06 22:23:52,132 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-11-06 22:23:52,132 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-11-06 22:23:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-06 22:23:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-06 22:23:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-06 22:23:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-06 22:23:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-06 22:23:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-06 22:23:52,133 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-06 22:23:52,134 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-06 22:23:52,134 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-06 22:23:52,134 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-06 22:23:52,134 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-06 22:23:52,134 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-06 22:23:52,134 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-06 22:23:52,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:23:52,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:23:52,135 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-06 22:23:52,135 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-11-06 22:23:52,135 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-11-06 22:23:52,135 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-06 22:23:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:23:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-11-06 22:23:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-11-06 22:23:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-06 22:23:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-06 22:23:52,136 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-06 22:23:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-06 22:23:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-06 22:23:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-06 22:23:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-06 22:23:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-06 22:23:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-06 22:23:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-06 22:23:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-06 22:23:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-06 22:23:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:23:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:23:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:23:52,697 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:23:52,697 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-06 22:23:52,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:52 BoogieIcfgContainer [2019-11-06 22:23:52,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:23:52,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:23:52,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:23:52,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:23:52,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:23:51" (1/3) ... [2019-11-06 22:23:52,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b68e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:52, skipping insertion in model container [2019-11-06 22:23:52,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:52" (2/3) ... [2019-11-06 22:23:52,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b68e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:52, skipping insertion in model container [2019-11-06 22:23:52,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:52" (3/3) ... [2019-11-06 22:23:52,706 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-11-06 22:23:52,716 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:23:52,736 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:23:52,748 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:23:52,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:23:52,786 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:23:52,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:23:52,786 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:23:52,786 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:23:52,786 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:23:52,787 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:23:52,787 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:23:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-06 22:23:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-06 22:23:52,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:52,823 INFO L410 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] [2019-11-06 22:23:52,825 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash -540085109, now seen corresponding path program 1 times [2019-11-06 22:23:52,842 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:52,843 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166337816] [2019-11-06 22:23:52,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:53,437 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166337816] [2019-11-06 22:23:53,438 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:53,438 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:23:53,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658795418] [2019-11-06 22:23:53,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:23:53,446 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:53,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:23:53,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:23:53,464 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 9 states. [2019-11-06 22:23:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:55,582 INFO L93 Difference]: Finished difference Result 522 states and 794 transitions. [2019-11-06 22:23:55,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:23:55,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-11-06 22:23:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:55,619 INFO L225 Difference]: With dead ends: 522 [2019-11-06 22:23:55,620 INFO L226 Difference]: Without dead ends: 371 [2019-11-06 22:23:55,628 INFO L630 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 [2019-11-06 22:23:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-06 22:23:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 257. [2019-11-06 22:23:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-06 22:23:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 346 transitions. [2019-11-06 22:23:55,740 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 346 transitions. Word has length 78 [2019-11-06 22:23:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:55,741 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 346 transitions. [2019-11-06 22:23:55,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:23:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2019-11-06 22:23:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-06 22:23:55,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:55,751 INFO L410 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] [2019-11-06 22:23:55,751 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:55,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash 211359051, now seen corresponding path program 1 times [2019-11-06 22:23:55,753 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:55,753 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268416023] [2019-11-06 22:23:55,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:56,006 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268416023] [2019-11-06 22:23:56,006 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:56,006 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:23:56,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085374835] [2019-11-06 22:23:56,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:23:56,009 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:56,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:23:56,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:23:56,010 INFO L87 Difference]: Start difference. First operand 257 states and 346 transitions. Second operand 10 states. [2019-11-06 22:23:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:57,079 INFO L93 Difference]: Finished difference Result 599 states and 848 transitions. [2019-11-06 22:23:57,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:23:57,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-11-06 22:23:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:57,085 INFO L225 Difference]: With dead ends: 599 [2019-11-06 22:23:57,085 INFO L226 Difference]: Without dead ends: 361 [2019-11-06 22:23:57,088 INFO L630 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 [2019-11-06 22:23:57,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-06 22:23:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 257. [2019-11-06 22:23:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-06 22:23:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2019-11-06 22:23:57,137 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 78 [2019-11-06 22:23:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:57,137 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2019-11-06 22:23:57,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:23:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2019-11-06 22:23:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-06 22:23:57,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:57,140 INFO L410 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] [2019-11-06 22:23:57,140 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:57,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2119705461, now seen corresponding path program 1 times [2019-11-06 22:23:57,141 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:57,141 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390503245] [2019-11-06 22:23:57,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:57,339 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390503245] [2019-11-06 22:23:57,339 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:57,339 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:23:57,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610002000] [2019-11-06 22:23:57,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:23:57,340 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:57,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:23:57,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:23:57,341 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand 10 states. [2019-11-06 22:23:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:58,654 INFO L93 Difference]: Finished difference Result 722 states and 1058 transitions. [2019-11-06 22:23:58,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 22:23:58,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-11-06 22:23:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:58,662 INFO L225 Difference]: With dead ends: 722 [2019-11-06 22:23:58,663 INFO L226 Difference]: Without dead ends: 484 [2019-11-06 22:23:58,666 INFO L630 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 [2019-11-06 22:23:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-11-06 22:23:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 309. [2019-11-06 22:23:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-06 22:23:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 392 transitions. [2019-11-06 22:23:58,725 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 392 transitions. Word has length 78 [2019-11-06 22:23:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:58,726 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 392 transitions. [2019-11-06 22:23:58,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:23:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 392 transitions. [2019-11-06 22:23:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-06 22:23:58,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:58,728 INFO L410 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] [2019-11-06 22:23:58,728 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash -579817174, now seen corresponding path program 1 times [2019-11-06 22:23:58,729 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:58,729 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179317961] [2019-11-06 22:23:58,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:58,914 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179317961] [2019-11-06 22:23:58,914 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:58,914 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:23:58,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428374475] [2019-11-06 22:23:58,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:23:58,915 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:58,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:23:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:23:58,916 INFO L87 Difference]: Start difference. First operand 309 states and 392 transitions. Second operand 10 states. [2019-11-06 22:24:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:00,325 INFO L93 Difference]: Finished difference Result 744 states and 1001 transitions. [2019-11-06 22:24:00,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:24:00,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-11-06 22:24:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:00,330 INFO L225 Difference]: With dead ends: 744 [2019-11-06 22:24:00,330 INFO L226 Difference]: Without dead ends: 455 [2019-11-06 22:24:00,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-06 22:24:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-06 22:24:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 329. [2019-11-06 22:24:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-06 22:24:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 412 transitions. [2019-11-06 22:24:00,376 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 412 transitions. Word has length 78 [2019-11-06 22:24:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:00,376 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 412 transitions. [2019-11-06 22:24:00,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 412 transitions. [2019-11-06 22:24:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-06 22:24:00,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:00,379 INFO L410 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] [2019-11-06 22:24:00,379 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:00,380 INFO L82 PathProgramCache]: Analyzing trace with hash -156170452, now seen corresponding path program 1 times [2019-11-06 22:24:00,380 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:00,380 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795305021] [2019-11-06 22:24:00,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:00,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:00,561 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795305021] [2019-11-06 22:24:00,561 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:00,561 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:00,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54092701] [2019-11-06 22:24:00,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:00,562 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:00,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:00,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:00,563 INFO L87 Difference]: Start difference. First operand 329 states and 412 transitions. Second operand 10 states. [2019-11-06 22:24:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:02,025 INFO L93 Difference]: Finished difference Result 774 states and 1027 transitions. [2019-11-06 22:24:02,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:24:02,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-11-06 22:24:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:02,030 INFO L225 Difference]: With dead ends: 774 [2019-11-06 22:24:02,030 INFO L226 Difference]: Without dead ends: 465 [2019-11-06 22:24:02,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:24:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-11-06 22:24:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 339. [2019-11-06 22:24:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-11-06 22:24:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 420 transitions. [2019-11-06 22:24:02,074 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 420 transitions. Word has length 78 [2019-11-06 22:24:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:02,075 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 420 transitions. [2019-11-06 22:24:02,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 420 transitions. [2019-11-06 22:24:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-06 22:24:02,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:02,078 INFO L410 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] [2019-11-06 22:24:02,079 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:02,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash 118589162, now seen corresponding path program 1 times [2019-11-06 22:24:02,079 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:02,079 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263133257] [2019-11-06 22:24:02,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:02,266 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263133257] [2019-11-06 22:24:02,268 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:02,268 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:02,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740593044] [2019-11-06 22:24:02,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:02,269 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:02,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:02,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:02,270 INFO L87 Difference]: Start difference. First operand 339 states and 420 transitions. Second operand 10 states. [2019-11-06 22:24:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:03,745 INFO L93 Difference]: Finished difference Result 920 states and 1216 transitions. [2019-11-06 22:24:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 22:24:03,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-11-06 22:24:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:03,755 INFO L225 Difference]: With dead ends: 920 [2019-11-06 22:24:03,755 INFO L226 Difference]: Without dead ends: 600 [2019-11-06 22:24:03,758 INFO L630 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 [2019-11-06 22:24:03,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-11-06 22:24:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 375. [2019-11-06 22:24:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-11-06 22:24:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 445 transitions. [2019-11-06 22:24:03,811 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 445 transitions. Word has length 78 [2019-11-06 22:24:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:03,812 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 445 transitions. [2019-11-06 22:24:03,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 445 transitions. [2019-11-06 22:24:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-06 22:24:03,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:03,815 INFO L410 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] [2019-11-06 22:24:03,816 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:03,816 INFO L82 PathProgramCache]: Analyzing trace with hash 180628776, now seen corresponding path program 1 times [2019-11-06 22:24:03,817 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:03,817 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275570935] [2019-11-06 22:24:03,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:04,015 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275570935] [2019-11-06 22:24:04,015 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:04,015 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:24:04,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377372820] [2019-11-06 22:24:04,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:24:04,017 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:04,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:24:04,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:24:04,018 INFO L87 Difference]: Start difference. First operand 375 states and 445 transitions. Second operand 7 states. [2019-11-06 22:24:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:05,188 INFO L93 Difference]: Finished difference Result 1208 states and 1535 transitions. [2019-11-06 22:24:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:24:05,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2019-11-06 22:24:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:05,196 INFO L225 Difference]: With dead ends: 1208 [2019-11-06 22:24:05,196 INFO L226 Difference]: Without dead ends: 853 [2019-11-06 22:24:05,198 INFO L630 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 [2019-11-06 22:24:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-11-06 22:24:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 751. [2019-11-06 22:24:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-11-06 22:24:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 921 transitions. [2019-11-06 22:24:05,294 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 921 transitions. Word has length 78 [2019-11-06 22:24:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:05,294 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 921 transitions. [2019-11-06 22:24:05,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:24:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 921 transitions. [2019-11-06 22:24:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-06 22:24:05,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:05,302 INFO L410 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] [2019-11-06 22:24:05,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:05,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash 972462964, now seen corresponding path program 1 times [2019-11-06 22:24:05,304 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:05,304 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387818724] [2019-11-06 22:24:05,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 22:24:05,524 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387818724] [2019-11-06 22:24:05,524 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358032560] [2019-11-06 22:24:05,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:05,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:24:05,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 22:24:05,676 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:24:05,677 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-11-06 22:24:05,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647801264] [2019-11-06 22:24:05,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:24:05,678 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:05,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:24:05,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:05,678 INFO L87 Difference]: Start difference. First operand 751 states and 921 transitions. Second operand 3 states. [2019-11-06 22:24:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:05,790 INFO L93 Difference]: Finished difference Result 2036 states and 2597 transitions. [2019-11-06 22:24:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:24:05,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-06 22:24:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:05,799 INFO L225 Difference]: With dead ends: 2036 [2019-11-06 22:24:05,800 INFO L226 Difference]: Without dead ends: 1306 [2019-11-06 22:24:05,804 INFO L630 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 [2019-11-06 22:24:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-11-06 22:24:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1302. [2019-11-06 22:24:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2019-11-06 22:24:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1644 transitions. [2019-11-06 22:24:05,911 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1644 transitions. Word has length 123 [2019-11-06 22:24:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:05,911 INFO L462 AbstractCegarLoop]: Abstraction has 1302 states and 1644 transitions. [2019-11-06 22:24:05,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:24:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1644 transitions. [2019-11-06 22:24:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-06 22:24:05,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:05,915 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:06,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:06,120 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:06,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:06,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2022557900, now seen corresponding path program 1 times [2019-11-06 22:24:06,121 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:06,122 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128110473] [2019-11-06 22:24:06,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-06 22:24:06,278 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128110473] [2019-11-06 22:24:06,278 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:06,278 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:24:06,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727946361] [2019-11-06 22:24:06,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:24:06,279 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:24:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:06,280 INFO L87 Difference]: Start difference. First operand 1302 states and 1644 transitions. Second operand 9 states. [2019-11-06 22:24:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:07,414 INFO L93 Difference]: Finished difference Result 2732 states and 3506 transitions. [2019-11-06 22:24:07,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:24:07,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-11-06 22:24:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:07,425 INFO L225 Difference]: With dead ends: 2732 [2019-11-06 22:24:07,425 INFO L226 Difference]: Without dead ends: 1451 [2019-11-06 22:24:07,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:24:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-11-06 22:24:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1349. [2019-11-06 22:24:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2019-11-06 22:24:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1715 transitions. [2019-11-06 22:24:07,556 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1715 transitions. Word has length 123 [2019-11-06 22:24:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:07,556 INFO L462 AbstractCegarLoop]: Abstraction has 1349 states and 1715 transitions. [2019-11-06 22:24:07,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:24:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1715 transitions. [2019-11-06 22:24:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-06 22:24:07,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:07,560 INFO L410 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, 1] [2019-11-06 22:24:07,560 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:07,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash -412905774, now seen corresponding path program 1 times [2019-11-06 22:24:07,561 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:07,561 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178033507] [2019-11-06 22:24:07,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 22:24:07,827 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178033507] [2019-11-06 22:24:07,827 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127414829] [2019-11-06 22:24:07,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:07,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-06 22:24:07,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-06 22:24:07,995 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:24:07,995 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-11-06 22:24:07,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418479728] [2019-11-06 22:24:07,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:24:07,996 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:07,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:24:07,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:07,997 INFO L87 Difference]: Start difference. First operand 1349 states and 1715 transitions. Second operand 3 states. [2019-11-06 22:24:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:08,227 INFO L93 Difference]: Finished difference Result 3635 states and 4783 transitions. [2019-11-06 22:24:08,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:24:08,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-06 22:24:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:08,241 INFO L225 Difference]: With dead ends: 3635 [2019-11-06 22:24:08,241 INFO L226 Difference]: Without dead ends: 1833 [2019-11-06 22:24:08,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2019-11-06 22:24:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1833. [2019-11-06 22:24:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2019-11-06 22:24:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2326 transitions. [2019-11-06 22:24:08,407 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2326 transitions. Word has length 124 [2019-11-06 22:24:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:08,408 INFO L462 AbstractCegarLoop]: Abstraction has 1833 states and 2326 transitions. [2019-11-06 22:24:08,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:24:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2326 transitions. [2019-11-06 22:24:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-06 22:24:08,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:08,412 INFO L410 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] [2019-11-06 22:24:08,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:08,615 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1660958730, now seen corresponding path program 1 times [2019-11-06 22:24:08,616 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:08,617 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625908222] [2019-11-06 22:24:08,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-06 22:24:08,852 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625908222] [2019-11-06 22:24:08,853 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828137654] [2019-11-06 22:24:08,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:24:08,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-06 22:24:08,979 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:24:08,979 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-11-06 22:24:08,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200424242] [2019-11-06 22:24:08,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:24:08,980 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:08,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:24:08,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:08,981 INFO L87 Difference]: Start difference. First operand 1833 states and 2326 transitions. Second operand 3 states. [2019-11-06 22:24:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:09,153 INFO L93 Difference]: Finished difference Result 4060 states and 5414 transitions. [2019-11-06 22:24:09,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:24:09,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-06 22:24:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:09,173 INFO L225 Difference]: With dead ends: 4060 [2019-11-06 22:24:09,173 INFO L226 Difference]: Without dead ends: 2248 [2019-11-06 22:24:09,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2019-11-06 22:24:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2242. [2019-11-06 22:24:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2019-11-06 22:24:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2787 transitions. [2019-11-06 22:24:09,447 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 2787 transitions. Word has length 158 [2019-11-06 22:24:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:09,448 INFO L462 AbstractCegarLoop]: Abstraction has 2242 states and 2787 transitions. [2019-11-06 22:24:09,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:24:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 2787 transitions. [2019-11-06 22:24:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-06 22:24:09,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:09,455 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:09,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:09,660 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:09,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1936418367, now seen corresponding path program 1 times [2019-11-06 22:24:09,661 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:09,662 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777679164] [2019-11-06 22:24:09,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-06 22:24:09,946 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777679164] [2019-11-06 22:24:09,946 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405099786] [2019-11-06 22:24:09,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:10,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 22:24:10,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 43 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-06 22:24:10,227 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:24:10,228 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-11-06 22:24:10,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516989289] [2019-11-06 22:24:10,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 22:24:10,231 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:10,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 22:24:10,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:24:10,232 INFO L87 Difference]: Start difference. First operand 2242 states and 2787 transitions. Second operand 14 states. [2019-11-06 22:24:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:13,096 INFO L93 Difference]: Finished difference Result 4502 states and 5751 transitions. [2019-11-06 22:24:13,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 22:24:13,097 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2019-11-06 22:24:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:13,117 INFO L225 Difference]: With dead ends: 4502 [2019-11-06 22:24:13,117 INFO L226 Difference]: Without dead ends: 2771 [2019-11-06 22:24:13,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2019-11-06 22:24:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2019-11-06 22:24:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2489. [2019-11-06 22:24:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2489 states. [2019-11-06 22:24:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3072 transitions. [2019-11-06 22:24:13,509 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3072 transitions. Word has length 159 [2019-11-06 22:24:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:13,510 INFO L462 AbstractCegarLoop]: Abstraction has 2489 states and 3072 transitions. [2019-11-06 22:24:13,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 22:24:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3072 transitions. [2019-11-06 22:24:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-06 22:24:13,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:13,518 INFO L410 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, 1] [2019-11-06 22:24:13,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:13,733 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1505336733, now seen corresponding path program 1 times [2019-11-06 22:24:13,733 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:13,734 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536153091] [2019-11-06 22:24:13,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-06 22:24:13,957 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536153091] [2019-11-06 22:24:13,957 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925560454] [2019-11-06 22:24:13,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -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 [2019-11-06 22:24:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:24:14,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-06 22:24:14,098 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:24:14,099 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2019-11-06 22:24:14,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992773673] [2019-11-06 22:24:14,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:24:14,100 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:14,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:24:14,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:14,100 INFO L87 Difference]: Start difference. First operand 2489 states and 3072 transitions. Second operand 3 states. [2019-11-06 22:24:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:14,324 INFO L93 Difference]: Finished difference Result 4939 states and 6269 transitions. [2019-11-06 22:24:14,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:24:14,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-06 22:24:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:14,344 INFO L225 Difference]: With dead ends: 4939 [2019-11-06 22:24:14,345 INFO L226 Difference]: Without dead ends: 2471 [2019-11-06 22:24:14,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-11-06 22:24:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2471. [2019-11-06 22:24:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2019-11-06 22:24:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 2972 transitions. [2019-11-06 22:24:14,629 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 2972 transitions. Word has length 177 [2019-11-06 22:24:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:14,630 INFO L462 AbstractCegarLoop]: Abstraction has 2471 states and 2972 transitions. [2019-11-06 22:24:14,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:24:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 2972 transitions. [2019-11-06 22:24:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-06 22:24:14,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:14,634 INFO L410 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] [2019-11-06 22:24:14,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:14,839 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:14,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:14,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1006491229, now seen corresponding path program 1 times [2019-11-06 22:24:14,839 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:14,840 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933305976] [2019-11-06 22:24:14,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-06 22:24:15,071 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933305976] [2019-11-06 22:24:15,071 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031774683] [2019-11-06 22:24:15,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -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 [2019-11-06 22:24:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-06 22:24:15,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-06 22:24:15,225 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:24:15,226 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-11-06 22:24:15,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489108773] [2019-11-06 22:24:15,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:24:15,228 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:24:15,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:15,229 INFO L87 Difference]: Start difference. First operand 2471 states and 2972 transitions. Second operand 3 states. [2019-11-06 22:24:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:15,408 INFO L93 Difference]: Finished difference Result 3609 states and 4354 transitions. [2019-11-06 22:24:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:24:15,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-11-06 22:24:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:15,418 INFO L225 Difference]: With dead ends: 3609 [2019-11-06 22:24:15,419 INFO L226 Difference]: Without dead ends: 1049 [2019-11-06 22:24:15,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-11-06 22:24:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1049. [2019-11-06 22:24:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2019-11-06 22:24:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1189 transitions. [2019-11-06 22:24:15,548 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1189 transitions. Word has length 178 [2019-11-06 22:24:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:15,549 INFO L462 AbstractCegarLoop]: Abstraction has 1049 states and 1189 transitions. [2019-11-06 22:24:15,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:24:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1189 transitions. [2019-11-06 22:24:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-06 22:24:15,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:15,552 INFO L410 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] [2019-11-06 22:24:15,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:15,756 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2053123678, now seen corresponding path program 1 times [2019-11-06 22:24:15,757 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:15,757 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750077755] [2019-11-06 22:24:15,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-06 22:24:16,042 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750077755] [2019-11-06 22:24:16,042 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300681997] [2019-11-06 22:24:16,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -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 [2019-11-06 22:24:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-06 22:24:16,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-06 22:24:16,249 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:24:16,249 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2019-11-06 22:24:16,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444365718] [2019-11-06 22:24:16,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 22:24:16,252 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:16,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 22:24:16,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:24:16,252 INFO L87 Difference]: Start difference. First operand 1049 states and 1189 transitions. Second operand 12 states. [2019-11-06 22:24:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:18,616 INFO L93 Difference]: Finished difference Result 1287 states and 1484 transitions. [2019-11-06 22:24:18,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 22:24:18,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 178 [2019-11-06 22:24:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:18,629 INFO L225 Difference]: With dead ends: 1287 [2019-11-06 22:24:18,629 INFO L226 Difference]: Without dead ends: 1284 [2019-11-06 22:24:18,633 INFO L630 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 [2019-11-06 22:24:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-11-06 22:24:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1236. [2019-11-06 22:24:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2019-11-06 22:24:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1401 transitions. [2019-11-06 22:24:18,857 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1401 transitions. Word has length 178 [2019-11-06 22:24:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:18,858 INFO L462 AbstractCegarLoop]: Abstraction has 1236 states and 1401 transitions. [2019-11-06 22:24:18,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 22:24:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1401 transitions. [2019-11-06 22:24:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-06 22:24:18,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:18,863 INFO L410 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] [2019-11-06 22:24:19,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:19,079 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash 5197958, now seen corresponding path program 1 times [2019-11-06 22:24:19,080 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:19,080 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180308174] [2019-11-06 22:24:19,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-06 22:24:19,351 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180308174] [2019-11-06 22:24:19,351 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232772280] [2019-11-06 22:24:19,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-06 22:24:19,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:24:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-06 22:24:19,497 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:24:19,497 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2019-11-06 22:24:19,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673336169] [2019-11-06 22:24:19,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:24:19,500 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:19,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:24:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:19,500 INFO L87 Difference]: Start difference. First operand 1236 states and 1401 transitions. Second operand 3 states. [2019-11-06 22:24:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:19,610 INFO L93 Difference]: Finished difference Result 2095 states and 2405 transitions. [2019-11-06 22:24:19,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:24:19,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-06 22:24:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:19,619 INFO L225 Difference]: With dead ends: 2095 [2019-11-06 22:24:19,619 INFO L226 Difference]: Without dead ends: 1250 [2019-11-06 22:24:19,622 INFO L630 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 [2019-11-06 22:24:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-11-06 22:24:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2019-11-06 22:24:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-06 22:24:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1421 transitions. [2019-11-06 22:24:19,758 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1421 transitions. Word has length 182 [2019-11-06 22:24:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:19,758 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1421 transitions. [2019-11-06 22:24:19,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:24:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1421 transitions. [2019-11-06 22:24:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-06 22:24:19,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:19,762 INFO L410 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] [2019-11-06 22:24:19,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:24:19,967 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:19,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1390323253, now seen corresponding path program 1 times [2019-11-06 22:24:19,968 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:19,969 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811345207] [2019-11-06 22:24:19,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-06 22:24:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-06 22:24:20,111 INFO L172 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-06 22:24:20,111 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-06 22:24:20,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:24:20 BoogieIcfgContainer [2019-11-06 22:24:20,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 22:24:20,272 INFO L168 Benchmark]: Toolchain (without parser) took 28644.02 ms. Allocated memory was 138.9 MB in the beginning and 588.3 MB in the end (delta: 449.3 MB). Free memory was 102.6 MB in the beginning and 200.3 MB in the end (delta: -97.8 MB). Peak memory consumption was 351.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:24:20,277 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:24:20,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.09 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 181.0 MB in the end (delta: -78.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:24:20,278 INFO L168 Benchmark]: Boogie Preprocessor took 46.10 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 178.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:24:20,284 INFO L168 Benchmark]: RCFGBuilder took 625.68 ms. Allocated memory is still 203.4 MB. Free memory was 178.3 MB in the beginning and 146.7 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:24:20,285 INFO L168 Benchmark]: TraceAbstraction took 27569.71 ms. Allocated memory was 203.4 MB in the beginning and 588.3 MB in the end (delta: 384.8 MB). Free memory was 146.1 MB in the beginning and 200.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 330.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:24:20,291 INFO L335 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 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 398.09 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 181.0 MB in the end (delta: -78.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.10 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 178.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 625.68 ms. Allocated memory is still 203.4 MB. Free memory was 178.3 MB in the beginning and 146.7 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27569.71 ms. Allocated memory was 203.4 MB in the beginning and 588.3 MB in the end (delta: 384.8 MB). Free memory was 146.1 MB in the beginning and 200.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 330.6 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)=7, \old(E_M)=12, \old(local)=3, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=11, \old(m_st)=10, \old(T1_E)=4, \old(t1_i)=13, \old(t1_pc)=8, \old(t1_st)=5, \old(token)=9, 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. Result: UNSAFE, OverallTime: 27.4s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2987 SDtfs, 6766 SDslu, 1455 SDs, 0 SdLazy, 9608 SolverSat, 3398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2026 GetRequests, 1798 SyntacticMatches, 6 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2489occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1414 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 3410 NumberOfCodeBlocks, 3410 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3203 ConstructedInterpolants, 0 QuantifiedInterpolants, 945386 SizeOfPredicates, 9 NumberOfNonLiveVariables, 5274 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 1193/1328 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...