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-fea9116 [2019-09-20 13:31:58,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:31:58,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:31:58,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:31:58,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:31:58,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:31:58,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:31:58,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:31:58,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:31:58,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:31:58,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:31:58,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:31:58,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:31:58,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:31:58,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:31:58,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:31:58,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:31:58,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:31:58,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:31:58,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:31:58,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:31:58,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:31:58,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:31:58,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:31:58,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:31:58,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:31:58,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:31:58,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:31:58,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:31:58,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:31:58,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:31:58,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:31:58,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:31:58,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:31:58,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:31:58,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:31:58,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:31:58,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:31:58,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:31:58,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:31:58,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:31:58,349 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-20 13:31:58,363 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:31:58,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:31:58,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:31:58,364 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:31:58,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:31:58,365 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:31:58,365 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:31:58,365 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:31:58,365 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:31:58,366 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:31:58,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:31:58,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:31:58,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:31:58,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:31:58,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:31:58,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:31:58,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:31:58,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:31:58,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:31:58,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:31:58,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:31:58,369 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:31:58,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:31:58,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:31:58,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:31:58,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:31:58,370 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:31:58,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:31:58,370 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:31:58,370 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:31:58,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:31:58,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:31:58,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:31:58,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:31:58,433 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:31:58,434 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-20 13:31:58,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a6ece82/156b2470a557414abb5e1c3e8249d12a/FLAG63fc03239 [2019-09-20 13:31:58,983 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:31:58,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2019-09-20 13:31:58,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a6ece82/156b2470a557414abb5e1c3e8249d12a/FLAG63fc03239 [2019-09-20 13:31:59,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a6ece82/156b2470a557414abb5e1c3e8249d12a [2019-09-20 13:31:59,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:31:59,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:31:59,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:31:59,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:31:59,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:31:59,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a23759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59, skipping insertion in model container [2019-09-20 13:31:59,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,394 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:31:59,431 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:31:59,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:31:59,682 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:31:59,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:31:59,840 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:31:59,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59 WrapperNode [2019-09-20 13:31:59,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:31:59,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:31:59,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:31:59,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:31:59,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:31:59,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:31:59,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:31:59,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:31:59,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59" (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-20 13:31:59,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:31:59,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:31:59,935 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-20 13:31:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-20 13:31:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-20 13:31:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-20 13:31:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-20 13:31:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-20 13:31:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-20 13:31:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-20 13:31:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-20 13:31:59,937 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-20 13:31:59,937 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-20 13:31:59,937 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-20 13:31:59,937 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-20 13:31:59,937 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-20 13:31:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-20 13:31:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-20 13:31:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-20 13:31:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-20 13:31:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:31:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:31:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:31:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-20 13:31:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-20 13:31:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-20 13:31:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-20 13:31:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-20 13:31:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-20 13:31:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-20 13:31:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-20 13:31:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-20 13:31:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-20 13:31:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-20 13:31:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-20 13:31:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-20 13:31:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-20 13:31:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-20 13:31:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-20 13:31:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-20 13:31:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-20 13:31:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:31:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:31:59,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:32:00,412 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:32:00,412 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-20 13:32:00,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:32:00 BoogieIcfgContainer [2019-09-20 13:32:00,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:32:00,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:32:00,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:32:00,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:32:00,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:31:59" (1/3) ... [2019-09-20 13:32:00,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b93757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:32:00, skipping insertion in model container [2019-09-20 13:32:00,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59" (2/3) ... [2019-09-20 13:32:00,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b93757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:32:00, skipping insertion in model container [2019-09-20 13:32:00,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:32:00" (3/3) ... [2019-09-20 13:32:00,427 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2019-09-20 13:32:00,438 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:32:00,449 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:32:00,467 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:32:00,494 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:32:00,494 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:32:00,494 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:32:00,494 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:32:00,495 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:32:00,495 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:32:00,495 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:32:00,495 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:32:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-09-20 13:32:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 13:32:00,529 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:00,530 INFO L407 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-20 13:32:00,532 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:00,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:00,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1024647557, now seen corresponding path program 1 times [2019-09-20 13:32:00,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:00,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:00,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:00,876 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-20 13:32:00,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:00,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:00,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:00,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:00,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:00,904 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 5 states. [2019-09-20 13:32:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:01,476 INFO L93 Difference]: Finished difference Result 166 states and 218 transitions. [2019-09-20 13:32:01,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:01,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-20 13:32:01,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:01,492 INFO L225 Difference]: With dead ends: 166 [2019-09-20 13:32:01,493 INFO L226 Difference]: Without dead ends: 154 [2019-09-20 13:32:01,495 INFO L636 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-20 13:32:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-20 13:32:01,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2019-09-20 13:32:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-20 13:32:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2019-09-20 13:32:01,551 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 75 [2019-09-20 13:32:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:01,552 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2019-09-20 13:32:01,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2019-09-20 13:32:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 13:32:01,556 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:01,556 INFO L407 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-20 13:32:01,556 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:01,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:01,557 INFO L82 PathProgramCache]: Analyzing trace with hash -148628551, now seen corresponding path program 1 times [2019-09-20 13:32:01,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:01,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:01,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:01,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:01,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:01,668 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-20 13:32:01,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:01,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:01,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:01,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:01,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:01,672 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand 5 states. [2019-09-20 13:32:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:02,104 INFO L93 Difference]: Finished difference Result 154 states and 205 transitions. [2019-09-20 13:32:02,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:02,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-20 13:32:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:02,108 INFO L225 Difference]: With dead ends: 154 [2019-09-20 13:32:02,112 INFO L226 Difference]: Without dead ends: 154 [2019-09-20 13:32:02,113 INFO L636 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-20 13:32:02,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-20 13:32:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2019-09-20 13:32:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-20 13:32:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2019-09-20 13:32:02,144 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 75 [2019-09-20 13:32:02,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:02,144 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2019-09-20 13:32:02,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2019-09-20 13:32:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 13:32:02,150 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:02,152 INFO L407 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-20 13:32:02,152 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:02,153 INFO L82 PathProgramCache]: Analyzing trace with hash 295272123, now seen corresponding path program 1 times [2019-09-20 13:32:02,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:02,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:02,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:02,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:02,310 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-20 13:32:02,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:02,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:02,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:02,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:02,315 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand 4 states. [2019-09-20 13:32:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:02,526 INFO L93 Difference]: Finished difference Result 229 states and 288 transitions. [2019-09-20 13:32:02,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:02,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-20 13:32:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:02,530 INFO L225 Difference]: With dead ends: 229 [2019-09-20 13:32:02,530 INFO L226 Difference]: Without dead ends: 229 [2019-09-20 13:32:02,531 INFO L636 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-20 13:32:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-20 13:32:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 224. [2019-09-20 13:32:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-20 13:32:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 284 transitions. [2019-09-20 13:32:02,562 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 284 transitions. Word has length 75 [2019-09-20 13:32:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:02,563 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 284 transitions. [2019-09-20 13:32:02,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 284 transitions. [2019-09-20 13:32:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 13:32:02,568 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:02,569 INFO L407 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-20 13:32:02,569 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:02,572 INFO L82 PathProgramCache]: Analyzing trace with hash -578205572, now seen corresponding path program 1 times [2019-09-20 13:32:02,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:02,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:02,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:02,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:02,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:02,682 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-20 13:32:02,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:02,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:02,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:02,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:02,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:02,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:02,685 INFO L87 Difference]: Start difference. First operand 224 states and 284 transitions. Second operand 6 states. [2019-09-20 13:32:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:02,744 INFO L93 Difference]: Finished difference Result 234 states and 296 transitions. [2019-09-20 13:32:02,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:02,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-09-20 13:32:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:02,747 INFO L225 Difference]: With dead ends: 234 [2019-09-20 13:32:02,747 INFO L226 Difference]: Without dead ends: 234 [2019-09-20 13:32:02,748 INFO L636 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-20 13:32:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-20 13:32:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2019-09-20 13:32:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-20 13:32:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 288 transitions. [2019-09-20 13:32:02,771 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 288 transitions. Word has length 75 [2019-09-20 13:32:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:02,772 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 288 transitions. [2019-09-20 13:32:02,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 288 transitions. [2019-09-20 13:32:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 13:32:02,774 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:02,774 INFO L407 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-20 13:32:02,774 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:02,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1871394558, now seen corresponding path program 1 times [2019-09-20 13:32:02,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:02,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:02,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:02,837 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-20 13:32:02,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:02,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:02,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:02,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:02,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:02,839 INFO L87 Difference]: Start difference. First operand 229 states and 288 transitions. Second operand 4 states. [2019-09-20 13:32:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:03,014 INFO L93 Difference]: Finished difference Result 424 states and 528 transitions. [2019-09-20 13:32:03,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:03,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-20 13:32:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:03,018 INFO L225 Difference]: With dead ends: 424 [2019-09-20 13:32:03,019 INFO L226 Difference]: Without dead ends: 424 [2019-09-20 13:32:03,019 INFO L636 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-20 13:32:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-20 13:32:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-09-20 13:32:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:32:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 525 transitions. [2019-09-20 13:32:03,041 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 525 transitions. Word has length 75 [2019-09-20 13:32:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:03,042 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 525 transitions. [2019-09-20 13:32:03,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 525 transitions. [2019-09-20 13:32:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:32:03,044 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:03,044 INFO L407 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-20 13:32:03,044 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash 893913146, now seen corresponding path program 1 times [2019-09-20 13:32:03,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:03,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:03,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:03,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:03,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:03,116 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-20 13:32:03,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:03,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:03,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:03,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:03,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:03,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:03,119 INFO L87 Difference]: Start difference. First operand 421 states and 525 transitions. Second operand 6 states. [2019-09-20 13:32:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:03,154 INFO L93 Difference]: Finished difference Result 435 states and 540 transitions. [2019-09-20 13:32:03,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:03,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-20 13:32:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:03,157 INFO L225 Difference]: With dead ends: 435 [2019-09-20 13:32:03,158 INFO L226 Difference]: Without dead ends: 435 [2019-09-20 13:32:03,158 INFO L636 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-20 13:32:03,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-20 13:32:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-09-20 13:32:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-20 13:32:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 533 transitions. [2019-09-20 13:32:03,178 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 533 transitions. Word has length 93 [2019-09-20 13:32:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:03,179 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 533 transitions. [2019-09-20 13:32:03,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 533 transitions. [2019-09-20 13:32:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:32:03,181 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:03,181 INFO L407 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-20 13:32:03,182 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1461892104, now seen corresponding path program 1 times [2019-09-20 13:32:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:03,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:03,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:03,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:03,252 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-20 13:32:03,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:03,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:03,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:03,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:03,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:03,254 INFO L87 Difference]: Start difference. First operand 431 states and 533 transitions. Second operand 5 states. [2019-09-20 13:32:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:03,541 INFO L93 Difference]: Finished difference Result 431 states and 525 transitions. [2019-09-20 13:32:03,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:03,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-20 13:32:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:03,545 INFO L225 Difference]: With dead ends: 431 [2019-09-20 13:32:03,546 INFO L226 Difference]: Without dead ends: 431 [2019-09-20 13:32:03,546 INFO L636 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-20 13:32:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-09-20 13:32:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2019-09-20 13:32:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-20 13:32:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 525 transitions. [2019-09-20 13:32:03,563 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 525 transitions. Word has length 93 [2019-09-20 13:32:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:03,563 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 525 transitions. [2019-09-20 13:32:03,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:03,564 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 525 transitions. [2019-09-20 13:32:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:32:03,565 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:03,565 INFO L407 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-20 13:32:03,565 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:03,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:03,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1935681914, now seen corresponding path program 1 times [2019-09-20 13:32:03,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:03,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:03,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:03,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:03,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:03,625 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-20 13:32:03,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:03,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:03,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:03,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:03,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:03,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:03,627 INFO L87 Difference]: Start difference. First operand 431 states and 525 transitions. Second operand 5 states. [2019-09-20 13:32:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:03,998 INFO L93 Difference]: Finished difference Result 626 states and 776 transitions. [2019-09-20 13:32:03,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:32:03,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-20 13:32:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:04,003 INFO L225 Difference]: With dead ends: 626 [2019-09-20 13:32:04,003 INFO L226 Difference]: Without dead ends: 626 [2019-09-20 13:32:04,004 INFO L636 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-20 13:32:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-20 13:32:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 586. [2019-09-20 13:32:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-20 13:32:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 708 transitions. [2019-09-20 13:32:04,036 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 708 transitions. Word has length 93 [2019-09-20 13:32:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:04,036 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 708 transitions. [2019-09-20 13:32:04,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 708 transitions. [2019-09-20 13:32:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:32:04,039 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:04,039 INFO L407 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-20 13:32:04,039 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2111138888, now seen corresponding path program 1 times [2019-09-20 13:32:04,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:04,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:04,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:04,081 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-20 13:32:04,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:04,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:04,083 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2019-09-20 13:32:04,085 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-20 13:32:04,134 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:04,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:04,267 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:32:04,269 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-20 13:32:04,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:04,274 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:32:04,467 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 69.71% of their original sizes. [2019-09-20 13:32:04,467 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:32:04,700 INFO L420 sIntCurrentIteration]: We unified 92 AI predicates to 92 [2019-09-20 13:32:04,700 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:32:04,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:32:04,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [3] total 23 [2019-09-20 13:32:04,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:04,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-20 13:32:04,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-20 13:32:04,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:32:04,704 INFO L87 Difference]: Start difference. First operand 586 states and 708 transitions. Second operand 22 states. [2019-09-20 13:32:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:07,511 INFO L93 Difference]: Finished difference Result 543 states and 637 transitions. [2019-09-20 13:32:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:32:07,512 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-09-20 13:32:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:07,516 INFO L225 Difference]: With dead ends: 543 [2019-09-20 13:32:07,517 INFO L226 Difference]: Without dead ends: 543 [2019-09-20 13:32:07,518 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2019-09-20 13:32:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-20 13:32:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 540. [2019-09-20 13:32:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-20 13:32:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 633 transitions. [2019-09-20 13:32:07,544 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 633 transitions. Word has length 93 [2019-09-20 13:32:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:07,544 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 633 transitions. [2019-09-20 13:32:07,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-20 13:32:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 633 transitions. [2019-09-20 13:32:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:32:07,548 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:07,548 INFO L407 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-20 13:32:07,549 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:07,549 INFO L82 PathProgramCache]: Analyzing trace with hash 173750943, now seen corresponding path program 1 times [2019-09-20 13:32:07,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:07,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:07,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:07,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:07,620 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-20 13:32:07,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:07,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:07,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-09-20 13:32:07,622 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-20 13:32:07,631 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:07,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:07,722 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:32:07,724 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-20 13:32:07,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:07,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:32:07,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:07,727 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-20 13:32:07,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:07,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:32:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:07,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:32:07,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:32:07,908 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-20 13:32:07,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:32:07,994 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-20 13:32:08,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:32:08,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-09-20 13:32:08,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:08,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:08,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:08,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:08,003 INFO L87 Difference]: Start difference. First operand 540 states and 633 transitions. Second operand 3 states. [2019-09-20 13:32:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:08,030 INFO L93 Difference]: Finished difference Result 847 states and 1011 transitions. [2019-09-20 13:32:08,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:08,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-20 13:32:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:08,035 INFO L225 Difference]: With dead ends: 847 [2019-09-20 13:32:08,035 INFO L226 Difference]: Without dead ends: 847 [2019-09-20 13:32:08,036 INFO L636 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-20 13:32:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-20 13:32:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 839. [2019-09-20 13:32:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-20 13:32:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1004 transitions. [2019-09-20 13:32:08,079 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1004 transitions. Word has length 94 [2019-09-20 13:32:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:08,081 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1004 transitions. [2019-09-20 13:32:08,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1004 transitions. [2019-09-20 13:32:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-20 13:32:08,082 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:08,082 INFO L407 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-20 13:32:08,083 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:08,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:08,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1397737794, now seen corresponding path program 1 times [2019-09-20 13:32:08,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:08,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:08,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:08,135 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-20 13:32:08,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:08,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:08,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:08,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:08,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:08,137 INFO L87 Difference]: Start difference. First operand 839 states and 1004 transitions. Second operand 3 states. [2019-09-20 13:32:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:08,162 INFO L93 Difference]: Finished difference Result 1265 states and 1522 transitions. [2019-09-20 13:32:08,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:08,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-20 13:32:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:08,171 INFO L225 Difference]: With dead ends: 1265 [2019-09-20 13:32:08,172 INFO L226 Difference]: Without dead ends: 1265 [2019-09-20 13:32:08,172 INFO L636 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-20 13:32:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-09-20 13:32:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2019-09-20 13:32:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-09-20 13:32:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1522 transitions. [2019-09-20 13:32:08,217 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1522 transitions. Word has length 95 [2019-09-20 13:32:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:08,218 INFO L475 AbstractCegarLoop]: Abstraction has 1265 states and 1522 transitions. [2019-09-20 13:32:08,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1522 transitions. [2019-09-20 13:32:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:32:08,221 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:08,221 INFO L407 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-20 13:32:08,221 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:08,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:08,222 INFO L82 PathProgramCache]: Analyzing trace with hash 473506967, now seen corresponding path program 1 times [2019-09-20 13:32:08,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:08,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:08,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:08,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:08,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:32:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:32:08,321 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-20 13:32:08,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:32:08 BoogieIcfgContainer [2019-09-20 13:32:08,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:32:08,468 INFO L168 Benchmark]: Toolchain (without parser) took 9089.33 ms. Allocated memory was 133.7 MB in the beginning and 353.9 MB in the end (delta: 220.2 MB). Free memory was 89.6 MB in the beginning and 150.6 MB in the end (delta: -61.0 MB). Peak memory consumption was 159.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:08,469 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:32:08,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.06 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 89.4 MB in the beginning and 174.4 MB in the end (delta: -85.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:08,471 INFO L168 Benchmark]: Boogie Preprocessor took 38.47 ms. Allocated memory is still 199.8 MB. Free memory was 174.4 MB in the beginning and 172.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:08,472 INFO L168 Benchmark]: RCFGBuilder took 534.16 ms. Allocated memory is still 199.8 MB. Free memory was 172.6 MB in the beginning and 143.2 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:08,473 INFO L168 Benchmark]: TraceAbstraction took 8050.20 ms. Allocated memory was 199.8 MB in the beginning and 353.9 MB in the end (delta: 154.1 MB). Free memory was 142.6 MB in the beginning and 150.6 MB in the end (delta: -8.0 MB). Peak memory consumption was 146.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:08,477 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 462.06 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 89.4 MB in the beginning and 174.4 MB in the end (delta: -85.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.47 ms. Allocated memory is still 199.8 MB. Free memory was 174.4 MB in the beginning and 172.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 534.16 ms. Allocated memory is still 199.8 MB. Free memory was 172.6 MB in the beginning and 143.2 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8050.20 ms. Allocated memory was 199.8 MB in the beginning and 353.9 MB in the end (delta: 154.1 MB). Free memory was 142.6 MB in the beginning and 150.6 MB in the end (delta: -8.0 MB). Peak memory consumption was 146.1 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.9s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2107 SDtfs, 1880 SDslu, 3927 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.6s 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...