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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/kundu2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:09:48,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:09:48,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:09:48,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:09:48,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:09:48,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:09:48,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:09:48,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:09:48,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:09:48,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:09:48,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:09:48,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:09:48,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:09:48,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:09:48,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:09:48,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:09:48,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:09:48,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:09:48,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:09:48,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:09:48,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:09:48,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:09:48,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:09:48,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:09:48,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:09:48,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:09:48,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:09:48,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:09:48,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:09:48,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:09:48,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:09:48,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:09:48,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:09:48,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:09:48,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:09:48,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:09:48,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:09:48,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:09:48,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:09:48,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:09:48,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:09:48,786 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:09:48,804 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:09:48,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:09:48,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:09:48,805 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:09:48,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:09:48,805 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:09:48,806 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:09:48,806 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:09:48,806 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:09:48,806 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:09:48,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:09:48,807 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:09:48,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:09:48,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:09:48,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:09:48,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:09:48,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:09:48,808 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:09:48,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:09:48,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:09:48,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:09:48,809 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:09:48,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:09:48,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:48,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:09:48,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:09:48,810 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:09:48,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:09:48,810 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:09:48,811 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:09:48,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:09:48,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:09:48,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:09:48,867 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:09:48,869 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:09:48,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu2.cil.c [2019-10-03 04:09:48,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/446d246ce/7f95a64c182546a689f7cd0d8532030b/FLAG83b28dbc3 [2019-10-03 04:09:49,429 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:09:49,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c [2019-10-03 04:09:49,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/446d246ce/7f95a64c182546a689f7cd0d8532030b/FLAG83b28dbc3 [2019-10-03 04:09:49,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/446d246ce/7f95a64c182546a689f7cd0d8532030b [2019-10-03 04:09:49,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:09:49,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:09:49,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:49,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:09:49,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:09:49,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:49" (1/1) ... [2019-10-03 04:09:49,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283534bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:49, skipping insertion in model container [2019-10-03 04:09:49,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:49" (1/1) ... [2019-10-03 04:09:49,798 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:09:49,849 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:09:50,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:50,123 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:09:50,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:50,275 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:09:50,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:50 WrapperNode [2019-10-03 04:09:50,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:50,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:09:50,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:09:50,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:09:50,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:50" (1/1) ... [2019-10-03 04:09:50,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:50" (1/1) ... [2019-10-03 04:09:50,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:50" (1/1) ... [2019-10-03 04:09:50,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:50" (1/1) ... [2019-10-03 04:09:50,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:50" (1/1) ... [2019-10-03 04:09:50,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:50" (1/1) ... [2019-10-03 04:09:50,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:50" (1/1) ... [2019-10-03 04:09:50,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:09:50,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:09:50,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:09:50,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:09:50,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:09:50,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:09:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-03 04:09:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-03 04:09:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-03 04:09:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-03 04:09:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-03 04:09:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P_2 [2019-10-03 04:09:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_2_triggered [2019-10-03 04:09:50,394 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-03 04:09:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-03 04:09:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-03 04:09:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-03 04:09:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-03 04:09:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-03 04:09:50,395 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-03 04:09:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-03 04:09:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-03 04:09:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-03 04:09:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-03 04:09:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-03 04:09:50,396 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-03 04:09:50,397 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-03 04:09:50,397 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-03 04:09:50,397 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:09:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:09:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:09:50,397 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-03 04:09:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-03 04:09:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-03 04:09:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-03 04:09:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-03 04:09:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-03 04:09:50,398 INFO L130 BoogieDeclarations]: Found specification of procedure P_2 [2019-10-03 04:09:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_2_triggered [2019-10-03 04:09:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-03 04:09:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-03 04:09:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-03 04:09:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-03 04:09:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-03 04:09:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-03 04:09:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-03 04:09:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-03 04:09:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-03 04:09:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-03 04:09:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-03 04:09:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-03 04:09:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-03 04:09:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-03 04:09:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:09:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:09:50,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:09:51,008 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:09:51,008 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-03 04:09:51,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:51 BoogieIcfgContainer [2019-10-03 04:09:51,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:09:51,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:09:51,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:09:51,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:09:51,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:09:49" (1/3) ... [2019-10-03 04:09:51,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ff8012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:51, skipping insertion in model container [2019-10-03 04:09:51,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:50" (2/3) ... [2019-10-03 04:09:51,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ff8012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:51, skipping insertion in model container [2019-10-03 04:09:51,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:51" (3/3) ... [2019-10-03 04:09:51,021 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2019-10-03 04:09:51,031 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:09:51,041 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:09:51,058 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:09:51,094 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:09:51,095 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:09:51,095 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:09:51,095 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:09:51,095 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:09:51,096 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:09:51,097 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:09:51,097 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:09:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2019-10-03 04:09:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-03 04:09:51,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:51,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:51,145 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:51,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1619619400, now seen corresponding path program 1 times [2019-10-03 04:09:51,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:51,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:51,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:51,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:51,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:51,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:09:51,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:51,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:09:51,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:09:51,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:09:51,486 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 4 states. [2019-10-03 04:09:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:51,918 INFO L93 Difference]: Finished difference Result 333 states and 430 transitions. [2019-10-03 04:09:51,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:09:51,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-03 04:09:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:51,937 INFO L225 Difference]: With dead ends: 333 [2019-10-03 04:09:51,937 INFO L226 Difference]: Without dead ends: 319 [2019-10-03 04:09:51,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:09:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-10-03 04:09:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 312. [2019-10-03 04:09:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-03 04:09:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 410 transitions. [2019-10-03 04:09:52,015 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 410 transitions. Word has length 82 [2019-10-03 04:09:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:52,016 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 410 transitions. [2019-10-03 04:09:52,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:09:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 410 transitions. [2019-10-03 04:09:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-03 04:09:52,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:52,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:52,021 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:52,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:52,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1801870201, now seen corresponding path program 1 times [2019-10-03 04:09:52,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:52,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:52,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:52,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:52,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:52,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:52,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:09:52,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:52,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:09:52,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:09:52,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:09:52,203 INFO L87 Difference]: Start difference. First operand 312 states and 410 transitions. Second operand 4 states. [2019-10-03 04:09:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:52,493 INFO L93 Difference]: Finished difference Result 590 states and 765 transitions. [2019-10-03 04:09:52,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:09:52,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-03 04:09:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:52,509 INFO L225 Difference]: With dead ends: 590 [2019-10-03 04:09:52,509 INFO L226 Difference]: Without dead ends: 590 [2019-10-03 04:09:52,510 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:09:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-03 04:09:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 565. [2019-10-03 04:09:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-03 04:09:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 735 transitions. [2019-10-03 04:09:52,583 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 735 transitions. Word has length 82 [2019-10-03 04:09:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:52,583 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 735 transitions. [2019-10-03 04:09:52,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:09:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 735 transitions. [2019-10-03 04:09:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-03 04:09:52,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:52,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:52,591 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:52,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:52,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1148563485, now seen corresponding path program 1 times [2019-10-03 04:09:52,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:52,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:52,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:52,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:52,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:52,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:52,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:09:52,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:52,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:09:52,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:09:52,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:52,783 INFO L87 Difference]: Start difference. First operand 565 states and 735 transitions. Second operand 6 states. [2019-10-03 04:09:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:52,838 INFO L93 Difference]: Finished difference Result 585 states and 761 transitions. [2019-10-03 04:09:52,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:09:52,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-03 04:09:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:52,844 INFO L225 Difference]: With dead ends: 585 [2019-10-03 04:09:52,844 INFO L226 Difference]: Without dead ends: 585 [2019-10-03 04:09:52,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:09:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-03 04:09:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 575. [2019-10-03 04:09:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-03 04:09:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 743 transitions. [2019-10-03 04:09:52,887 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 743 transitions. Word has length 83 [2019-10-03 04:09:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:52,888 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 743 transitions. [2019-10-03 04:09:52,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:09:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 743 transitions. [2019-10-03 04:09:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-03 04:09:52,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:52,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:52,897 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:52,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:52,898 INFO L82 PathProgramCache]: Analyzing trace with hash -223243813, now seen corresponding path program 1 times [2019-10-03 04:09:52,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:52,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:52,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:52,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:52,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:53,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:53,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:09:53,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:53,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:09:53,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:09:53,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:53,051 INFO L87 Difference]: Start difference. First operand 575 states and 743 transitions. Second operand 6 states. [2019-10-03 04:09:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:53,170 INFO L93 Difference]: Finished difference Result 951 states and 1243 transitions. [2019-10-03 04:09:53,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 04:09:53,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-03 04:09:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:53,177 INFO L225 Difference]: With dead ends: 951 [2019-10-03 04:09:53,177 INFO L226 Difference]: Without dead ends: 951 [2019-10-03 04:09:53,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:09:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-10-03 04:09:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 927. [2019-10-03 04:09:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-10-03 04:09:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1213 transitions. [2019-10-03 04:09:53,218 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1213 transitions. Word has length 83 [2019-10-03 04:09:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:53,219 INFO L475 AbstractCegarLoop]: Abstraction has 927 states and 1213 transitions. [2019-10-03 04:09:53,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:09:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1213 transitions. [2019-10-03 04:09:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 04:09:53,221 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:53,221 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:53,221 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:53,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:53,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1894736262, now seen corresponding path program 1 times [2019-10-03 04:09:53,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:53,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:53,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:53,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:53,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:53,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 04:09:53,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:53,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 04:09:53,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 04:09:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-03 04:09:53,433 INFO L87 Difference]: Start difference. First operand 927 states and 1213 transitions. Second operand 8 states. [2019-10-03 04:09:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:55,047 INFO L93 Difference]: Finished difference Result 2131 states and 3066 transitions. [2019-10-03 04:09:55,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 04:09:55,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-10-03 04:09:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:55,066 INFO L225 Difference]: With dead ends: 2131 [2019-10-03 04:09:55,067 INFO L226 Difference]: Without dead ends: 2131 [2019-10-03 04:09:55,068 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-03 04:09:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2019-10-03 04:09:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 2014. [2019-10-03 04:09:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-10-03 04:09:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2850 transitions. [2019-10-03 04:09:55,225 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2850 transitions. Word has length 96 [2019-10-03 04:09:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:55,227 INFO L475 AbstractCegarLoop]: Abstraction has 2014 states and 2850 transitions. [2019-10-03 04:09:55,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 04:09:55,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2850 transitions. [2019-10-03 04:09:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 04:09:55,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:55,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:55,230 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:55,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1165049387, now seen corresponding path program 1 times [2019-10-03 04:09:55,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:55,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:55,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:55,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:55,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:55,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:55,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 04:09:55,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:55,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 04:09:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 04:09:55,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:09:55,481 INFO L87 Difference]: Start difference. First operand 2014 states and 2850 transitions. Second operand 9 states. [2019-10-03 04:09:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:57,781 INFO L93 Difference]: Finished difference Result 2319 states and 3498 transitions. [2019-10-03 04:09:57,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 04:09:57,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-03 04:09:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:57,800 INFO L225 Difference]: With dead ends: 2319 [2019-10-03 04:09:57,800 INFO L226 Difference]: Without dead ends: 2319 [2019-10-03 04:09:57,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-10-03 04:09:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2019-10-03 04:09:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2118. [2019-10-03 04:09:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2118 states. [2019-10-03 04:09:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 3079 transitions. [2019-10-03 04:09:57,892 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 3079 transitions. Word has length 101 [2019-10-03 04:09:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:57,892 INFO L475 AbstractCegarLoop]: Abstraction has 2118 states and 3079 transitions. [2019-10-03 04:09:57,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 04:09:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 3079 transitions. [2019-10-03 04:09:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 04:09:57,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:57,895 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:57,895 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:57,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1774230569, now seen corresponding path program 1 times [2019-10-03 04:09:57,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:57,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:57,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:57,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:57,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 04:09:57,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:57,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:57,941 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-10-03 04:09:57,944 INFO L207 CegarAbsIntRunner]: [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [181], [182], [183], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [269], [282], [286], [289], [301], [304], [306], [309], [325], [329], [334], [337], [350], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [438], [439], [440], [446], [447], [448], [449], [450], [451], [454], [455], [460], [461], [462], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:09:57,982 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:57,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:58,120 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:09:58,122 INFO L272 AbstractInterpreter]: Visited 73 different actions 73 times. Never merged. Never widened. Performed 347 root evaluator evaluations with a maximum evaluation depth of 4. Performed 347 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 46 variables. [2019-10-03 04:09:58,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:58,128 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:09:58,384 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 82.05% of their original sizes. [2019-10-03 04:09:58,385 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:09:58,815 INFO L420 sIntCurrentIteration]: We unified 103 AI predicates to 103 [2019-10-03 04:09:58,815 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:09:58,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:09:58,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [3] total 31 [2019-10-03 04:09:58,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:58,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-03 04:09:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-03 04:09:58,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2019-10-03 04:09:58,818 INFO L87 Difference]: Start difference. First operand 2118 states and 3079 transitions. Second operand 30 states. [2019-10-03 04:10:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:02,943 INFO L93 Difference]: Finished difference Result 2079 states and 3004 transitions. [2019-10-03 04:10:02,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 04:10:02,943 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 104 [2019-10-03 04:10:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:02,957 INFO L225 Difference]: With dead ends: 2079 [2019-10-03 04:10:02,958 INFO L226 Difference]: Without dead ends: 2079 [2019-10-03 04:10:02,959 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=403, Invalid=2047, Unknown=0, NotChecked=0, Total=2450 [2019-10-03 04:10:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-10-03 04:10:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2073. [2019-10-03 04:10:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2073 states. [2019-10-03 04:10:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 2997 transitions. [2019-10-03 04:10:03,048 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 2997 transitions. Word has length 104 [2019-10-03 04:10:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:03,049 INFO L475 AbstractCegarLoop]: Abstraction has 2073 states and 2997 transitions. [2019-10-03 04:10:03,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-03 04:10:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2997 transitions. [2019-10-03 04:10:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:03,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:03,055 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:03,056 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:03,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:03,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1632409962, now seen corresponding path program 1 times [2019-10-03 04:10:03,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:03,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:03,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:03,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 04:10:03,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:03,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:03,111 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-10-03 04:10:03,111 INFO L207 CegarAbsIntRunner]: [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [181], [182], [183], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [260], [266], [269], [273], [279], [282], [286], [289], [301], [304], [306], [309], [325], [329], [334], [337], [350], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [438], [439], [440], [446], [447], [448], [449], [450], [451], [454], [455], [460], [461], [462], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:10:03,120 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:03,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:03,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:10:03,211 INFO L272 AbstractInterpreter]: Visited 93 different actions 134 times. Merged at 11 different actions 20 times. Never widened. Performed 683 root evaluator evaluations with a maximum evaluation depth of 4. Performed 683 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2019-10-03 04:10:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:03,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:10:03,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:03,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:10:03,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:03,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:10:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:03,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:10:03,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:10:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 04:10:03,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:10:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 04:10:03,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:10:03,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-10-03 04:10:03,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:03,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:03,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:03,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:03,452 INFO L87 Difference]: Start difference. First operand 2073 states and 2997 transitions. Second operand 3 states. [2019-10-03 04:10:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:03,549 INFO L93 Difference]: Finished difference Result 3842 states and 5966 transitions. [2019-10-03 04:10:03,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:03,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-03 04:10:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:03,581 INFO L225 Difference]: With dead ends: 3842 [2019-10-03 04:10:03,582 INFO L226 Difference]: Without dead ends: 3842 [2019-10-03 04:10:03,584 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2019-10-03 04:10:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 3837. [2019-10-03 04:10:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2019-10-03 04:10:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5962 transitions. [2019-10-03 04:10:03,803 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5962 transitions. Word has length 106 [2019-10-03 04:10:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:03,803 INFO L475 AbstractCegarLoop]: Abstraction has 3837 states and 5962 transitions. [2019-10-03 04:10:03,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5962 transitions. [2019-10-03 04:10:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 04:10:03,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:03,807 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:03,808 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1783073809, now seen corresponding path program 1 times [2019-10-03 04:10:03,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:03,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:03,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:03,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:03,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 04:10:03,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:03,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:03,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:03,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:03,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:03,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:03,882 INFO L87 Difference]: Start difference. First operand 3837 states and 5962 transitions. Second operand 3 states. [2019-10-03 04:10:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:04,061 INFO L93 Difference]: Finished difference Result 7094 states and 12406 transitions. [2019-10-03 04:10:04,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:04,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-03 04:10:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:04,129 INFO L225 Difference]: With dead ends: 7094 [2019-10-03 04:10:04,129 INFO L226 Difference]: Without dead ends: 7094 [2019-10-03 04:10:04,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2019-10-03 04:10:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 7057. [2019-10-03 04:10:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7057 states. [2019-10-03 04:10:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 12366 transitions. [2019-10-03 04:10:04,698 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 12366 transitions. Word has length 107 [2019-10-03 04:10:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:04,698 INFO L475 AbstractCegarLoop]: Abstraction has 7057 states and 12366 transitions. [2019-10-03 04:10:04,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 12366 transitions. [2019-10-03 04:10:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 04:10:04,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:04,702 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:04,702 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:04,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:04,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1495120277, now seen corresponding path program 1 times [2019-10-03 04:10:04,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:04,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:04,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 04:10:04,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:04,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:04,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-10-03 04:10:04,787 INFO L207 CegarAbsIntRunner]: [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [181], [182], [183], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [260], [266], [273], [279], [286], [289], [301], [304], [306], [309], [325], [329], [334], [337], [350], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [438], [439], [440], [446], [447], [448], [449], [450], [451], [454], [455], [460], [461], [462], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:10:04,789 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:04,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:04,822 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:10:04,822 INFO L272 AbstractInterpreter]: Visited 86 different actions 100 times. Merged at 9 different actions 9 times. Never widened. Performed 522 root evaluator evaluations with a maximum evaluation depth of 4. Performed 522 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2019-10-03 04:10:04,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:04,823 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:10:04,904 INFO L227 lantSequenceWeakener]: Weakened 101 states. On average, predicates are now at 83.31% of their original sizes. [2019-10-03 04:10:04,904 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:10:05,668 INFO L420 sIntCurrentIteration]: We unified 107 AI predicates to 107 [2019-10-03 04:10:05,668 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:10:05,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:05,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [7] total 49 [2019-10-03 04:10:05,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:05,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-03 04:10:05,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-03 04:10:05,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1593, Unknown=0, NotChecked=0, Total=1892 [2019-10-03 04:10:05,671 INFO L87 Difference]: Start difference. First operand 7057 states and 12366 transitions. Second operand 44 states. [2019-10-03 04:10:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:24,502 INFO L93 Difference]: Finished difference Result 10234 states and 20313 transitions. [2019-10-03 04:10:24,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-03 04:10:24,502 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 108 [2019-10-03 04:10:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:24,572 INFO L225 Difference]: With dead ends: 10234 [2019-10-03 04:10:24,572 INFO L226 Difference]: Without dead ends: 9823 [2019-10-03 04:10:24,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5909 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1967, Invalid=14545, Unknown=0, NotChecked=0, Total=16512 [2019-10-03 04:10:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9823 states. [2019-10-03 04:10:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9823 to 8553. [2019-10-03 04:10:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8553 states. [2019-10-03 04:10:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8553 states to 8553 states and 15475 transitions. [2019-10-03 04:10:25,420 INFO L78 Accepts]: Start accepts. Automaton has 8553 states and 15475 transitions. Word has length 108 [2019-10-03 04:10:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:25,420 INFO L475 AbstractCegarLoop]: Abstraction has 8553 states and 15475 transitions. [2019-10-03 04:10:25,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-03 04:10:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 8553 states and 15475 transitions. [2019-10-03 04:10:25,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 04:10:25,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:25,424 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:25,424 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:25,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash -719656318, now seen corresponding path program 1 times [2019-10-03 04:10:25,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:25,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:25,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 04:10:25,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:25,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 04:10:25,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:25,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 04:10:25,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 04:10:25,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:25,556 INFO L87 Difference]: Start difference. First operand 8553 states and 15475 transitions. Second operand 7 states. [2019-10-03 04:10:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:26,052 INFO L93 Difference]: Finished difference Result 13376 states and 25512 transitions. [2019-10-03 04:10:26,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 04:10:26,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-10-03 04:10:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:26,693 INFO L225 Difference]: With dead ends: 13376 [2019-10-03 04:10:26,693 INFO L226 Difference]: Without dead ends: 13306 [2019-10-03 04:10:26,694 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-10-03 04:10:26,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13306 states. [2019-10-03 04:10:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13306 to 13216. [2019-10-03 04:10:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13216 states. [2019-10-03 04:10:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13216 states to 13216 states and 25336 transitions. [2019-10-03 04:10:27,583 INFO L78 Accepts]: Start accepts. Automaton has 13216 states and 25336 transitions. Word has length 112 [2019-10-03 04:10:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:27,583 INFO L475 AbstractCegarLoop]: Abstraction has 13216 states and 25336 transitions. [2019-10-03 04:10:27,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 04:10:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 13216 states and 25336 transitions. [2019-10-03 04:10:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 04:10:27,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:27,587 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:27,587 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:27,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1217934684, now seen corresponding path program 1 times [2019-10-03 04:10:27,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:27,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:27,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:27,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:27,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 04:10:27,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:27,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 04:10:27,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:27,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 04:10:27,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 04:10:27,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 04:10:27,701 INFO L87 Difference]: Start difference. First operand 13216 states and 25336 transitions. Second operand 8 states. [2019-10-03 04:10:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:28,291 INFO L93 Difference]: Finished difference Result 16704 states and 33623 transitions. [2019-10-03 04:10:28,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 04:10:28,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2019-10-03 04:10:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:28,372 INFO L225 Difference]: With dead ends: 16704 [2019-10-03 04:10:28,372 INFO L226 Difference]: Without dead ends: 14350 [2019-10-03 04:10:28,372 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-03 04:10:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14350 states. [2019-10-03 04:10:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14350 to 14134. [2019-10-03 04:10:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14134 states. [2019-10-03 04:10:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14134 states to 14134 states and 28165 transitions. [2019-10-03 04:10:29,617 INFO L78 Accepts]: Start accepts. Automaton has 14134 states and 28165 transitions. Word has length 116 [2019-10-03 04:10:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:29,618 INFO L475 AbstractCegarLoop]: Abstraction has 14134 states and 28165 transitions. [2019-10-03 04:10:29,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 04:10:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 14134 states and 28165 transitions. [2019-10-03 04:10:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 04:10:29,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:29,627 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:29,627 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:29,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1631252192, now seen corresponding path program 1 times [2019-10-03 04:10:29,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:29,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:29,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 04:10:29,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:29,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:29,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2019-10-03 04:10:29,791 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [181], [182], [183], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [260], [263], [273], [276], [295], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:10:29,801 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:29,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:29,866 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:10:29,867 INFO L272 AbstractInterpreter]: Visited 101 different actions 105 times. Never merged. Never widened. Performed 515 root evaluator evaluations with a maximum evaluation depth of 4. Performed 515 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 47 variables. [2019-10-03 04:10:29,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:29,872 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:10:30,032 INFO L227 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 80.05% of their original sizes. [2019-10-03 04:10:30,033 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:10:30,934 INFO L420 sIntCurrentIteration]: We unified 121 AI predicates to 121 [2019-10-03 04:10:30,934 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:10:30,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:30,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [9] total 55 [2019-10-03 04:10:30,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:30,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-03 04:10:30,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-03 04:10:30,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1947, Unknown=0, NotChecked=0, Total=2256 [2019-10-03 04:10:30,936 INFO L87 Difference]: Start difference. First operand 14134 states and 28165 transitions. Second operand 48 states. [2019-10-03 04:10:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:43,208 INFO L93 Difference]: Finished difference Result 14534 states and 28866 transitions. [2019-10-03 04:10:43,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-03 04:10:43,209 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 122 [2019-10-03 04:10:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:43,281 INFO L225 Difference]: With dead ends: 14534 [2019-10-03 04:10:43,281 INFO L226 Difference]: Without dead ends: 14534 [2019-10-03 04:10:43,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=862, Invalid=5944, Unknown=0, NotChecked=0, Total=6806 [2019-10-03 04:10:43,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14534 states. [2019-10-03 04:10:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14534 to 14505. [2019-10-03 04:10:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14505 states. [2019-10-03 04:10:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14505 states to 14505 states and 28833 transitions. [2019-10-03 04:10:44,545 INFO L78 Accepts]: Start accepts. Automaton has 14505 states and 28833 transitions. Word has length 122 [2019-10-03 04:10:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:44,545 INFO L475 AbstractCegarLoop]: Abstraction has 14505 states and 28833 transitions. [2019-10-03 04:10:44,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-03 04:10:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14505 states and 28833 transitions. [2019-10-03 04:10:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-03 04:10:44,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:44,551 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:44,551 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:44,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:44,551 INFO L82 PathProgramCache]: Analyzing trace with hash 637064408, now seen corresponding path program 1 times [2019-10-03 04:10:44,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:44,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:44,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:44,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:44,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 04:10:44,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:44,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:44,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-10-03 04:10:44,657 INFO L207 CegarAbsIntRunner]: [40], [56], [59], [66], [67], [70], [72], [77], [80], [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [181], [182], [183], [184], [187], [198], [199], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [260], [263], [273], [279], [286], [289], [301], [304], [325], [332], [334], [340], [343], [350], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [434], [435], [436], [438], [439], [440], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [460], [461], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:10:44,659 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:44,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:44,684 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:10:44,685 INFO L272 AbstractInterpreter]: Visited 106 different actions 113 times. Merged at 2 different actions 2 times. Never widened. Performed 607 root evaluator evaluations with a maximum evaluation depth of 4. Performed 607 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2019-10-03 04:10:44,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:44,685 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:10:44,751 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 82.19% of their original sizes. [2019-10-03 04:10:44,751 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:10:45,904 INFO L420 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2019-10-03 04:10:45,904 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:10:45,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:45,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [9] total 63 [2019-10-03 04:10:45,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:45,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-03 04:10:45,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-03 04:10:45,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=2695, Unknown=0, NotChecked=0, Total=3080 [2019-10-03 04:10:45,908 INFO L87 Difference]: Start difference. First operand 14505 states and 28833 transitions. Second operand 56 states. [2019-10-03 04:11:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:01,192 INFO L93 Difference]: Finished difference Result 15142 states and 30249 transitions. [2019-10-03 04:11:01,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-03 04:11:01,192 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 125 [2019-10-03 04:11:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:01,261 INFO L225 Difference]: With dead ends: 15142 [2019-10-03 04:11:01,261 INFO L226 Difference]: Without dead ends: 15142 [2019-10-03 04:11:01,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1054, Invalid=8258, Unknown=0, NotChecked=0, Total=9312 [2019-10-03 04:11:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15142 states. [2019-10-03 04:11:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15142 to 15083. [2019-10-03 04:11:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15083 states. [2019-10-03 04:11:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15083 states to 15083 states and 30180 transitions. [2019-10-03 04:11:02,381 INFO L78 Accepts]: Start accepts. Automaton has 15083 states and 30180 transitions. Word has length 125 [2019-10-03 04:11:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:02,381 INFO L475 AbstractCegarLoop]: Abstraction has 15083 states and 30180 transitions. [2019-10-03 04:11:02,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-03 04:11:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 15083 states and 30180 transitions. [2019-10-03 04:11:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-03 04:11:02,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:02,386 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:02,386 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash 109681911, now seen corresponding path program 1 times [2019-10-03 04:11:02,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:02,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:02,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:02,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:02,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 04:11:02,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:02,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:02,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-10-03 04:11:02,480 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [181], [182], [183], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [260], [263], [266], [273], [276], [295], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:11:02,485 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:02,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:02,528 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:02,529 INFO L272 AbstractInterpreter]: Visited 103 different actions 133 times. Merged at 11 different actions 12 times. Never widened. Performed 733 root evaluator evaluations with a maximum evaluation depth of 4. Performed 733 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 47 variables. [2019-10-03 04:11:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:02,529 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:02,604 INFO L227 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 80.28% of their original sizes. [2019-10-03 04:11:02,605 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:03,566 INFO L420 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2019-10-03 04:11:03,566 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:03,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:03,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [7] total 59 [2019-10-03 04:11:03,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:03,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-03 04:11:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-03 04:11:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=2379, Unknown=0, NotChecked=0, Total=2862 [2019-10-03 04:11:03,569 INFO L87 Difference]: Start difference. First operand 15083 states and 30180 transitions. Second operand 54 states. [2019-10-03 04:11:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:30,218 INFO L93 Difference]: Finished difference Result 16739 states and 33387 transitions. [2019-10-03 04:11:30,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-03 04:11:30,218 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-10-03 04:11:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:30,298 INFO L225 Difference]: With dead ends: 16739 [2019-10-03 04:11:30,299 INFO L226 Difference]: Without dead ends: 16738 [2019-10-03 04:11:30,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4345 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1620, Invalid=11720, Unknown=0, NotChecked=0, Total=13340 [2019-10-03 04:11:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16738 states. [2019-10-03 04:11:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16738 to 16623. [2019-10-03 04:11:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16623 states. [2019-10-03 04:11:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16623 states to 16623 states and 33254 transitions. [2019-10-03 04:11:31,358 INFO L78 Accepts]: Start accepts. Automaton has 16623 states and 33254 transitions. Word has length 125 [2019-10-03 04:11:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:31,358 INFO L475 AbstractCegarLoop]: Abstraction has 16623 states and 33254 transitions. [2019-10-03 04:11:31,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-03 04:11:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 16623 states and 33254 transitions. [2019-10-03 04:11:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-03 04:11:31,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:31,363 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:31,363 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:31,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:31,363 INFO L82 PathProgramCache]: Analyzing trace with hash 128482033, now seen corresponding path program 1 times [2019-10-03 04:11:31,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:31,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:31,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:31,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:31,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 04:11:31,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:31,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 04:11:31,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:31,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 04:11:31,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 04:11:31,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-03 04:11:31,508 INFO L87 Difference]: Start difference. First operand 16623 states and 33254 transitions. Second operand 12 states. [2019-10-03 04:11:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:34,232 INFO L93 Difference]: Finished difference Result 20553 states and 55804 transitions. [2019-10-03 04:11:34,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 04:11:34,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 127 [2019-10-03 04:11:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:34,369 INFO L225 Difference]: With dead ends: 20553 [2019-10-03 04:11:34,369 INFO L226 Difference]: Without dead ends: 20505 [2019-10-03 04:11:34,370 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-10-03 04:11:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20505 states. [2019-10-03 04:11:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20505 to 18372. [2019-10-03 04:11:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18372 states. [2019-10-03 04:11:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18372 states to 18372 states and 40572 transitions. [2019-10-03 04:11:36,091 INFO L78 Accepts]: Start accepts. Automaton has 18372 states and 40572 transitions. Word has length 127 [2019-10-03 04:11:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:36,092 INFO L475 AbstractCegarLoop]: Abstraction has 18372 states and 40572 transitions. [2019-10-03 04:11:36,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 04:11:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 18372 states and 40572 transitions. [2019-10-03 04:11:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-03 04:11:36,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:36,099 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:36,100 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:36,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1182188691, now seen corresponding path program 1 times [2019-10-03 04:11:36,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:36,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:36,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:36,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:36,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 04:11:36,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:36,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:36,196 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-10-03 04:11:36,196 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [181], [182], [183], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [260], [263], [273], [276], [286], [289], [301], [304], [323], [348], [350], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [458], [459], [460], [461], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:11:36,198 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:36,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:36,225 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:36,225 INFO L272 AbstractInterpreter]: Visited 106 different actions 110 times. Never merged. Never widened. Performed 567 root evaluator evaluations with a maximum evaluation depth of 4. Performed 567 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 48 variables. [2019-10-03 04:11:36,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:36,226 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:36,286 INFO L227 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 79.21% of their original sizes. [2019-10-03 04:11:36,286 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:37,111 INFO L420 sIntCurrentIteration]: We unified 129 AI predicates to 129 [2019-10-03 04:11:37,112 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:37,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:37,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [10] total 58 [2019-10-03 04:11:37,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:37,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-03 04:11:37,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-03 04:11:37,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2135, Unknown=0, NotChecked=0, Total=2450 [2019-10-03 04:11:37,114 INFO L87 Difference]: Start difference. First operand 18372 states and 40572 transitions. Second operand 50 states. [2019-10-03 04:11:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:49,633 INFO L93 Difference]: Finished difference Result 18434 states and 40626 transitions. [2019-10-03 04:11:49,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-03 04:11:49,633 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 130 [2019-10-03 04:11:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:49,685 INFO L225 Difference]: With dead ends: 18434 [2019-10-03 04:11:49,686 INFO L226 Difference]: Without dead ends: 18434 [2019-10-03 04:11:49,686 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=858, Invalid=6452, Unknown=0, NotChecked=0, Total=7310 [2019-10-03 04:11:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18434 states. [2019-10-03 04:11:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18434 to 18380. [2019-10-03 04:11:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18380 states. [2019-10-03 04:11:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18380 states to 18380 states and 40560 transitions. [2019-10-03 04:11:50,524 INFO L78 Accepts]: Start accepts. Automaton has 18380 states and 40560 transitions. Word has length 130 [2019-10-03 04:11:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:50,524 INFO L475 AbstractCegarLoop]: Abstraction has 18380 states and 40560 transitions. [2019-10-03 04:11:50,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-03 04:11:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 18380 states and 40560 transitions. [2019-10-03 04:11:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 04:11:50,530 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:50,530 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:50,531 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1160776199, now seen corresponding path program 1 times [2019-10-03 04:11:50,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:50,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:50,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-03 04:11:50,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:50,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:50,622 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2019-10-03 04:11:50,622 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [181], [182], [183], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [260], [263], [266], [273], [276], [282], [286], [292], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:11:50,624 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:50,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:50,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:11:50,958 INFO L272 AbstractInterpreter]: Visited 106 different actions 828 times. Merged at 24 different actions 288 times. Widened at 1 different actions 4 times. Performed 6393 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6393 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 49 fixpoints after 5 different actions. Largest state had 48 variables. [2019-10-03 04:11:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:50,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:11:50,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:50,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:11:51,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:51,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:11:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:51,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 04:11:51,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:11:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-03 04:11:51,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:11:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-03 04:11:51,272 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:51,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [7] total 10 [2019-10-03 04:11:51,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:51,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:11:51,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:11:51,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-03 04:11:51,274 INFO L87 Difference]: Start difference. First operand 18380 states and 40560 transitions. Second operand 3 states. [2019-10-03 04:11:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:51,459 INFO L93 Difference]: Finished difference Result 17167 states and 33050 transitions. [2019-10-03 04:11:51,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:11:51,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-10-03 04:11:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:51,524 INFO L225 Difference]: With dead ends: 17167 [2019-10-03 04:11:51,524 INFO L226 Difference]: Without dead ends: 17167 [2019-10-03 04:11:51,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-03 04:11:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17167 states. [2019-10-03 04:11:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17167 to 17100. [2019-10-03 04:11:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17100 states. [2019-10-03 04:11:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17100 states to 17100 states and 32969 transitions. [2019-10-03 04:11:52,178 INFO L78 Accepts]: Start accepts. Automaton has 17100 states and 32969 transitions. Word has length 137 [2019-10-03 04:11:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:52,178 INFO L475 AbstractCegarLoop]: Abstraction has 17100 states and 32969 transitions. [2019-10-03 04:11:52,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:11:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 17100 states and 32969 transitions. [2019-10-03 04:11:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 04:11:52,188 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:52,188 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:52,189 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash 70303065, now seen corresponding path program 1 times [2019-10-03 04:11:52,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:52,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:52,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:52,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:52,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 04:11:52,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:52,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:52,301 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2019-10-03 04:11:52,301 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [80], [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [169], [172], [181], [182], [183], [184], [189], [192], [198], [199], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [260], [263], [269], [273], [276], [279], [286], [289], [301], [304], [325], [332], [334], [337], [340], [343], [350], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [438], [439], [440], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [458], [459], [460], [461], [462], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:11:52,303 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:52,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:52,836 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:52,836 INFO L272 AbstractInterpreter]: Visited 123 different actions 1535 times. Merged at 28 different actions 413 times. Widened at 1 different actions 6 times. Performed 9731 root evaluator evaluations with a maximum evaluation depth of 4. Performed 9731 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 66 fixpoints after 6 different actions. Largest state had 48 variables. [2019-10-03 04:11:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:52,836 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:54,112 INFO L227 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 79.66% of their original sizes. [2019-10-03 04:11:54,112 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:55,952 INFO L420 sIntCurrentIteration]: We unified 143 AI predicates to 143 [2019-10-03 04:11:55,953 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:55,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:55,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [9] total 77 [2019-10-03 04:11:55,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:55,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-03 04:11:55,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-03 04:11:55,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=4231, Unknown=0, NotChecked=0, Total=4830 [2019-10-03 04:11:55,955 INFO L87 Difference]: Start difference. First operand 17100 states and 32969 transitions. Second operand 70 states. [2019-10-03 04:16:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:27,745 INFO L93 Difference]: Finished difference Result 61407 states and 114187 transitions. [2019-10-03 04:16:27,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 646 states. [2019-10-03 04:16:27,745 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2019-10-03 04:16:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:28,008 INFO L225 Difference]: With dead ends: 61407 [2019-10-03 04:16:28,008 INFO L226 Difference]: Without dead ends: 61407 [2019-10-03 04:16:28,043 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 697 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217634 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=37277, Invalid=450625, Unknown=0, NotChecked=0, Total=487902 [2019-10-03 04:16:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61407 states. [2019-10-03 04:16:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61407 to 50102. [2019-10-03 04:16:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50102 states. [2019-10-03 04:16:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50102 states to 50102 states and 96008 transitions. [2019-10-03 04:16:31,295 INFO L78 Accepts]: Start accepts. Automaton has 50102 states and 96008 transitions. Word has length 144 [2019-10-03 04:16:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:31,296 INFO L475 AbstractCegarLoop]: Abstraction has 50102 states and 96008 transitions. [2019-10-03 04:16:31,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-03 04:16:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 50102 states and 96008 transitions. [2019-10-03 04:16:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 04:16:31,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:31,300 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:31,300 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:31,302 INFO L82 PathProgramCache]: Analyzing trace with hash 632316081, now seen corresponding path program 1 times [2019-10-03 04:16:31,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:31,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:31,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:31,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:31,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-03 04:16:31,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:31,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:31,410 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-10-03 04:16:31,410 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [169], [172], [181], [182], [183], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [260], [263], [266], [269], [273], [276], [279], [286], [289], [295], [301], [304], [325], [329], [350], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [458], [459], [460], [461], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:16:31,411 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:31,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:31,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:16:31,897 INFO L272 AbstractInterpreter]: Visited 119 different actions 1970 times. Merged at 32 different actions 710 times. Widened at 2 different actions 9 times. Performed 14498 root evaluator evaluations with a maximum evaluation depth of 4. Performed 14498 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 166 fixpoints after 12 different actions. Largest state had 48 variables. [2019-10-03 04:16:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:31,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:16:31,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:31,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:16:31,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:31,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:16:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:32,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 04:16:32,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:16:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-03 04:16:32,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:16:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-03 04:16:32,214 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:16:32,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 13 [2019-10-03 04:16:32,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:32,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:16:32,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:16:32,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-03 04:16:32,216 INFO L87 Difference]: Start difference. First operand 50102 states and 96008 transitions. Second operand 3 states. [2019-10-03 04:16:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:32,442 INFO L93 Difference]: Finished difference Result 46916 states and 67315 transitions. [2019-10-03 04:16:32,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:16:32,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-03 04:16:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:32,620 INFO L225 Difference]: With dead ends: 46916 [2019-10-03 04:16:32,620 INFO L226 Difference]: Without dead ends: 46668 [2019-10-03 04:16:32,625 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-03 04:16:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46668 states. [2019-10-03 04:16:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46668 to 45560. [2019-10-03 04:16:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45560 states. [2019-10-03 04:16:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45560 states to 45560 states and 65288 transitions. [2019-10-03 04:16:33,592 INFO L78 Accepts]: Start accepts. Automaton has 45560 states and 65288 transitions. Word has length 147 [2019-10-03 04:16:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:33,592 INFO L475 AbstractCegarLoop]: Abstraction has 45560 states and 65288 transitions. [2019-10-03 04:16:33,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:16:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 45560 states and 65288 transitions. [2019-10-03 04:16:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-03 04:16:33,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:33,597 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:33,597 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:33,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:33,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1714285748, now seen corresponding path program 1 times [2019-10-03 04:16:33,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:33,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:33,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:33,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:33,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-03 04:16:33,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:33,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:33,677 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2019-10-03 04:16:33,678 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [80], [81], [86], [100], [110], [112], [114], [115], [116], [138], [140], [145], [148], [153], [156], [161], [163], [164], [167], [169], [174], [177], [181], [182], [183], [184], [189], [192], [194], [198], [199], [200], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [260], [263], [266], [269], [273], [276], [282], [286], [289], [292], [301], [304], [325], [332], [334], [340], [343], [350], [351], [352], [366], [368], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [438], [439], [440], [446], [447], [448], [449], [450], [451], [452], [454], [455], [456], [457], [458], [459], [460], [461], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [496], [497], [498] [2019-10-03 04:16:33,679 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:33,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:34,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:16:34,556 INFO L272 AbstractInterpreter]: Visited 128 different actions 1733 times. Merged at 30 different actions 472 times. Widened at 2 different actions 5 times. Performed 12553 root evaluator evaluations with a maximum evaluation depth of 4. Performed 12553 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 116 fixpoints after 9 different actions. Largest state had 48 variables. [2019-10-03 04:16:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:34,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:16:34,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:34,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:16:34,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:34,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:16:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:34,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 04:16:34,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:16:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 04:16:34,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:16:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-03 04:16:34,946 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:16:34,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 9 [2019-10-03 04:16:34,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:34,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:16:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:16:34,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:16:34,949 INFO L87 Difference]: Start difference. First operand 45560 states and 65288 transitions. Second operand 3 states. [2019-10-03 04:16:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:36,511 INFO L93 Difference]: Finished difference Result 67298 states and 89669 transitions. [2019-10-03 04:16:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:16:36,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-03 04:16:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:36,752 INFO L225 Difference]: With dead ends: 67298 [2019-10-03 04:16:36,753 INFO L226 Difference]: Without dead ends: 67298 [2019-10-03 04:16:36,753 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:16:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67298 states. [2019-10-03 04:16:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67298 to 66699. [2019-10-03 04:16:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66699 states. [2019-10-03 04:16:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66699 states to 66699 states and 88734 transitions. [2019-10-03 04:16:37,746 INFO L78 Accepts]: Start accepts. Automaton has 66699 states and 88734 transitions. Word has length 162 [2019-10-03 04:16:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:37,747 INFO L475 AbstractCegarLoop]: Abstraction has 66699 states and 88734 transitions. [2019-10-03 04:16:37,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:16:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 66699 states and 88734 transitions. [2019-10-03 04:16:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-03 04:16:37,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:37,752 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:37,752 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:37,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:37,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1158594822, now seen corresponding path program 1 times [2019-10-03 04:16:37,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:37,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:37,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:37,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:37,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 04:16:37,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:16:37,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:16:37,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:37,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:16:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:16:37,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:16:37,826 INFO L87 Difference]: Start difference. First operand 66699 states and 88734 transitions. Second operand 4 states. [2019-10-03 04:16:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:38,376 INFO L93 Difference]: Finished difference Result 100733 states and 131810 transitions. [2019-10-03 04:16:38,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:16:38,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-10-03 04:16:38,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:38,743 INFO L225 Difference]: With dead ends: 100733 [2019-10-03 04:16:38,744 INFO L226 Difference]: Without dead ends: 100733 [2019-10-03 04:16:38,744 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:16:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100733 states. [2019-10-03 04:16:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100733 to 99984. [2019-10-03 04:16:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99984 states. [2019-10-03 04:16:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99984 states to 99984 states and 130924 transitions. [2019-10-03 04:16:42,850 INFO L78 Accepts]: Start accepts. Automaton has 99984 states and 130924 transitions. Word has length 179 [2019-10-03 04:16:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:42,851 INFO L475 AbstractCegarLoop]: Abstraction has 99984 states and 130924 transitions. [2019-10-03 04:16:42,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:16:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 99984 states and 130924 transitions. [2019-10-03 04:16:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-03 04:16:42,855 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:42,855 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:42,856 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:42,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:42,856 INFO L82 PathProgramCache]: Analyzing trace with hash -316637734, now seen corresponding path program 1 times [2019-10-03 04:16:42,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:42,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:42,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 04:16:42,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:16:42,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:16:42,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:42,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:16:42,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:16:42,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:16:42,930 INFO L87 Difference]: Start difference. First operand 99984 states and 130924 transitions. Second operand 4 states. [2019-10-03 04:16:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:43,465 INFO L93 Difference]: Finished difference Result 122788 states and 155142 transitions. [2019-10-03 04:16:43,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:16:43,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-10-03 04:16:43,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:43,917 INFO L225 Difference]: With dead ends: 122788 [2019-10-03 04:16:43,917 INFO L226 Difference]: Without dead ends: 122788 [2019-10-03 04:16:43,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:16:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122788 states. [2019-10-03 04:16:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122788 to 122788. [2019-10-03 04:16:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122788 states. [2019-10-03 04:16:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122788 states to 122788 states and 155142 transitions. [2019-10-03 04:16:45,576 INFO L78 Accepts]: Start accepts. Automaton has 122788 states and 155142 transitions. Word has length 180 [2019-10-03 04:16:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:45,577 INFO L475 AbstractCegarLoop]: Abstraction has 122788 states and 155142 transitions. [2019-10-03 04:16:45,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:16:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 122788 states and 155142 transitions. [2019-10-03 04:16:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-03 04:16:45,581 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:45,582 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:45,582 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:45,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1831437364, now seen corresponding path program 1 times [2019-10-03 04:16:45,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:45,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:45,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-03 04:16:45,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:16:45,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:16:45,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:45,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:16:45,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:16:45,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:16:45,656 INFO L87 Difference]: Start difference. First operand 122788 states and 155142 transitions. Second operand 6 states. [2019-10-03 04:16:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:46,084 INFO L93 Difference]: Finished difference Result 93103 states and 114060 transitions. [2019-10-03 04:16:46,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:16:46,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-10-03 04:16:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:46,437 INFO L225 Difference]: With dead ends: 93103 [2019-10-03 04:16:46,437 INFO L226 Difference]: Without dead ends: 93103 [2019-10-03 04:16:46,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:16:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93103 states. [2019-10-03 04:16:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93103 to 92715. [2019-10-03 04:16:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92715 states. [2019-10-03 04:16:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92715 states to 92715 states and 113529 transitions. [2019-10-03 04:16:50,367 INFO L78 Accepts]: Start accepts. Automaton has 92715 states and 113529 transitions. Word has length 181 [2019-10-03 04:16:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:50,368 INFO L475 AbstractCegarLoop]: Abstraction has 92715 states and 113529 transitions. [2019-10-03 04:16:50,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:16:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 92715 states and 113529 transitions. [2019-10-03 04:16:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 04:16:50,375 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:50,375 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:50,375 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1606375967, now seen corresponding path program 1 times [2019-10-03 04:16:50,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:50,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:50,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-03 04:16:50,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:50,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:50,498 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2019-10-03 04:16:50,498 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [96], [98], [99], [100], [103], [106], [110], [112], [114], [115], [116], [138], [140], [145], [148], [151], [153], [156], [161], [163], [164], [167], [169], [172], [174], [177], [181], [182], [183], [200], [203], [208], [210], [212], [214], [215], [218], [224], [230], [234], [237], [238], [239], [248], [251], [254], [256], [260], [263], [269], [273], [276], [286], [292], [300], [351], [352], [366], [368], [370], [372], [377], [385], [388], [393], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [494], [495], [496], [497], [498] [2019-10-03 04:16:50,500 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:50,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:50,525 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:16:50,525 INFO L272 AbstractInterpreter]: Visited 112 different actions 153 times. Merged at 13 different actions 13 times. Never widened. Performed 724 root evaluator evaluations with a maximum evaluation depth of 4. Performed 724 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 48 variables. [2019-10-03 04:16:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:50,525 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:16:50,612 INFO L227 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 75.06% of their original sizes. [2019-10-03 04:16:50,612 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:16:51,843 INFO L420 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2019-10-03 04:16:51,843 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:16:51,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:16:51,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [61] imperfect sequences [10] total 69 [2019-10-03 04:16:51,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:51,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-03 04:16:51,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-03 04:16:51,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=3303, Unknown=0, NotChecked=0, Total=3660 [2019-10-03 04:16:51,845 INFO L87 Difference]: Start difference. First operand 92715 states and 113529 transitions. Second operand 61 states. [2019-10-03 04:17:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:15,940 INFO L93 Difference]: Finished difference Result 99929 states and 121936 transitions. [2019-10-03 04:17:15,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-03 04:17:15,940 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 212 [2019-10-03 04:17:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:16,193 INFO L225 Difference]: With dead ends: 99929 [2019-10-03 04:17:16,194 INFO L226 Difference]: Without dead ends: 99929 [2019-10-03 04:17:16,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3825 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1137, Invalid=10853, Unknown=0, NotChecked=0, Total=11990 [2019-10-03 04:17:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99929 states. [2019-10-03 04:17:17,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99929 to 99705. [2019-10-03 04:17:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99705 states. [2019-10-03 04:17:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99705 states to 99705 states and 121647 transitions. [2019-10-03 04:17:17,349 INFO L78 Accepts]: Start accepts. Automaton has 99705 states and 121647 transitions. Word has length 212 [2019-10-03 04:17:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:17:17,349 INFO L475 AbstractCegarLoop]: Abstraction has 99705 states and 121647 transitions. [2019-10-03 04:17:17,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-03 04:17:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 99705 states and 121647 transitions. [2019-10-03 04:17:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-03 04:17:17,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:17:17,355 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:17:17,356 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:17:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:17,356 INFO L82 PathProgramCache]: Analyzing trace with hash 528088002, now seen corresponding path program 1 times [2019-10-03 04:17:17,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:17:17,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:17,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:17,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:17,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:17:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-03 04:17:17,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:17:17,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:17:17,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:17:17,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:17:17,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:17:17,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:17:17,454 INFO L87 Difference]: Start difference. First operand 99705 states and 121647 transitions. Second operand 5 states. [2019-10-03 04:17:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:19,066 INFO L93 Difference]: Finished difference Result 109553 states and 141213 transitions. [2019-10-03 04:17:19,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 04:17:19,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 220 [2019-10-03 04:17:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:19,331 INFO L225 Difference]: With dead ends: 109553 [2019-10-03 04:17:19,331 INFO L226 Difference]: Without dead ends: 109553 [2019-10-03 04:17:19,332 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:17:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109553 states. [2019-10-03 04:17:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109553 to 100835. [2019-10-03 04:17:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100835 states. [2019-10-03 04:17:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100835 states to 100835 states and 123182 transitions. [2019-10-03 04:17:20,686 INFO L78 Accepts]: Start accepts. Automaton has 100835 states and 123182 transitions. Word has length 220 [2019-10-03 04:17:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:17:20,686 INFO L475 AbstractCegarLoop]: Abstraction has 100835 states and 123182 transitions. [2019-10-03 04:17:20,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:17:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 100835 states and 123182 transitions. [2019-10-03 04:17:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-03 04:17:20,693 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:17:20,693 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:17:20,693 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:17:20,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1343660870, now seen corresponding path program 1 times [2019-10-03 04:17:20,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:17:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:20,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:20,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:17:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-10-03 04:17:20,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:17:20,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:17:20,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:17:20,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:17:20,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:17:20,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:17:20,788 INFO L87 Difference]: Start difference. First operand 100835 states and 123182 transitions. Second operand 6 states. [2019-10-03 04:17:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:21,107 INFO L93 Difference]: Finished difference Result 93965 states and 113765 transitions. [2019-10-03 04:17:21,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:17:21,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 222 [2019-10-03 04:17:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:21,303 INFO L225 Difference]: With dead ends: 93965 [2019-10-03 04:17:21,303 INFO L226 Difference]: Without dead ends: 93753 [2019-10-03 04:17:21,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:17:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93753 states. [2019-10-03 04:17:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93753 to 93309. [2019-10-03 04:17:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93309 states. [2019-10-03 04:17:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93309 states to 93309 states and 113024 transitions. [2019-10-03 04:17:23,104 INFO L78 Accepts]: Start accepts. Automaton has 93309 states and 113024 transitions. Word has length 222 [2019-10-03 04:17:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:17:23,104 INFO L475 AbstractCegarLoop]: Abstraction has 93309 states and 113024 transitions. [2019-10-03 04:17:23,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:17:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 93309 states and 113024 transitions. [2019-10-03 04:17:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-03 04:17:23,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:17:23,114 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:17:23,114 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:17:23,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1236437333, now seen corresponding path program 1 times [2019-10-03 04:17:23,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:17:23,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:23,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:23,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:23,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:17:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-03 04:17:23,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:17:23,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:17:23,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:17:23,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:17:23,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:17:23,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:17:23,221 INFO L87 Difference]: Start difference. First operand 93309 states and 113024 transitions. Second operand 4 states. [2019-10-03 04:17:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:23,601 INFO L93 Difference]: Finished difference Result 87830 states and 104492 transitions. [2019-10-03 04:17:23,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:17:23,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-03 04:17:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:23,791 INFO L225 Difference]: With dead ends: 87830 [2019-10-03 04:17:23,791 INFO L226 Difference]: Without dead ends: 87830 [2019-10-03 04:17:23,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:17:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87830 states. [2019-10-03 04:17:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87830 to 87757. [2019-10-03 04:17:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87757 states. [2019-10-03 04:17:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87757 states to 87757 states and 104341 transitions. [2019-10-03 04:17:25,537 INFO L78 Accepts]: Start accepts. Automaton has 87757 states and 104341 transitions. Word has length 237 [2019-10-03 04:17:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:17:25,537 INFO L475 AbstractCegarLoop]: Abstraction has 87757 states and 104341 transitions. [2019-10-03 04:17:25,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:17:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 87757 states and 104341 transitions. [2019-10-03 04:17:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-03 04:17:25,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:17:25,546 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:17:25,546 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:17:25,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:25,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1231805454, now seen corresponding path program 1 times [2019-10-03 04:17:25,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:17:25,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:25,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:25,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:25,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:17:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 34 proven. 25 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-03 04:17:25,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:25,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:17:25,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2019-10-03 04:17:25,658 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [42], [45], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [96], [98], [99], [100], [103], [106], [108], [110], [112], [114], [115], [116], [119], [125], [131], [135], [138], [140], [143], [145], [148], [151], [153], [156], [161], [163], [164], [167], [169], [174], [177], [181], [182], [183], [200], [203], [206], [208], [210], [212], [214], [215], [218], [224], [230], [234], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [282], [286], [292], [300], [351], [352], [366], [368], [370], [372], [377], [380], [388], [393], [401], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [458], [459], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2019-10-03 04:17:25,659 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:17:25,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:17:26,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:17:26,162 INFO L272 AbstractInterpreter]: Visited 116 different actions 1316 times. Merged at 29 different actions 486 times. Widened at 1 different actions 5 times. Performed 10460 root evaluator evaluations with a maximum evaluation depth of 4. Performed 10460 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 89 fixpoints after 8 different actions. Largest state had 48 variables. [2019-10-03 04:17:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:26,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:17:26,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:26,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:17:26,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:26,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:17:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:26,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 04:17:26,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:17:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-03 04:17:26,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:17:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 39 proven. 9 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-03 04:17:26,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:17:26,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2019-10-03 04:17:26,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:17:26,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:17:26,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:17:26,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-03 04:17:26,769 INFO L87 Difference]: Start difference. First operand 87757 states and 104341 transitions. Second operand 6 states. [2019-10-03 04:17:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:27,028 INFO L93 Difference]: Finished difference Result 78706 states and 93987 transitions. [2019-10-03 04:17:27,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 04:17:27,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2019-10-03 04:17:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:27,185 INFO L225 Difference]: With dead ends: 78706 [2019-10-03 04:17:27,185 INFO L226 Difference]: Without dead ends: 78706 [2019-10-03 04:17:27,185 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 530 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-03 04:17:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78706 states. [2019-10-03 04:17:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78706 to 73845. [2019-10-03 04:17:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73845 states. [2019-10-03 04:17:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73845 states to 73845 states and 87107 transitions. [2019-10-03 04:17:28,653 INFO L78 Accepts]: Start accepts. Automaton has 73845 states and 87107 transitions. Word has length 267 [2019-10-03 04:17:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:17:28,654 INFO L475 AbstractCegarLoop]: Abstraction has 73845 states and 87107 transitions. [2019-10-03 04:17:28,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:17:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 73845 states and 87107 transitions. [2019-10-03 04:17:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-03 04:17:28,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:17:28,663 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:17:28,663 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:17:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash 191881174, now seen corresponding path program 1 times [2019-10-03 04:17:28,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:17:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:28,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:17:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 40 proven. 17 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-03 04:17:28,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:28,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:17:28,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2019-10-03 04:17:28,835 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [42], [45], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [96], [98], [99], [100], [103], [106], [108], [110], [112], [114], [115], [116], [119], [125], [131], [135], [138], [140], [143], [145], [148], [151], [153], [156], [161], [163], [164], [167], [169], [174], [179], [181], [182], [183], [200], [203], [206], [208], [210], [212], [214], [215], [218], [224], [230], [234], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [279], [286], [289], [295], [300], [301], [304], [325], [329], [350], [351], [352], [366], [368], [370], [372], [377], [380], [388], [393], [401], [404], [409], [411], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [458], [459], [460], [461], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2019-10-03 04:17:28,837 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:17:28,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:17:30,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:17:30,248 INFO L272 AbstractInterpreter]: Visited 169 different actions 4126 times. Merged at 76 different actions 1479 times. Widened at 3 different actions 8 times. Performed 24458 root evaluator evaluations with a maximum evaluation depth of 4. Performed 24458 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 247 fixpoints after 22 different actions. Largest state had 48 variables. [2019-10-03 04:17:30,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:30,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:17:30,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:30,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:17:30,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:30,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:17:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:30,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-03 04:17:30,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:17:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 153 proven. 4 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-03 04:17:30,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:17:30,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:17:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-03 04:17:30,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:17:30,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 5] total 15 [2019-10-03 04:17:30,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:17:30,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:17:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:17:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-10-03 04:17:30,810 INFO L87 Difference]: Start difference. First operand 73845 states and 87107 transitions. Second operand 5 states. [2019-10-03 04:17:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:32,133 INFO L93 Difference]: Finished difference Result 82886 states and 103467 transitions. [2019-10-03 04:17:32,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:17:32,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 276 [2019-10-03 04:17:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:32,324 INFO L225 Difference]: With dead ends: 82886 [2019-10-03 04:17:32,324 INFO L226 Difference]: Without dead ends: 82886 [2019-10-03 04:17:32,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 549 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-03 04:17:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82886 states. [2019-10-03 04:17:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82886 to 76647. [2019-10-03 04:17:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76647 states. [2019-10-03 04:17:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76647 states to 76647 states and 90366 transitions. [2019-10-03 04:17:33,351 INFO L78 Accepts]: Start accepts. Automaton has 76647 states and 90366 transitions. Word has length 276 [2019-10-03 04:17:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:17:33,351 INFO L475 AbstractCegarLoop]: Abstraction has 76647 states and 90366 transitions. [2019-10-03 04:17:33,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:17:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 76647 states and 90366 transitions. [2019-10-03 04:17:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-03 04:17:33,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:17:33,362 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:17:33,362 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:17:33,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:33,363 INFO L82 PathProgramCache]: Analyzing trace with hash 296359146, now seen corresponding path program 1 times [2019-10-03 04:17:33,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:17:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:33,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:33,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:17:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 46 proven. 26 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-03 04:17:33,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:33,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:17:33,484 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2019-10-03 04:17:33,485 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [80], [81], [86], [89], [91], [96], [98], [99], [100], [103], [106], [108], [110], [112], [114], [115], [116], [119], [125], [131], [135], [138], [140], [143], [145], [148], [153], [156], [159], [161], [163], [164], [167], [169], [174], [179], [181], [182], [183], [184], [189], [192], [194], [198], [199], [200], [203], [206], [208], [210], [212], [214], [215], [218], [224], [230], [234], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [282], [286], [289], [300], [301], [304], [325], [332], [334], [340], [343], [350], [351], [352], [366], [368], [370], [372], [377], [380], [388], [393], [401], [411], [415], [418], [420], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [438], [439], [440], [442], [443], [446], [447], [448], [449], [450], [451], [452], [454], [455], [456], [457], [458], [459], [460], [461], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2019-10-03 04:17:33,486 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:17:33,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:17:35,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:17:35,353 INFO L272 AbstractInterpreter]: Visited 177 different actions 4417 times. Merged at 73 different actions 1439 times. Widened at 2 different actions 8 times. Performed 26913 root evaluator evaluations with a maximum evaluation depth of 4. Performed 26913 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 207 fixpoints after 20 different actions. Largest state had 48 variables. [2019-10-03 04:17:35,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:35,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:17:35,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:35,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:17:35,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:35,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:17:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:35,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 04:17:35,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:17:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-03 04:17:35,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:17:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-03 04:17:35,909 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:17:35,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 13 [2019-10-03 04:17:35,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:17:35,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:17:35,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:17:35,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-03 04:17:35,911 INFO L87 Difference]: Start difference. First operand 76647 states and 90366 transitions. Second operand 6 states. [2019-10-03 04:17:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:36,133 INFO L93 Difference]: Finished difference Result 78740 states and 92527 transitions. [2019-10-03 04:17:36,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:17:36,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 277 [2019-10-03 04:17:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:36,286 INFO L225 Difference]: With dead ends: 78740 [2019-10-03 04:17:36,287 INFO L226 Difference]: Without dead ends: 78740 [2019-10-03 04:17:36,287 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 551 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-03 04:17:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78740 states. [2019-10-03 04:17:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78740 to 77884. [2019-10-03 04:17:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77884 states. [2019-10-03 04:17:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77884 states to 77884 states and 91573 transitions. [2019-10-03 04:17:37,823 INFO L78 Accepts]: Start accepts. Automaton has 77884 states and 91573 transitions. Word has length 277 [2019-10-03 04:17:37,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:17:37,823 INFO L475 AbstractCegarLoop]: Abstraction has 77884 states and 91573 transitions. [2019-10-03 04:17:37,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:17:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 77884 states and 91573 transitions. [2019-10-03 04:17:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-03 04:17:37,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:17:37,830 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:17:37,830 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:17:37,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:37,830 INFO L82 PathProgramCache]: Analyzing trace with hash 792657224, now seen corresponding path program 1 times [2019-10-03 04:17:37,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:17:37,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:37,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:37,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:37,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:17:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 38 proven. 34 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-03 04:17:37,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:37,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:17:37,970 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2019-10-03 04:17:37,970 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [80], [81], [86], [89], [91], [96], [98], [99], [100], [103], [106], [108], [110], [112], [114], [115], [116], [119], [125], [131], [135], [138], [140], [143], [145], [148], [151], [153], [156], [159], [161], [163], [164], [167], [169], [174], [179], [181], [182], [183], [184], [189], [192], [194], [198], [199], [200], [203], [206], [208], [210], [212], [214], [215], [218], [224], [230], [234], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [279], [286], [289], [300], [301], [304], [325], [332], [334], [340], [343], [350], [351], [352], [366], [368], [370], [372], [377], [380], [388], [393], [401], [411], [415], [418], [420], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [438], [439], [440], [442], [443], [446], [447], [448], [449], [450], [451], [452], [454], [455], [456], [457], [458], [459], [460], [461], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2019-10-03 04:17:37,973 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:17:37,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:17:39,220 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:17:39,220 INFO L272 AbstractInterpreter]: Visited 178 different actions 6568 times. Merged at 74 different actions 2300 times. Widened at 2 different actions 8 times. Performed 36994 root evaluator evaluations with a maximum evaluation depth of 4. Performed 36994 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 370 fixpoints after 19 different actions. Largest state had 48 variables. [2019-10-03 04:17:39,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:39,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:17:39,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:39,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:17:39,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:39,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:17:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:39,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 04:17:39,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:17:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-03 04:17:39,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:17:41,733 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 6 [2019-10-03 04:17:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-03 04:17:41,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:17:41,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 6] total 13 [2019-10-03 04:17:41,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:17:41,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:17:41,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:17:41,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-03 04:17:41,974 INFO L87 Difference]: Start difference. First operand 77884 states and 91573 transitions. Second operand 6 states. [2019-10-03 04:17:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:42,191 INFO L93 Difference]: Finished difference Result 78329 states and 91687 transitions. [2019-10-03 04:17:42,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:17:42,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 278 [2019-10-03 04:17:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:42,341 INFO L225 Difference]: With dead ends: 78329 [2019-10-03 04:17:42,341 INFO L226 Difference]: Without dead ends: 78329 [2019-10-03 04:17:42,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 553 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-03 04:17:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78329 states. [2019-10-03 04:17:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78329 to 78062. [2019-10-03 04:17:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78062 states. [2019-10-03 04:17:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78062 states to 78062 states and 91420 transitions. [2019-10-03 04:17:43,235 INFO L78 Accepts]: Start accepts. Automaton has 78062 states and 91420 transitions. Word has length 278 [2019-10-03 04:17:43,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:17:43,235 INFO L475 AbstractCegarLoop]: Abstraction has 78062 states and 91420 transitions. [2019-10-03 04:17:43,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:17:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 78062 states and 91420 transitions. [2019-10-03 04:17:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-03 04:17:43,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:17:43,242 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:17:43,242 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:17:43,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:43,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1822016522, now seen corresponding path program 1 times [2019-10-03 04:17:43,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:17:43,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:43,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:43,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:43,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:17:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-03 04:17:43,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:43,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:17:43,377 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2019-10-03 04:17:43,377 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [80], [81], [86], [89], [91], [94], [98], [99], [100], [103], [106], [108], [110], [112], [114], [115], [116], [119], [125], [131], [135], [138], [140], [143], [145], [148], [151], [153], [156], [159], [161], [163], [164], [167], [169], [174], [179], [181], [182], [183], [184], [189], [192], [194], [198], [199], [200], [203], [206], [208], [210], [212], [214], [215], [218], [224], [230], [234], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [279], [286], [289], [300], [301], [304], [325], [332], [334], [340], [343], [350], [351], [352], [366], [368], [370], [372], [377], [380], [388], [393], [401], [411], [415], [418], [420], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [438], [439], [440], [442], [443], [446], [447], [448], [449], [450], [451], [452], [454], [455], [456], [457], [458], [459], [460], [461], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2019-10-03 04:17:43,380 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:17:43,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:17:54,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:17:54,446 INFO L272 AbstractInterpreter]: Visited 178 different actions 42477 times. Merged at 80 different actions 13739 times. Widened at 3 different actions 132 times. Performed 289294 root evaluator evaluations with a maximum evaluation depth of 4. Performed 289294 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2772 fixpoints after 32 different actions. Largest state had 48 variables. [2019-10-03 04:17:54,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:54,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:17:54,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:54,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:17:54,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:54,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:17:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:54,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-03 04:17:54,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:17:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-03 04:17:54,803 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:17:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-03 04:17:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:17:55,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-03 04:17:55,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:17:55,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:17:55,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:17:55,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:17:55,026 INFO L87 Difference]: Start difference. First operand 78062 states and 91420 transitions. Second operand 3 states. [2019-10-03 04:17:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:55,413 INFO L93 Difference]: Finished difference Result 78501 states and 91762 transitions. [2019-10-03 04:17:55,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:17:55,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-10-03 04:17:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:55,649 INFO L225 Difference]: With dead ends: 78501 [2019-10-03 04:17:55,649 INFO L226 Difference]: Without dead ends: 78501 [2019-10-03 04:17:55,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:17:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78501 states. [2019-10-03 04:17:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78501 to 78062. [2019-10-03 04:17:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78062 states. [2019-10-03 04:18:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78062 states to 78062 states and 91279 transitions. [2019-10-03 04:18:00,102 INFO L78 Accepts]: Start accepts. Automaton has 78062 states and 91279 transitions. Word has length 278 [2019-10-03 04:18:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:00,102 INFO L475 AbstractCegarLoop]: Abstraction has 78062 states and 91279 transitions. [2019-10-03 04:18:00,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:18:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 78062 states and 91279 transitions. [2019-10-03 04:18:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-03 04:18:00,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:00,111 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:18:00,112 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:00,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:00,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1108328273, now seen corresponding path program 1 times [2019-10-03 04:18:00,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:00,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:00,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:00,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:00,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-03 04:18:00,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:00,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:00,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 281 with the following transitions: [2019-10-03 04:18:00,370 INFO L207 CegarAbsIntRunner]: [2], [18], [21], [28], [30], [37], [40], [56], [59], [66], [67], [70], [72], [75], [80], [81], [86], [89], [91], [94], [98], [99], [100], [103], [106], [108], [110], [112], [114], [115], [116], [119], [125], [131], [135], [138], [140], [143], [145], [148], [151], [153], [156], [159], [161], [163], [164], [167], [169], [174], [179], [181], [182], [183], [184], [189], [192], [194], [198], [199], [200], [203], [206], [208], [210], [212], [214], [215], [218], [224], [230], [234], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [266], [273], [276], [279], [286], [289], [300], [301], [304], [306], [311], [314], [325], [332], [334], [340], [343], [350], [351], [352], [366], [368], [370], [372], [377], [380], [388], [393], [401], [411], [415], [418], [420], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [438], [439], [440], [442], [443], [446], [447], [448], [449], [450], [451], [452], [454], [455], [456], [457], [458], [459], [460], [461], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2019-10-03 04:18:00,372 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:00,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:12,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:12,655 INFO L272 AbstractInterpreter]: Visited 181 different actions 52134 times. Merged at 88 different actions 17799 times. Widened at 3 different actions 135 times. Performed 347329 root evaluator evaluations with a maximum evaluation depth of 4. Performed 347329 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3273 fixpoints after 31 different actions. Largest state had 48 variables. [2019-10-03 04:18:12,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:12,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:12,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:12,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:12,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:12,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:12,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-03 04:18:12,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 35 proven. 95 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-03 04:18:13,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:13,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 04:18:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 04:18:13,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 04:18:13,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 04:18:13,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 04:18:13,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 04:18:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-03 04:18:13,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:18:13,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 22 [2019-10-03 04:18:13,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:18:13,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 04:18:13,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 04:18:13,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-10-03 04:18:13,950 INFO L87 Difference]: Start difference. First operand 78062 states and 91279 transitions. Second operand 15 states. [2019-10-03 04:18:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:18,818 INFO L93 Difference]: Finished difference Result 109526 states and 133321 transitions. [2019-10-03 04:18:18,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-03 04:18:18,818 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 280 [2019-10-03 04:18:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:19,120 INFO L225 Difference]: With dead ends: 109526 [2019-10-03 04:18:19,121 INFO L226 Difference]: Without dead ends: 109410 [2019-10-03 04:18:19,121 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 551 SyntacticMatches, 18 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=1589, Unknown=0, NotChecked=0, Total=1892 [2019-10-03 04:18:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109410 states. [2019-10-03 04:18:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109410 to 101771. [2019-10-03 04:18:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101771 states. [2019-10-03 04:18:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101771 states to 101771 states and 119059 transitions. [2019-10-03 04:18:20,894 INFO L78 Accepts]: Start accepts. Automaton has 101771 states and 119059 transitions. Word has length 280 [2019-10-03 04:18:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:20,894 INFO L475 AbstractCegarLoop]: Abstraction has 101771 states and 119059 transitions. [2019-10-03 04:18:20,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 04:18:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 101771 states and 119059 transitions. [2019-10-03 04:18:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-03 04:18:20,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:20,902 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:18:20,902 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:20,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1148488998, now seen corresponding path program 1 times [2019-10-03 04:18:20,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:20,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:20,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-03 04:18:21,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:18:21,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:18:21,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:21,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:18:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:18:21,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:18:21,013 INFO L87 Difference]: Start difference. First operand 101771 states and 119059 transitions. Second operand 4 states. [2019-10-03 04:18:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:21,466 INFO L93 Difference]: Finished difference Result 99026 states and 115069 transitions. [2019-10-03 04:18:21,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:18:21,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-10-03 04:18:21,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:21,664 INFO L225 Difference]: With dead ends: 99026 [2019-10-03 04:18:21,664 INFO L226 Difference]: Without dead ends: 99026 [2019-10-03 04:18:21,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:18:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99026 states. [2019-10-03 04:18:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99026 to 98623. [2019-10-03 04:18:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98623 states. [2019-10-03 04:18:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98623 states to 98623 states and 114635 transitions. [2019-10-03 04:18:23,704 INFO L78 Accepts]: Start accepts. Automaton has 98623 states and 114635 transitions. Word has length 286 [2019-10-03 04:18:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:23,704 INFO L475 AbstractCegarLoop]: Abstraction has 98623 states and 114635 transitions. [2019-10-03 04:18:23,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:18:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 98623 states and 114635 transitions. [2019-10-03 04:18:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-03 04:18:23,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:23,712 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:18:23,712 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2055245445, now seen corresponding path program 1 times [2019-10-03 04:18:23,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:23,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:23,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:23,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:23,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 41 proven. 35 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-03 04:18:23,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:23,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:23,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 287 with the following transitions: [2019-10-03 04:18:23,841 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [21], [28], [30], [37], [40], [42], [45], [56], [59], [66], [67], [70], [72], [75], [77], [80], [81], [86], [89], [91], [94], [98], [99], [100], [103], [106], [108], [110], [112], [114], [115], [116], [119], [125], [131], [135], [138], [140], [143], [145], [148], [151], [153], [156], [161], [163], [164], [167], [169], [174], [179], [181], [182], [183], [184], [189], [192], [198], [199], [200], [203], [206], [208], [210], [212], [214], [215], [218], [224], [230], [234], [235], [236], [237], [238], [239], [248], [251], [254], [256], [260], [263], [273], [276], [286], [289], [300], [301], [304], [325], [332], [334], [340], [343], [350], [351], [352], [366], [368], [370], [372], [377], [380], [388], [393], [401], [411], [415], [418], [420], [422], [424], [426], [427], [428], [429], [430], [431], [434], [435], [436], [438], [439], [440], [442], [443], [446], [447], [448], [449], [450], [451], [454], [455], [456], [457], [458], [459], [460], [461], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498] [2019-10-03 04:18:23,845 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:23,846 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:29,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:29,126 INFO L272 AbstractInterpreter]: Visited 179 different actions 21316 times. Merged at 81 different actions 7067 times. Widened at 3 different actions 47 times. Performed 135933 root evaluator evaluations with a maximum evaluation depth of 4. Performed 135933 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1304 fixpoints after 30 different actions. Largest state had 48 variables. [2019-10-03 04:18:29,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:29,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:29,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:29,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:29,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:29,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:29,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 04:18:29,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-03 04:18:29,532 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-03 04:18:29,736 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:18:29,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 13 [2019-10-03 04:18:29,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:29,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:18:29,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:18:29,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-03 04:18:29,738 INFO L87 Difference]: Start difference. First operand 98623 states and 114635 transitions. Second operand 6 states. [2019-10-03 04:18:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:29,959 INFO L93 Difference]: Finished difference Result 84882 states and 97835 transitions. [2019-10-03 04:18:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:18:29,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2019-10-03 04:18:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:30,115 INFO L225 Difference]: With dead ends: 84882 [2019-10-03 04:18:30,115 INFO L226 Difference]: Without dead ends: 84882 [2019-10-03 04:18:30,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 569 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-03 04:18:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84882 states. [2019-10-03 04:18:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84882 to 72413. [2019-10-03 04:18:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72413 states. [2019-10-03 04:18:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72413 states to 72413 states and 83875 transitions. [2019-10-03 04:18:30,996 INFO L78 Accepts]: Start accepts. Automaton has 72413 states and 83875 transitions. Word has length 286 [2019-10-03 04:18:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:30,996 INFO L475 AbstractCegarLoop]: Abstraction has 72413 states and 83875 transitions. [2019-10-03 04:18:30,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:18:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 72413 states and 83875 transitions. [2019-10-03 04:18:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-03 04:18:31,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:31,002 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:18:31,002 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2000852547, now seen corresponding path program 1 times [2019-10-03 04:18:31,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:31,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:31,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:31,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:31,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 04:18:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 04:18:32,053 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 04:18:32,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:18:32 BoogieIcfgContainer [2019-10-03 04:18:32,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:18:32,300 INFO L168 Benchmark]: Toolchain (without parser) took 522518.18 ms. Allocated memory was 131.1 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 86.2 MB in the beginning and 1.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-10-03 04:18:32,301 INFO L168 Benchmark]: CDTParser took 1.02 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 04:18:32,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.59 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 85.9 MB in the beginning and 171.8 MB in the end (delta: -85.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2019-10-03 04:18:32,305 INFO L168 Benchmark]: Boogie Preprocessor took 48.67 ms. Allocated memory is still 198.2 MB. Free memory was 171.8 MB in the beginning and 169.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-03 04:18:32,305 INFO L168 Benchmark]: RCFGBuilder took 684.51 ms. Allocated memory is still 198.2 MB. Free memory was 169.4 MB in the beginning and 131.4 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 7.1 GB. [2019-10-03 04:18:32,307 INFO L168 Benchmark]: TraceAbstraction took 521286.73 ms. Allocated memory was 198.2 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 130.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-10-03 04:18:32,315 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 493.59 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 85.9 MB in the beginning and 171.8 MB in the end (delta: -85.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.67 ms. Allocated memory is still 198.2 MB. Free memory was 171.8 MB in the beginning and 169.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 684.51 ms. Allocated memory is still 198.2 MB. Free memory was 169.4 MB in the beginning and 131.4 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 521286.73 ms. Allocated memory was 198.2 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 130.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; VAL [\old(C_1_ev)=80, \old(C_1_i)=69, \old(C_1_pc)=85, \old(C_1_pr)=82, \old(C_1_st)=84, \old(data_0)=77, \old(data_1)=68, \old(e)=67, \old(i)=71, \old(max_loop)=83, \old(num)=70, \old(P_1_ev)=72, \old(P_1_i)=81, \old(P_1_pc)=74, \old(P_1_st)=78, \old(P_2_ev)=73, \old(P_2_i)=86, \old(P_2_pc)=76, \old(P_2_st)=79, \old(timer)=75, C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, count=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L608] CALL init_model() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] C_1_i = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L608] RET init_model() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, count=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L609] CALL start_simulation() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L530] FCALL update_channels() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L531] CALL init_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L304] COND TRUE (int )C_1_i == 1 [L305] C_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L531] RET init_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L532] FCALL fire_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L533] CALL activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L465] CALL, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L104] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L107] COND FALSE !((int )P_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L117] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L119] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L465] RET, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, is_P_1_triggered()=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0] [L473] CALL, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L172] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L175] COND FALSE !((int )P_2_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L185] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L187] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L473] RET, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, is_P_2_triggered()=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0] [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L481] CALL, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L254] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L267] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L277] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L279] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L481] RET, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, is_C_1_triggered()=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L533] RET activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L534] FCALL reset_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L537] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L540] kernel_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L541] CALL eval() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L346] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L349] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L335] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L349] RET, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp___2=1] [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp) [L362] P_1_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L363] CALL P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L72] COND TRUE (int )P_1_pc == 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L83] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L86] CALL write_data(num, 'A') VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L49] COND TRUE i___0 == 0 [L50] data_0 = c VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, c=65, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, i___0=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L86] RET write_data(num, 'A') VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L87] num += 1 [L88] P_1_pc = 1 [L89] P_1_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L363] RET P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND TRUE \read(tmp___0) [L377] P_2_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0, tmp=1, tmp___0=1, tmp___2=1] [L378] CALL P_2() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L130] COND TRUE (int )P_2_pc == 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L141] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L144] CALL write_data(num, 'B') VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L49] COND FALSE !(i___0 == 0) VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L52] COND TRUE i___0 == 1 [L53] data_1 = c VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L144] RET write_data(num, 'B') VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L145] num += 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L147] COND FALSE !(\read(timer)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L157] P_2_pc = 1 [L158] P_2_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L378] RET P_2() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___2=1] [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND TRUE \read(tmp___1) [L392] C_1_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L393] CALL C_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L196] char c ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L199] COND TRUE (int )C_1_pc == 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L214] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L216] COND FALSE !(num == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L227] num -= 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L228] COND FALSE !(! (num >= 0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L236] CALL, EXPR read_data(num) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L23] char c ; [L24] char __retres3 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L27] COND FALSE !(i___0 == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L31] COND TRUE i___0 == 1 [L32] __retres3 = data_1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres3=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L42] return (__retres3); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=66, __retres3=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L236] RET, EXPR read_data(num) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, read_data(num)=66, timer=0] [L236] c = read_data(num) [L237] i += 1 [L238] C_1_pc = 2 [L239] C_1_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, c=66, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L393] RET C_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L346] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L349] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L317] COND FALSE !((int )P_1_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L321] COND FALSE !((int )P_2_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L325] COND FALSE !((int )C_1_st == 0) [L333] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L335] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L349] RET, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L349] tmp___2 = exists_runnable_thread() [L351] COND FALSE !(\read(tmp___2)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=0] [L541] RET eval() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L544] kernel_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L545] FCALL update_channels() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L548] kernel_st = 3 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L549] FCALL fire_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L550] CALL activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] CALL, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L104] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L107] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L108] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L117] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L119] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] RET, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_1_triggered()=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L473] CALL, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L172] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L175] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L176] COND FALSE !((int )P_2_ev == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L185] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L187] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L473] RET, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_2_triggered()=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0] [L481] CALL, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L254] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L267] COND TRUE (int )C_1_pc == 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L268] COND FALSE !((int )C_1_ev == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L277] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L279] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L481] RET, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_C_1_triggered()=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0] [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L550] RET activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L551] FCALL reset_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L554] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L317] COND FALSE !((int )P_1_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L321] COND FALSE !((int )P_2_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L325] COND FALSE !((int )C_1_st == 0) [L333] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L335] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L554] RET, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L554] tmp = exists_runnable_thread() [L556] COND TRUE tmp == 0 [L558] kernel_st = 4 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L559] CALL fire_time_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L428] C_1_ev = 1 [L429] P_1_ev = 1 [L430] P_2_ev = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L559] RET fire_time_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L560] CALL activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] CALL, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L104] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L107] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L108] COND TRUE (int )P_1_ev == 1 [L109] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L119] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] RET, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_1_triggered()=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] tmp = is_P_1_triggered() [L467] COND TRUE \read(tmp) [L468] P_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1] [L473] CALL, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L172] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L175] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L176] COND TRUE (int )P_2_ev == 1 [L177] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L187] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L473] RET, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_2_triggered()=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1] [L473] tmp___0 = is_P_2_triggered() [L475] COND TRUE \read(tmp___0) [L476] P_2_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1] [L481] CALL, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L254] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L267] COND TRUE (int )C_1_pc == 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L268] COND TRUE (int )C_1_ev == 1 [L269] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L279] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L481] RET, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_C_1_triggered()=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1] [L481] tmp___1 = is_C_1_triggered() [L483] COND TRUE \read(tmp___1) [L484] C_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1, tmp___1=1] [L560] RET activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0] [L561] CALL reset_time_events() VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L439] COND TRUE (int )P_1_ev == 1 [L440] P_1_ev = 2 VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L444] COND TRUE (int )P_2_ev == 1 [L445] P_2_ev = 2 VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L449] COND TRUE (int )C_1_ev == 1 [L450] C_1_ev = 2 VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L561] RET reset_time_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0] [L567] CALL, EXPR stop_simulation() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L504] int tmp ; [L505] int __retres2 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L509] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L335] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L509] RET, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L509] tmp = exists_runnable_thread() [L511] COND TRUE \read(tmp) [L512] __retres2 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1] [L519] return (__retres2); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1] [L567] RET, EXPR stop_simulation() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, stop_simulation()=0, timer=0, tmp=0] [L567] tmp___0 = stop_simulation() [L569] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L537] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L540] kernel_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L541] CALL eval() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L346] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L349] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L335] return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, \result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L349] RET, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp___2=1] [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp) [L362] P_1_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L363] CALL P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L72] COND FALSE !((int )P_1_pc == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L75] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L83] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L86] CALL write_data(num, 'A') VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L49] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, c=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L52] COND TRUE i___0 == 1 [L53] data_1 = c VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, c=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L86] RET write_data(num, 'A') VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L87] num += 1 [L88] P_1_pc = 1 [L89] P_1_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L363] RET P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND TRUE \read(tmp___0) [L377] P_2_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0, tmp=1, tmp___0=1, tmp___2=1] [L378] CALL P_2() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L130] COND FALSE !((int )P_2_pc == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L133] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L141] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L144] CALL write_data(num, 'B') VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L49] COND FALSE !(i___0 == 0) VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L52] COND FALSE !(i___0 == 1) VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L56] CALL error() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L9] __VERIFIER_error() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 181 locations, 1 error locations. UNSAFE Result, 521.2s OverallTime, 37 OverallIterations, 6 TraceHistogramMax, 414.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13680 SDtfs, 23509 SDslu, 78223 SDs, 0 SdLazy, 69150 SolverSat, 15175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7357 GetRequests, 5708 SyntacticMatches, 44 SemanticMatches, 1605 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239324 ImplicationChecksByTransitivity, 40.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122788occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 36.4s AbstIntTime, 19 AbstIntIterations, 8 AbstIntStrong, 0.9862399951083803 AbsIntWeakeningRatio, 0.756120527306968 AbsIntAvgWeakeningVarsNumRemoved, 24.563088512241055 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 45.9s AutomataMinimizationTime, 36 MinimizatonAttempts, 61246 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 8838 NumberOfCodeBlocks, 8838 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 10988 ConstructedInterpolants, 0 QuantifiedInterpolants, 3554173 SizeOfPredicates, 18 NumberOfNonLiveVariables, 11012 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 58 InterpolantComputations, 33 PerfectInterpolantSequences, 5494/5890 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...