/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:05,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:05,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:05,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:05,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:05,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:05,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:05,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:05,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:05,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:05,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:05,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:05,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:05,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:05,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:05,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:05,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:05,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:05,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:05,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:05,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:05,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:05,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:05,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:05,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:05,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:05,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:05,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:05,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:05,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:05,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:05,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:05,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:05,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:05,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:05,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:05,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:05,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:05,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:05,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:05,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:05,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:30:05,960 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:05,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:05,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:05,962 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:05,962 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:05,962 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:05,962 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:05,962 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:05,963 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:05,963 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:05,963 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:05,963 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:05,963 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:05,964 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:05,964 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:05,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:05,965 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:05,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:05,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:05,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:05,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:05,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:05,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:05,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:05,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:05,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:05,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:05,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:05,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:05,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:05,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:05,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:05,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:05,968 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:05,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:05,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:05,969 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:05,969 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:06,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:06,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:06,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:06,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:06,265 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:06,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11.c [2019-11-23 23:30:06,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a373fd84/753f970bd8b94defb13f256508a25b0b/FLAGff366ac0a [2019-11-23 23:30:06,889 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:06,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11.c [2019-11-23 23:30:06,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a373fd84/753f970bd8b94defb13f256508a25b0b/FLAGff366ac0a [2019-11-23 23:30:07,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a373fd84/753f970bd8b94defb13f256508a25b0b [2019-11-23 23:30:07,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:07,143 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:07,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:07,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:07,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:07,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:07,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb6ee21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07, skipping insertion in model container [2019-11-23 23:30:07,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:07,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:07,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:07,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:07,783 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:07,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:07,900 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:07,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07 WrapperNode [2019-11-23 23:30:07,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:07,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:07,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:07,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:07,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:07,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:07,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:07,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:07,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:07,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:07,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:07,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:08,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:08,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:08,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:08,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:08,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (1/1) ... [2019-11-23 23:30:08,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:08,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:08,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:08,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:08,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:09,980 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:09,980 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:09,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:09 BoogieIcfgContainer [2019-11-23 23:30:09,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:09,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:09,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:09,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:09,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:07" (1/3) ... [2019-11-23 23:30:09,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c782443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:09, skipping insertion in model container [2019-11-23 23:30:09,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:07" (2/3) ... [2019-11-23 23:30:09,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c782443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:09, skipping insertion in model container [2019-11-23 23:30:09,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:09" (3/3) ... [2019-11-23 23:30:09,990 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label11.c [2019-11-23 23:30:09,999 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:10,007 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:10,018 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:10,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:10,044 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:10,044 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:10,044 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:10,044 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:10,045 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:10,045 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:10,045 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:10,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:10,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:10,078 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1323234457, now seen corresponding path program 1 times [2019-11-23 23:30:10,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:10,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458790928] [2019-11-23 23:30:10,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:10,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458790928] [2019-11-23 23:30:10,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:10,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:10,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810716099] [2019-11-23 23:30:10,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:10,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:10,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:10,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:10,488 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:11,376 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:11,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:11,392 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:11,393 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:11,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-23 23:30:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:30:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:30:11,448 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:30:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:11,449 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:30:11,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:30:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 23:30:11,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:11,453 INFO L410 BasicCegarLoop]: trace histogram [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-11-23 23:30:11,454 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:11,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:11,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1048387078, now seen corresponding path program 1 times [2019-11-23 23:30:11,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:11,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949418575] [2019-11-23 23:30:11,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:11,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949418575] [2019-11-23 23:30:11,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:11,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:11,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762591062] [2019-11-23 23:30:11,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:11,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:11,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:11,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:11,541 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:30:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:12,219 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-23 23:30:12,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:12,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-23 23:30:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:12,224 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:30:12,224 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:12,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:30:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-11-23 23:30:12,273 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 77 [2019-11-23 23:30:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:12,273 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-11-23 23:30:12,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-11-23 23:30:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:30:12,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:12,284 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:12,284 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:12,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2123291750, now seen corresponding path program 1 times [2019-11-23 23:30:12,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:12,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387827931] [2019-11-23 23:30:12,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:12,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387827931] [2019-11-23 23:30:12,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:12,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:12,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880365076] [2019-11-23 23:30:12,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:12,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:12,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:12,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:12,385 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 4 states. [2019-11-23 23:30:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:12,970 INFO L93 Difference]: Finished difference Result 1425 states and 2329 transitions. [2019-11-23 23:30:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:12,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-23 23:30:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:12,980 INFO L225 Difference]: With dead ends: 1425 [2019-11-23 23:30:12,980 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:30:12,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:30:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 642. [2019-11-23 23:30:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:30:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 954 transitions. [2019-11-23 23:30:13,030 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 954 transitions. Word has length 78 [2019-11-23 23:30:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:13,030 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 954 transitions. [2019-11-23 23:30:13,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 954 transitions. [2019-11-23 23:30:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-23 23:30:13,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:13,038 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:13,038 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:13,039 INFO L82 PathProgramCache]: Analyzing trace with hash -888988622, now seen corresponding path program 1 times [2019-11-23 23:30:13,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:13,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304542303] [2019-11-23 23:30:13,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:13,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304542303] [2019-11-23 23:30:13,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:13,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:13,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260602798] [2019-11-23 23:30:13,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:13,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:13,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:13,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:13,215 INFO L87 Difference]: Start difference. First operand 642 states and 954 transitions. Second operand 3 states. [2019-11-23 23:30:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:13,581 INFO L93 Difference]: Finished difference Result 1354 states and 2002 transitions. [2019-11-23 23:30:13,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:13,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-23 23:30:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:13,586 INFO L225 Difference]: With dead ends: 1354 [2019-11-23 23:30:13,586 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:30:13,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 23:30:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:30:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 500. [2019-11-23 23:30:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 23:30:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 698 transitions. [2019-11-23 23:30:13,604 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 698 transitions. Word has length 119 [2019-11-23 23:30:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:13,605 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 698 transitions. [2019-11-23 23:30:13,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 698 transitions. [2019-11-23 23:30:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 23:30:13,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:13,607 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:13,607 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1267308565, now seen corresponding path program 1 times [2019-11-23 23:30:13,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:13,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330227448] [2019-11-23 23:30:13,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-23 23:30:13,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330227448] [2019-11-23 23:30:13,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:13,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:13,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413358446] [2019-11-23 23:30:13,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:13,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:13,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:13,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:13,727 INFO L87 Difference]: Start difference. First operand 500 states and 698 transitions. Second operand 3 states. [2019-11-23 23:30:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:14,143 INFO L93 Difference]: Finished difference Result 1283 states and 1799 transitions. [2019-11-23 23:30:14,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:14,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 23:30:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:14,147 INFO L225 Difference]: With dead ends: 1283 [2019-11-23 23:30:14,148 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:30:14,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-23 23:30:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:30:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-23 23:30:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:30:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 798 transitions. [2019-11-23 23:30:14,206 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 798 transitions. Word has length 155 [2019-11-23 23:30:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:14,207 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 798 transitions. [2019-11-23 23:30:14,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 798 transitions. [2019-11-23 23:30:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 23:30:14,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:14,210 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:14,211 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1180344489, now seen corresponding path program 1 times [2019-11-23 23:30:14,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:14,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934900265] [2019-11-23 23:30:14,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:30:14,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934900265] [2019-11-23 23:30:14,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:14,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:14,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137062742] [2019-11-23 23:30:14,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:14,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:14,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:14,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:14,342 INFO L87 Difference]: Start difference. First operand 642 states and 798 transitions. Second operand 4 states. [2019-11-23 23:30:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:14,730 INFO L93 Difference]: Finished difference Result 1371 states and 1694 transitions. [2019-11-23 23:30:14,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:14,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-23 23:30:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:14,735 INFO L225 Difference]: With dead ends: 1371 [2019-11-23 23:30:14,736 INFO L226 Difference]: Without dead ends: 730 [2019-11-23 23:30:14,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-11-23 23:30:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 713. [2019-11-23 23:30:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 872 transitions. [2019-11-23 23:30:14,756 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 872 transitions. Word has length 163 [2019-11-23 23:30:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:14,756 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 872 transitions. [2019-11-23 23:30:14,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 872 transitions. [2019-11-23 23:30:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 23:30:14,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:14,761 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:14,762 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:14,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash 905274081, now seen corresponding path program 1 times [2019-11-23 23:30:14,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:14,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299336937] [2019-11-23 23:30:14,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-23 23:30:14,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299336937] [2019-11-23 23:30:14,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:14,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:14,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298978660] [2019-11-23 23:30:14,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:14,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:14,858 INFO L87 Difference]: Start difference. First operand 713 states and 872 transitions. Second operand 4 states. [2019-11-23 23:30:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:15,286 INFO L93 Difference]: Finished difference Result 1709 states and 2109 transitions. [2019-11-23 23:30:15,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:15,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-11-23 23:30:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:15,293 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:30:15,293 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:30:15,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:30:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 855. [2019-11-23 23:30:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1024 transitions. [2019-11-23 23:30:15,314 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1024 transitions. Word has length 167 [2019-11-23 23:30:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:15,314 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1024 transitions. [2019-11-23 23:30:15,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1024 transitions. [2019-11-23 23:30:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 23:30:15,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:15,318 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-23 23:30:15,318 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash 681487844, now seen corresponding path program 1 times [2019-11-23 23:30:15,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:15,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173801569] [2019-11-23 23:30:15,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 23:30:15,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173801569] [2019-11-23 23:30:15,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:15,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:30:15,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673465709] [2019-11-23 23:30:15,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:30:15,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:15,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:30:15,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:15,496 INFO L87 Difference]: Start difference. First operand 855 states and 1024 transitions. Second operand 8 states. [2019-11-23 23:30:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:16,198 INFO L93 Difference]: Finished difference Result 1890 states and 2264 transitions. [2019-11-23 23:30:16,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:30:16,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-11-23 23:30:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:16,213 INFO L225 Difference]: With dead ends: 1890 [2019-11-23 23:30:16,213 INFO L226 Difference]: Without dead ends: 1107 [2019-11-23 23:30:16,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-11-23 23:30:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 926. [2019-11-23 23:30:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1096 transitions. [2019-11-23 23:30:16,243 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1096 transitions. Word has length 181 [2019-11-23 23:30:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:16,244 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1096 transitions. [2019-11-23 23:30:16,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:30:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1096 transitions. [2019-11-23 23:30:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-23 23:30:16,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:16,248 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:30:16,248 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1192338388, now seen corresponding path program 1 times [2019-11-23 23:30:16,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:16,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348396636] [2019-11-23 23:30:16,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 233 proven. 27 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-23 23:30:16,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348396636] [2019-11-23 23:30:16,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40046671] [2019-11-23 23:30:16,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:30:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:16,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:30:16,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:30:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-23 23:30:16,668 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:30:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-23 23:30:16,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:30:16,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:30:16,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805115877] [2019-11-23 23:30:16,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:16,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:16,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:16,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:30:16,754 INFO L87 Difference]: Start difference. First operand 926 states and 1096 transitions. Second operand 3 states. [2019-11-23 23:30:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:17,118 INFO L93 Difference]: Finished difference Result 1849 states and 2208 transitions. [2019-11-23 23:30:17,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:17,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-11-23 23:30:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:17,120 INFO L225 Difference]: With dead ends: 1849 [2019-11-23 23:30:17,124 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:17,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 426 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:30:17,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:17,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2019-11-23 23:30:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:17,129 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:17,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:17,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:17,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:30:17,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:17,462 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 73 [2019-11-23 23:30:17,771 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2019-11-23 23:30:17,985 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2019-11-23 23:30:17,989 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:17,990 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:17,990 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:17,990 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:17,990 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:17,990 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:17,990 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:17,990 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:17,991 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:17,991 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:17,991 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 23:30:17,991 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:17,991 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:17,991 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:17,991 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:17,991 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:17,992 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:17,992 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:17,992 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:17,992 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:17,992 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (not (= ~a16~0 6))) (.cse3 (not (= 1 ~a7~0))) (.cse4 (not (= 14 ~a8~0))) (.cse2 (<= ~a20~0 0)) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (or (= 13 ~a8~0) (and .cse0 .cse1 .cse2) (and (or (and .cse0 .cse3) (and .cse0 .cse4)) .cse1 .cse5) (and .cse3 .cse5 .cse4 .cse1) (and .cse3 .cse4 .cse1 .cse2) (and .cse1 .cse5 (= ~a16~0 5)))) [2019-11-23 23:30:17,993 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:17,993 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:17,993 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:17,993 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:17,993 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:17,993 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:17,993 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:17,993 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:17,994 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:17,994 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:17,994 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:17,994 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:17,994 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:17,994 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:17,994 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:17,994 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:17,995 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:17,995 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:17,995 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:17,995 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:17,995 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:17,995 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:17,995 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:17,996 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~a16~0 6))) (.cse3 (not (= 1 ~a7~0))) (.cse4 (not (= 14 ~a8~0))) (.cse2 (<= ~a20~0 0)) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (or (= 13 ~a8~0) (and .cse0 .cse1 .cse2) (and (or (and .cse0 .cse3) (and .cse0 .cse4)) .cse1 .cse5) (and .cse3 .cse5 .cse4 .cse1) (and .cse3 .cse4 .cse1 .cse2) (and .cse1 .cse5 (= ~a16~0 5)))) [2019-11-23 23:30:17,996 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:17,996 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:17,996 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:17,996 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:17,996 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:17,996 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:17,997 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:17,997 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:17,997 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:17,997 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:17,997 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:17,997 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:17,997 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:17,997 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:17,997 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:17,998 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:17,998 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:17,998 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:17,998 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:17,998 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:17,998 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:17,998 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:17,998 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:17,999 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2019-11-23 23:30:17,999 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:17,999 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:17,999 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:17,999 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:17,999 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:17,999 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:17,999 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:18,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:18 BoogieIcfgContainer [2019-11-23 23:30:18,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:18,021 INFO L168 Benchmark]: Toolchain (without parser) took 10877.66 ms. Allocated memory was 146.8 MB in the beginning and 372.8 MB in the end (delta: 226.0 MB). Free memory was 102.7 MB in the beginning and 127.2 MB in the end (delta: -24.5 MB). Peak memory consumption was 201.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:18,022 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 23:30:18,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.63 ms. Allocated memory was 146.8 MB in the beginning and 207.6 MB in the end (delta: 60.8 MB). Free memory was 102.3 MB in the beginning and 173.3 MB in the end (delta: -71.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:18,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.64 ms. Allocated memory is still 207.6 MB. Free memory was 173.3 MB in the beginning and 167.4 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:18,024 INFO L168 Benchmark]: Boogie Preprocessor took 86.24 ms. Allocated memory is still 207.6 MB. Free memory was 167.4 MB in the beginning and 161.4 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:18,025 INFO L168 Benchmark]: RCFGBuilder took 1909.44 ms. Allocated memory was 207.6 MB in the beginning and 248.5 MB in the end (delta: 40.9 MB). Free memory was 161.4 MB in the beginning and 197.6 MB in the end (delta: -36.1 MB). Peak memory consumption was 108.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:18,026 INFO L168 Benchmark]: TraceAbstraction took 8036.11 ms. Allocated memory was 248.5 MB in the beginning and 372.8 MB in the end (delta: 124.3 MB). Free memory was 197.6 MB in the beginning and 127.2 MB in the end (delta: 70.4 MB). Peak memory consumption was 194.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:18,030 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.20 ms. Allocated memory is still 146.8 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.63 ms. Allocated memory was 146.8 MB in the beginning and 207.6 MB in the end (delta: 60.8 MB). Free memory was 102.3 MB in the beginning and 173.3 MB in the end (delta: -71.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.64 ms. Allocated memory is still 207.6 MB. Free memory was 173.3 MB in the beginning and 167.4 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.24 ms. Allocated memory is still 207.6 MB. Free memory was 167.4 MB in the beginning and 161.4 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1909.44 ms. Allocated memory was 207.6 MB in the beginning and 248.5 MB in the end (delta: 40.9 MB). Free memory was 161.4 MB in the beginning and 197.6 MB in the end (delta: -36.1 MB). Peak memory consumption was 108.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8036.11 ms. Allocated memory was 248.5 MB in the beginning and 372.8 MB in the end (delta: 124.3 MB). Free memory was 197.6 MB in the beginning and 127.2 MB in the end (delta: 70.4 MB). Peak memory consumption was 194.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((13 == a8 || ((!(a16 == 6) && a21 == 1) && a20 <= 0)) || ((((!(a16 == 6) && !(1 == a7)) || (!(a16 == 6) && !(14 == a8))) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a20 == 1) && !(14 == a8)) && a21 == 1)) || (((!(1 == a7) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((a21 == 1 && a20 == 1) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((13 == a8 || ((!(a16 == 6) && a21 == 1) && a20 <= 0)) || ((((!(a16 == 6) && !(1 == a7)) || (!(a16 == 6) && !(14 == a8))) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a20 == 1) && !(14 == a8)) && a21 == 1)) || (((!(1 == a7) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((a21 == 1 && a20 == 1) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.9s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 334 SDtfs, 1165 SDslu, 76 SDs, 0 SdLazy, 2902 SolverSat, 685 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 435 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=926occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1050 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 38 NumberOfFragments, 163 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7157 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1028 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1439 NumberOfCodeBlocks, 1439 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1642 ConstructedInterpolants, 0 QuantifiedInterpolants, 576538 SizeOfPredicates, 1 NumberOfNonLiveVariables, 457 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1845/1872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...