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/transmitter.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:42:49,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:42:49,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:42:50,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:42:50,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:42:50,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:42:50,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:42:50,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:42:50,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:42:50,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:42:50,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:42:50,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:42:50,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:42:50,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:42:50,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:42:50,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:42:50,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:42:50,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:42:50,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:42:50,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:42:50,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:42:50,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:42:50,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:42:50,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:42:50,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:42:50,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:42:50,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:42:50,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:42:50,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:42:50,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:42:50,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:42:50,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:42:50,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:42:50,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:42:50,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:42:50,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:42:50,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:42:50,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:42:50,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:42:50,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:42:50,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:42:50,072 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-09-10 03:42:50,086 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:42:50,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:42:50,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:42:50,087 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:42:50,087 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:42:50,087 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:42:50,088 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:42:50,088 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:42:50,088 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:42:50,088 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:42:50,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:42:50,089 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:42:50,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:42:50,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:42:50,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:42:50,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:42:50,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:42:50,090 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:42:50,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:42:50,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:42:50,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:42:50,091 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:42:50,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:42:50,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:42:50,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:42:50,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:42:50,092 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:42:50,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:42:50,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:42:50,093 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:42:50,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:42:50,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:42:50,152 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:42:50,153 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:42:50,154 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:42:50,157 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2019-09-10 03:42:50,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac5edbad/83dc659679a24136adda470d96b04973/FLAGd55fcf192 [2019-09-10 03:42:50,718 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:42:50,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2019-09-10 03:42:50,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac5edbad/83dc659679a24136adda470d96b04973/FLAGd55fcf192 [2019-09-10 03:42:51,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac5edbad/83dc659679a24136adda470d96b04973 [2019-09-10 03:42:51,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:42:51,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:42:51,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:42:51,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:42:51,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:42:51,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:42:51" (1/1) ... [2019-09-10 03:42:51,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f6533f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51, skipping insertion in model container [2019-09-10 03:42:51,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:42:51" (1/1) ... [2019-09-10 03:42:51,067 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:42:51,096 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:42:51,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:42:51,310 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:42:51,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:42:51,453 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:42:51,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51 WrapperNode [2019-09-10 03:42:51,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:42:51,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:42:51,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:42:51,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:42:51,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51" (1/1) ... [2019-09-10 03:42:51,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51" (1/1) ... [2019-09-10 03:42:51,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51" (1/1) ... [2019-09-10 03:42:51,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51" (1/1) ... [2019-09-10 03:42:51,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51" (1/1) ... [2019-09-10 03:42:51,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51" (1/1) ... [2019-09-10 03:42:51,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51" (1/1) ... [2019-09-10 03:42:51,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:42:51,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:42:51,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:42:51,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:42:51,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51" (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-09-10 03:42:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:42:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:42:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:42:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:42:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:42:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:42:51,548 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:42:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:42:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:42:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:42:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:42:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:42:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:42:51,550 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:42:51,550 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:42:51,550 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:42:51,550 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:42:51,550 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:42:51,550 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:42:51,551 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:42:51,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:42:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:42:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:42:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:42:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:42:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:42:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:42:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:42:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:42:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:42:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:42:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:42:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:42:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:42:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:42:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:42:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:42:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:42:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:42:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:42:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:42:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:42:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:42:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:42:52,025 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:42:52,026 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-10 03:42:52,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:42:52 BoogieIcfgContainer [2019-09-10 03:42:52,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:42:52,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:42:52,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:42:52,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:42:52,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:42:51" (1/3) ... [2019-09-10 03:42:52,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65801ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:42:52, skipping insertion in model container [2019-09-10 03:42:52,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:42:51" (2/3) ... [2019-09-10 03:42:52,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65801ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:42:52, skipping insertion in model container [2019-09-10 03:42:52,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:42:52" (3/3) ... [2019-09-10 03:42:52,035 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2019-09-10 03:42:52,049 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:42:52,057 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:42:52,071 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:42:52,097 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:42:52,097 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:42:52,097 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:42:52,097 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:42:52,098 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:42:52,098 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:42:52,098 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:42:52,098 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:42:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-09-10 03:42:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 03:42:52,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:52,134 INFO L399 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] [2019-09-10 03:42:52,136 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:52,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1024647557, now seen corresponding path program 1 times [2019-09-10 03:42:52,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:52,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:52,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:42:52,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:42:52,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:42:52,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:52,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:42:52,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:42:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:42:52,475 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 5 states. [2019-09-10 03:42:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:53,007 INFO L93 Difference]: Finished difference Result 166 states and 218 transitions. [2019-09-10 03:42:53,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:42:53,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 03:42:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:53,023 INFO L225 Difference]: With dead ends: 166 [2019-09-10 03:42:53,023 INFO L226 Difference]: Without dead ends: 154 [2019-09-10 03:42:53,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:42:53,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-10 03:42:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2019-09-10 03:42:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 03:42:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2019-09-10 03:42:53,084 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 75 [2019-09-10 03:42:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:53,085 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2019-09-10 03:42:53,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:42:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2019-09-10 03:42:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 03:42:53,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:53,090 INFO L399 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] [2019-09-10 03:42:53,090 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash -148628551, now seen corresponding path program 1 times [2019-09-10 03:42:53,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:53,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:53,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:42:53,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:42:53,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:42:53,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:53,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:42:53,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:42:53,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:42:53,213 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand 5 states. [2019-09-10 03:42:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:53,602 INFO L93 Difference]: Finished difference Result 154 states and 205 transitions. [2019-09-10 03:42:53,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:42:53,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 03:42:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:53,611 INFO L225 Difference]: With dead ends: 154 [2019-09-10 03:42:53,611 INFO L226 Difference]: Without dead ends: 154 [2019-09-10 03:42:53,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:42:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-10 03:42:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2019-09-10 03:42:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 03:42:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2019-09-10 03:42:53,636 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 75 [2019-09-10 03:42:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:53,637 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2019-09-10 03:42:53,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:42:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2019-09-10 03:42:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 03:42:53,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:53,640 INFO L399 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] [2019-09-10 03:42:53,641 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:53,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash 295272123, now seen corresponding path program 1 times [2019-09-10 03:42:53,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:53,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:53,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:53,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:53,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:42:53,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:42:53,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:42:53,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:53,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:42:53,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:42:53,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:42:53,748 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand 4 states. [2019-09-10 03:42:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:53,968 INFO L93 Difference]: Finished difference Result 229 states and 288 transitions. [2019-09-10 03:42:53,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:42:53,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-10 03:42:53,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:53,976 INFO L225 Difference]: With dead ends: 229 [2019-09-10 03:42:53,976 INFO L226 Difference]: Without dead ends: 229 [2019-09-10 03:42:53,977 INFO L628 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-09-10 03:42:53,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-10 03:42:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 224. [2019-09-10 03:42:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-10 03:42:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 284 transitions. [2019-09-10 03:42:54,008 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 284 transitions. Word has length 75 [2019-09-10 03:42:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:54,008 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 284 transitions. [2019-09-10 03:42:54,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:42:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 284 transitions. [2019-09-10 03:42:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 03:42:54,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:54,012 INFO L399 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] [2019-09-10 03:42:54,012 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash -578205572, now seen corresponding path program 1 times [2019-09-10 03:42:54,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:54,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:54,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:42:54,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:42:54,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:42:54,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:54,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:42:54,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:42:54,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:42:54,109 INFO L87 Difference]: Start difference. First operand 224 states and 284 transitions. Second operand 6 states. [2019-09-10 03:42:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:54,140 INFO L93 Difference]: Finished difference Result 234 states and 296 transitions. [2019-09-10 03:42:54,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:42:54,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-09-10 03:42:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:54,143 INFO L225 Difference]: With dead ends: 234 [2019-09-10 03:42:54,144 INFO L226 Difference]: Without dead ends: 234 [2019-09-10 03:42:54,144 INFO L628 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-09-10 03:42:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-10 03:42:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2019-09-10 03:42:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-10 03:42:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 288 transitions. [2019-09-10 03:42:54,161 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 288 transitions. Word has length 75 [2019-09-10 03:42:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:54,161 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 288 transitions. [2019-09-10 03:42:54,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:42:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 288 transitions. [2019-09-10 03:42:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 03:42:54,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:54,163 INFO L399 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] [2019-09-10 03:42:54,163 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:54,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1871394558, now seen corresponding path program 1 times [2019-09-10 03:42:54,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:42:54,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:42:54,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:42:54,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:54,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:42:54,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:42:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:42:54,220 INFO L87 Difference]: Start difference. First operand 229 states and 288 transitions. Second operand 4 states. [2019-09-10 03:42:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:54,378 INFO L93 Difference]: Finished difference Result 424 states and 528 transitions. [2019-09-10 03:42:54,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:42:54,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-10 03:42:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:54,382 INFO L225 Difference]: With dead ends: 424 [2019-09-10 03:42:54,383 INFO L226 Difference]: Without dead ends: 424 [2019-09-10 03:42:54,383 INFO L628 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-09-10 03:42:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-10 03:42:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-09-10 03:42:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-10 03:42:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 525 transitions. [2019-09-10 03:42:54,416 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 525 transitions. Word has length 75 [2019-09-10 03:42:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:54,417 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 525 transitions. [2019-09-10 03:42:54,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:42:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 525 transitions. [2019-09-10 03:42:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 03:42:54,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:54,420 INFO L399 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] [2019-09-10 03:42:54,420 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:54,420 INFO L82 PathProgramCache]: Analyzing trace with hash 893913146, now seen corresponding path program 1 times [2019-09-10 03:42:54,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:54,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:54,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 03:42:54,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:42:54,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:42:54,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:54,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:42:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:42:54,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:42:54,485 INFO L87 Difference]: Start difference. First operand 421 states and 525 transitions. Second operand 6 states. [2019-09-10 03:42:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:54,521 INFO L93 Difference]: Finished difference Result 435 states and 540 transitions. [2019-09-10 03:42:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:42:54,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-10 03:42:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:54,525 INFO L225 Difference]: With dead ends: 435 [2019-09-10 03:42:54,525 INFO L226 Difference]: Without dead ends: 435 [2019-09-10 03:42:54,525 INFO L628 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-09-10 03:42:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-10 03:42:54,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-09-10 03:42:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-10 03:42:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 533 transitions. [2019-09-10 03:42:54,544 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 533 transitions. Word has length 93 [2019-09-10 03:42:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:54,544 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 533 transitions. [2019-09-10 03:42:54,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:42:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 533 transitions. [2019-09-10 03:42:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 03:42:54,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:54,547 INFO L399 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] [2019-09-10 03:42:54,547 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:54,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1461892104, now seen corresponding path program 1 times [2019-09-10 03:42:54,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:54,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:54,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 03:42:54,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:42:54,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:42:54,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:54,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:42:54,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:42:54,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:42:54,639 INFO L87 Difference]: Start difference. First operand 431 states and 533 transitions. Second operand 5 states. [2019-09-10 03:42:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:54,925 INFO L93 Difference]: Finished difference Result 431 states and 525 transitions. [2019-09-10 03:42:54,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:42:54,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 03:42:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:54,929 INFO L225 Difference]: With dead ends: 431 [2019-09-10 03:42:54,929 INFO L226 Difference]: Without dead ends: 431 [2019-09-10 03:42:54,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:42:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-09-10 03:42:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2019-09-10 03:42:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-10 03:42:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 525 transitions. [2019-09-10 03:42:54,947 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 525 transitions. Word has length 93 [2019-09-10 03:42:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:54,948 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 525 transitions. [2019-09-10 03:42:54,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:42:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 525 transitions. [2019-09-10 03:42:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 03:42:54,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:54,950 INFO L399 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] [2019-09-10 03:42:54,950 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1935681914, now seen corresponding path program 1 times [2019-09-10 03:42:54,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:54,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:54,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 03:42:55,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:42:55,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:42:55,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:55,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:42:55,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:42:55,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:42:55,028 INFO L87 Difference]: Start difference. First operand 431 states and 525 transitions. Second operand 5 states. [2019-09-10 03:42:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:55,463 INFO L93 Difference]: Finished difference Result 626 states and 776 transitions. [2019-09-10 03:42:55,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:42:55,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 03:42:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:55,468 INFO L225 Difference]: With dead ends: 626 [2019-09-10 03:42:55,468 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 03:42:55,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:42:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 03:42:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 586. [2019-09-10 03:42:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-10 03:42:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 708 transitions. [2019-09-10 03:42:55,493 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 708 transitions. Word has length 93 [2019-09-10 03:42:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:55,494 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 708 transitions. [2019-09-10 03:42:55,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:42:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 708 transitions. [2019-09-10 03:42:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 03:42:55,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:55,496 INFO L399 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] [2019-09-10 03:42:55,496 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2111138888, now seen corresponding path program 1 times [2019-09-10 03:42:55,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:55,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:55,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:55,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:55,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:42:55,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:42:55,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:42:55,546 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2019-09-10 03:42:55,548 INFO L207 CegarAbsIntRunner]: [4], [6], [9], [20], [22], [28], [29], [31], [36], [39], [44], [46], [47], [50], [59], [60], [61], [71], [73], [75], [76], [81], [87], [93], [95], [98], [104], [108], [109], [114], [161], [162], [163], [172], [175], [178], [193], [197], [200], [223], [228], [234], [240], [242], [243], [257], [259], [289], [299], [301], [303], [304], [327], [328], [331], [333], [334], [335], [336], [337], [338], [339], [343], [344], [347], [348], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [381], [382], [383] [2019-09-10 03:42:55,585 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:42:55,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:42:55,712 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:42:55,715 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Performed 161 root evaluator evaluations with a maximum evaluation depth of 4. Performed 161 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 22 variables. [2019-09-10 03:42:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:55,721 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:42:55,920 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 69.71% of their original sizes. [2019-09-10 03:42:55,920 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:42:56,128 INFO L420 sIntCurrentIteration]: We unified 92 AI predicates to 92 [2019-09-10 03:42:56,129 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:42:56,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:42:56,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [3] total 23 [2019-09-10 03:42:56,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:56,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 03:42:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 03:42:56,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-09-10 03:42:56,134 INFO L87 Difference]: Start difference. First operand 586 states and 708 transitions. Second operand 22 states. [2019-09-10 03:42:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:58,646 INFO L93 Difference]: Finished difference Result 543 states and 637 transitions. [2019-09-10 03:42:58,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 03:42:58,646 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-09-10 03:42:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:58,651 INFO L225 Difference]: With dead ends: 543 [2019-09-10 03:42:58,651 INFO L226 Difference]: Without dead ends: 543 [2019-09-10 03:42:58,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:42:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-10 03:42:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 540. [2019-09-10 03:42:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-10 03:42:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 633 transitions. [2019-09-10 03:42:58,681 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 633 transitions. Word has length 93 [2019-09-10 03:42:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:58,681 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 633 transitions. [2019-09-10 03:42:58,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 03:42:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 633 transitions. [2019-09-10 03:42:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 03:42:58,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:58,687 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 03:42:58,687 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:58,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash 173750943, now seen corresponding path program 1 times [2019-09-10 03:42:58,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:58,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:58,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:42:58,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:42:58,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:42:58,766 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-09-10 03:42:58,767 INFO L207 CegarAbsIntRunner]: [4], [6], [9], [20], [22], [28], [29], [31], [36], [39], [44], [46], [47], [50], [59], [60], [61], [71], [73], [75], [76], [81], [87], [93], [95], [98], [104], [108], [109], [114], [161], [162], [163], [172], [175], [178], [184], [190], [193], [197], [200], [223], [228], [234], [240], [242], [243], [257], [259], [289], [299], [301], [303], [304], [327], [328], [331], [333], [334], [335], [336], [337], [338], [339], [343], [344], [347], [348], [351], [352], [353], [354], [355], [356], [357], [358], [359], [360], [361], [381], [382], [383] [2019-09-10 03:42:58,776 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:42:58,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:42:58,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:42:58,847 INFO L272 AbstractInterpreter]: Visited 82 different actions 103 times. Merged at 9 different actions 9 times. Never widened. Performed 279 root evaluator evaluations with a maximum evaluation depth of 4. Performed 279 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-09-10 03:42:58,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:58,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:42:58,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:42:58,849 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-09-10 03:42:58,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:58,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:42:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:58,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 03:42:58,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:42:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:42:59,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:42:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream Closed [2019-09-10 03:42:59,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:42:59,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-09-10 03:42:59,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:59,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:42:59,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:42:59,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:42:59,121 INFO L87 Difference]: Start difference. First operand 540 states and 633 transitions. Second operand 3 states. [2019-09-10 03:42:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:59,159 INFO L93 Difference]: Finished difference Result 847 states and 1011 transitions. [2019-09-10 03:42:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:42:59,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 03:42:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:59,165 INFO L225 Difference]: With dead ends: 847 [2019-09-10 03:42:59,166 INFO L226 Difference]: Without dead ends: 847 [2019-09-10 03:42:59,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 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-09-10 03:42:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-10 03:42:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 839. [2019-09-10 03:42:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-10 03:42:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1004 transitions. [2019-09-10 03:42:59,223 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1004 transitions. Word has length 94 [2019-09-10 03:42:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:59,225 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1004 transitions. [2019-09-10 03:42:59,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:42:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1004 transitions. [2019-09-10 03:42:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 03:42:59,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:59,228 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 03:42:59,229 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:59,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1397737794, now seen corresponding path program 1 times [2019-09-10 03:42:59,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:59,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:59,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:42:59,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:42:59,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:42:59,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:59,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:42:59,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:42:59,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:42:59,309 INFO L87 Difference]: Start difference. First operand 839 states and 1004 transitions. Second operand 3 states. [2019-09-10 03:42:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:59,389 INFO L93 Difference]: Finished difference Result 1265 states and 1522 transitions. [2019-09-10 03:42:59,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:42:59,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 03:42:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:59,403 INFO L225 Difference]: With dead ends: 1265 [2019-09-10 03:42:59,403 INFO L226 Difference]: Without dead ends: 1265 [2019-09-10 03:42:59,404 INFO L628 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-09-10 03:42:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-09-10 03:42:59,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2019-09-10 03:42:59,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-09-10 03:42:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1522 transitions. [2019-09-10 03:42:59,470 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1522 transitions. Word has length 95 [2019-09-10 03:42:59,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:59,471 INFO L475 AbstractCegarLoop]: Abstraction has 1265 states and 1522 transitions. [2019-09-10 03:42:59,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:42:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1522 transitions. [2019-09-10 03:42:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 03:42:59,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:59,477 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:42:59,477 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:59,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:59,477 INFO L82 PathProgramCache]: Analyzing trace with hash 473506967, now seen corresponding path program 1 times [2019-09-10 03:42:59,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:59,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:59,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:42:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:42:59,593 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 03:42:59,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:42:59 BoogieIcfgContainer [2019-09-10 03:42:59,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:42:59,736 INFO L168 Benchmark]: Toolchain (without parser) took 8686.27 ms. Allocated memory was 135.8 MB in the beginning and 322.4 MB in the end (delta: 186.6 MB). Free memory was 90.4 MB in the beginning and 257.8 MB in the end (delta: -167.4 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-09-10 03:42:59,740 INFO L168 Benchmark]: CDTParser took 1.15 ms. Allocated memory is still 135.8 MB. Free memory was 109.0 MB in the beginning and 108.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:42:59,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.23 ms. Allocated memory was 135.8 MB in the beginning and 202.4 MB in the end (delta: 66.6 MB). Free memory was 90.2 MB in the beginning and 177.9 MB in the end (delta: -87.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:42:59,743 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 ms. Allocated memory is still 202.4 MB. Free memory was 177.9 MB in the beginning and 176.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-10 03:42:59,748 INFO L168 Benchmark]: RCFGBuilder took 532.86 ms. Allocated memory is still 202.4 MB. Free memory was 176.2 MB in the beginning and 147.6 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:42:59,749 INFO L168 Benchmark]: TraceAbstraction took 7705.13 ms. Allocated memory was 202.4 MB in the beginning and 322.4 MB in the end (delta: 120.1 MB). Free memory was 147.1 MB in the beginning and 257.8 MB in the end (delta: -110.8 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-09-10 03:42:59,756 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.15 ms. Allocated memory is still 135.8 MB. Free memory was 109.0 MB in the beginning and 108.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 402.23 ms. Allocated memory was 135.8 MB in the beginning and 202.4 MB in the end (delta: 66.6 MB). Free memory was 90.2 MB in the beginning and 177.9 MB in the end (delta: -87.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.92 ms. Allocated memory is still 202.4 MB. Free memory was 177.9 MB in the beginning and 176.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 532.86 ms. Allocated memory is still 202.4 MB. Free memory was 176.2 MB in the beginning and 147.6 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7705.13 ms. Allocated memory was 202.4 MB in the beginning and 322.4 MB in the end (delta: 120.1 MB). Free memory was 147.1 MB in the beginning and 257.8 MB in the end (delta: -110.8 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [\old(E_1)=6, \old(M_E)=11, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=10, \old(t1_pc)=7, \old(t1_st)=4, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L443] CALL init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L354] m_i = 1 [L355] t1_i = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L443] RET init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L444] CALL start_simulation() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L387] FCALL update_channels() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] CALL init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] RET init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] RET fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L390] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L390] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] RET reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] kernel_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL eval() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L187] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L221] RET transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L191] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L207] CALL master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L46] CALL immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L312] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L102] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L312] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L46] RET immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 [L53] m_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L207] RET master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L91] CALL error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 139 locations, 1 error locations. UNSAFE Result, 7.6s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2107 SDtfs, 1880 SDslu, 3923 SDs, 0 SdLazy, 1270 SolverSat, 516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1265occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9812325197050594 AbsIntWeakeningRatio, 0.5108695652173914 AbsIntAvgWeakeningVarsNumRemoved, 10.58695652173913 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 116 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1111 ConstructedInterpolants, 0 QuantifiedInterpolants, 134625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 104/113 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...