/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_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:29:51,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:29:51,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:29:51,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:29:51,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:29:51,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:29:51,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:29:51,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:29:51,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:29:51,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:29:51,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:29:51,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:29:51,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:29:51,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:29:51,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:29:51,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:29:51,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:29:51,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:29:51,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:29:51,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:29:51,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:29:51,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:29:51,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:29:51,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:29:51,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:29:51,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:29:51,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:29:51,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:29:51,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:29:51,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:29:51,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:29:51,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:29:51,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:29:51,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:29:51,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:29:51,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:29:51,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:29:51,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:29:51,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:29:51,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:29:51,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:29:51,544 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:29:51,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:29:51,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:29:51,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:29:51,568 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:29:51,568 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:29:51,568 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:29:51,568 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:29:51,568 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:29:51,569 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:29:51,569 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:29:51,570 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:29:51,570 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:29:51,570 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:29:51,571 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:29:51,571 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:29:51,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:29:51,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:29:51,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:29:51,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:29:51,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:29:51,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:29:51,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:29:51,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:29:51,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:29:51,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:29:51,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:29:51,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:29:51,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:29:51,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:29:51,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:51,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:29:51,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:29:51,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:29:51,577 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:29:51,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:29:51,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:29:51,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:29:51,578 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:29:51,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:29:51,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:29:51,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:29:51,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:29:51,877 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:29:51,878 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label08.c [2019-11-23 23:29:51,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0405bb7/270fd42d8dfc4ca38328d579da6fbd73/FLAGe880209cb [2019-11-23 23:29:52,499 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:29:52,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label08.c [2019-11-23 23:29:52,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0405bb7/270fd42d8dfc4ca38328d579da6fbd73/FLAGe880209cb [2019-11-23 23:29:52,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0405bb7/270fd42d8dfc4ca38328d579da6fbd73 [2019-11-23 23:29:52,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:29:52,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:29:52,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:52,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:29:52,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:29:52,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:52" (1/1) ... [2019-11-23 23:29:52,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ff21a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:52, skipping insertion in model container [2019-11-23 23:29:52,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:52" (1/1) ... [2019-11-23 23:29:52,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:29:52,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:29:53,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:53,357 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:29:53,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:53,507 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:29:53,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53 WrapperNode [2019-11-23 23:29:53,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:53,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:53,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:29:53,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:29:53,517 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:29:53" (1/1) ... [2019-11-23 23:29:53,534 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:29:53" (1/1) ... [2019-11-23 23:29:53,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:53,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:29:53,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:29:53,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:29:53,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:29:53,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:29:53,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:29:53,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:29:53,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (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:29:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:29:53,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:29:55,762 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:29:55,762 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:29:55,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:55 BoogieIcfgContainer [2019-11-23 23:29:55,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:29:55,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:29:55,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:29:55,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:29:55,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:52" (1/3) ... [2019-11-23 23:29:55,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45269260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:55, skipping insertion in model container [2019-11-23 23:29:55,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (2/3) ... [2019-11-23 23:29:55,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45269260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:55, skipping insertion in model container [2019-11-23 23:29:55,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:55" (3/3) ... [2019-11-23 23:29:55,773 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label08.c [2019-11-23 23:29:55,782 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:29:55,790 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:29:55,801 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:29:55,835 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:29:55,835 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:29:55,836 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:29:55,836 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:29:55,836 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:29:55,836 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:29:55,837 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:29:55,837 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:29:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:29:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:29:55,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:55,875 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:29:55,875 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:55,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:55,882 INFO L82 PathProgramCache]: Analyzing trace with hash -839558106, now seen corresponding path program 1 times [2019-11-23 23:29:55,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:55,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929265683] [2019-11-23 23:29:55,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:56,254 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:29:56,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929265683] [2019-11-23 23:29:56,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:56,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:56,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169751528] [2019-11-23 23:29:56,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:56,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:56,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:56,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:56,280 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-23 23:29:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:56,771 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-23 23:29:56,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:56,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 23:29:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:56,796 INFO L225 Difference]: With dead ends: 224 [2019-11-23 23:29:56,796 INFO L226 Difference]: Without dead ends: 145 [2019-11-23 23:29:56,802 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:29:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-23 23:29:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-23 23:29:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:29:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 253 transitions. [2019-11-23 23:29:56,884 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 253 transitions. Word has length 71 [2019-11-23 23:29:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:56,885 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 253 transitions. [2019-11-23 23:29:56,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 253 transitions. [2019-11-23 23:29:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 23:29:56,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:56,893 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:56,893 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:56,893 INFO L82 PathProgramCache]: Analyzing trace with hash 262564574, now seen corresponding path program 1 times [2019-11-23 23:29:56,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:56,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570452335] [2019-11-23 23:29:56,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 23:29:57,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570452335] [2019-11-23 23:29:57,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:57,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:57,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938467649] [2019-11-23 23:29:57,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:57,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:57,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:57,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:57,106 INFO L87 Difference]: Start difference. First operand 145 states and 253 transitions. Second operand 4 states. [2019-11-23 23:29:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:57,669 INFO L93 Difference]: Finished difference Result 573 states and 1007 transitions. [2019-11-23 23:29:57,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:57,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-23 23:29:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:57,678 INFO L225 Difference]: With dead ends: 573 [2019-11-23 23:29:57,679 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:57,681 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:29:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 287. [2019-11-23 23:29:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:29:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions. [2019-11-23 23:29:57,726 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 75 [2019-11-23 23:29:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:57,727 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 467 transitions. [2019-11-23 23:29:57,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions. [2019-11-23 23:29:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 23:29:57,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:57,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:57,738 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash 406857172, now seen corresponding path program 1 times [2019-11-23 23:29:57,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:57,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082515001] [2019-11-23 23:29:57,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:29:57,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082515001] [2019-11-23 23:29:57,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:57,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:57,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854104141] [2019-11-23 23:29:57,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:57,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:57,830 INFO L87 Difference]: Start difference. First operand 287 states and 467 transitions. Second operand 3 states. [2019-11-23 23:29:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:58,273 INFO L93 Difference]: Finished difference Result 715 states and 1184 transitions. [2019-11-23 23:29:58,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:58,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 23:29:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:58,277 INFO L225 Difference]: With dead ends: 715 [2019-11-23 23:29:58,277 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:58,279 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:29:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-11-23 23:29:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-23 23:29:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 587 transitions. [2019-11-23 23:29:58,309 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 587 transitions. Word has length 105 [2019-11-23 23:29:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:58,313 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 587 transitions. [2019-11-23 23:29:58,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 587 transitions. [2019-11-23 23:29:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-23 23:29:58,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:58,316 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:29:58,316 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash 175522078, now seen corresponding path program 1 times [2019-11-23 23:29:58,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:58,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839625056] [2019-11-23 23:29:58,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-23 23:29:58,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839625056] [2019-11-23 23:29:58,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:58,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:58,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934217190] [2019-11-23 23:29:58,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:29:58,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:58,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:29:58,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:29:58,462 INFO L87 Difference]: Start difference. First operand 358 states and 587 transitions. Second operand 5 states. [2019-11-23 23:29:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:59,151 INFO L93 Difference]: Finished difference Result 788 states and 1270 transitions. [2019-11-23 23:29:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:59,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-23 23:29:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:59,154 INFO L225 Difference]: With dead ends: 788 [2019-11-23 23:29:59,154 INFO L226 Difference]: Without dead ends: 431 [2019-11-23 23:29:59,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:29:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-23 23:29:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2019-11-23 23:29:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:29:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 664 transitions. [2019-11-23 23:29:59,172 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 664 transitions. Word has length 109 [2019-11-23 23:29:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:59,172 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 664 transitions. [2019-11-23 23:29:59,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:29:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 664 transitions. [2019-11-23 23:29:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 23:29:59,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:59,175 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:59,175 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash 94275030, now seen corresponding path program 1 times [2019-11-23 23:29:59,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:59,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216243256] [2019-11-23 23:29:59,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 23:29:59,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216243256] [2019-11-23 23:29:59,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:59,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:59,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500340026] [2019-11-23 23:29:59,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:59,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:59,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:59,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:59,287 INFO L87 Difference]: Start difference. First operand 429 states and 664 transitions. Second operand 3 states. [2019-11-23 23:29:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:59,682 INFO L93 Difference]: Finished difference Result 928 states and 1464 transitions. [2019-11-23 23:29:59,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:59,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-23 23:29:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:59,687 INFO L225 Difference]: With dead ends: 928 [2019-11-23 23:29:59,688 INFO L226 Difference]: Without dead ends: 571 [2019-11-23 23:29:59,689 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:29:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-23 23:29:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-23 23:29:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-23 23:29:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 842 transitions. [2019-11-23 23:29:59,704 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 842 transitions. Word has length 113 [2019-11-23 23:29:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:59,704 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 842 transitions. [2019-11-23 23:29:59,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 842 transitions. [2019-11-23 23:29:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-23 23:29:59,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:59,707 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:29:59,707 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:59,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:59,708 INFO L82 PathProgramCache]: Analyzing trace with hash 927110326, now seen corresponding path program 1 times [2019-11-23 23:29:59,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:59,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270868160] [2019-11-23 23:29:59,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-23 23:29:59,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270868160] [2019-11-23 23:29:59,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:59,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:29:59,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968492353] [2019-11-23 23:29:59,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:59,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:59,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:59,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:59,765 INFO L87 Difference]: Start difference. First operand 571 states and 842 transitions. Second operand 4 states. [2019-11-23 23:30:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:00,407 INFO L93 Difference]: Finished difference Result 1709 states and 2533 transitions. [2019-11-23 23:30:00,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:00,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-23 23:30:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:00,415 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:30:00,415 INFO L226 Difference]: Without dead ends: 1210 [2019-11-23 23:30:00,416 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:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-23 23:30:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 855. [2019-11-23 23:30:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1222 transitions. [2019-11-23 23:30:00,445 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1222 transitions. Word has length 122 [2019-11-23 23:30:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:00,445 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1222 transitions. [2019-11-23 23:30:00,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1222 transitions. [2019-11-23 23:30:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 23:30:00,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:00,448 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,448 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:00,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1551429574, now seen corresponding path program 1 times [2019-11-23 23:30:00,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:00,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92442859] [2019-11-23 23:30:00,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-23 23:30:00,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92442859] [2019-11-23 23:30:00,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:00,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:00,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59996660] [2019-11-23 23:30:00,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:00,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:00,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:00,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:00,529 INFO L87 Difference]: Start difference. First operand 855 states and 1222 transitions. Second operand 4 states. [2019-11-23 23:30:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:01,058 INFO L93 Difference]: Finished difference Result 1638 states and 2366 transitions. [2019-11-23 23:30:01,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:01,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-23 23:30:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:01,066 INFO L225 Difference]: With dead ends: 1638 [2019-11-23 23:30:01,066 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:30:01,068 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:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:30:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-23 23:30:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1216 transitions. [2019-11-23 23:30:01,095 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1216 transitions. Word has length 146 [2019-11-23 23:30:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:01,096 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1216 transitions. [2019-11-23 23:30:01,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1216 transitions. [2019-11-23 23:30:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:30:01,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:01,100 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:01,100 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1130225127, now seen corresponding path program 1 times [2019-11-23 23:30:01,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:01,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049530232] [2019-11-23 23:30:01,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 23:30:01,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049530232] [2019-11-23 23:30:01,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:01,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:30:01,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103577891] [2019-11-23 23:30:01,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:30:01,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:30:01,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:01,348 INFO L87 Difference]: Start difference. First operand 855 states and 1216 transitions. Second operand 8 states. [2019-11-23 23:30:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:02,152 INFO L93 Difference]: Finished difference Result 1890 states and 2678 transitions. [2019-11-23 23:30:02,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:30:02,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 158 [2019-11-23 23:30:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:02,158 INFO L225 Difference]: With dead ends: 1890 [2019-11-23 23:30:02,159 INFO L226 Difference]: Without dead ends: 1107 [2019-11-23 23:30:02,160 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:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-11-23 23:30:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 997. [2019-11-23 23:30:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:30:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1375 transitions. [2019-11-23 23:30:02,186 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1375 transitions. Word has length 158 [2019-11-23 23:30:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:02,186 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1375 transitions. [2019-11-23 23:30:02,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:30:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1375 transitions. [2019-11-23 23:30:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-23 23:30:02,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:02,190 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:30:02,190 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:02,191 INFO L82 PathProgramCache]: Analyzing trace with hash -397130838, now seen corresponding path program 1 times [2019-11-23 23:30:02,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:02,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374758757] [2019-11-23 23:30:02,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 23:30:02,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374758757] [2019-11-23 23:30:02,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:02,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:02,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984472900] [2019-11-23 23:30:02,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:02,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:02,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:02,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:02,284 INFO L87 Difference]: Start difference. First operand 997 states and 1375 transitions. Second operand 4 states. [2019-11-23 23:30:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:02,768 INFO L93 Difference]: Finished difference Result 2348 states and 3224 transitions. [2019-11-23 23:30:02,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:02,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-23 23:30:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:02,773 INFO L225 Difference]: With dead ends: 2348 [2019-11-23 23:30:02,774 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:30:02,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:30:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-23 23:30:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1057 transitions. [2019-11-23 23:30:02,802 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1057 transitions. Word has length 161 [2019-11-23 23:30:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:02,803 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1057 transitions. [2019-11-23 23:30:02,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1057 transitions. [2019-11-23 23:30:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-23 23:30:02,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:02,806 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:02,807 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1210199784, now seen corresponding path program 1 times [2019-11-23 23:30:02,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:02,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237074620] [2019-11-23 23:30:02,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-23 23:30:02,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237074620] [2019-11-23 23:30:02,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:02,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:02,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272736926] [2019-11-23 23:30:02,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:02,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:02,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:02,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:02,968 INFO L87 Difference]: Start difference. First operand 926 states and 1057 transitions. Second operand 3 states. [2019-11-23 23:30:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:03,246 INFO L93 Difference]: Finished difference Result 1139 states and 1309 transitions. [2019-11-23 23:30:03,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:03,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-23 23:30:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:03,248 INFO L225 Difference]: With dead ends: 1139 [2019-11-23 23:30:03,248 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:03,249 INFO L630 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-11-23 23:30:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:03,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2019-11-23 23:30:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:03,251 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:03,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:03,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:03,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:03,507 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-11-23 23:30:03,620 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-11-23 23:30:03,624 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:03,624 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:03,624 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:03,624 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:03,624 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:03,625 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:03,625 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:03,625 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:03,625 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:03,625 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:03,626 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:03,626 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:03,626 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:03,626 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:03,627 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:03,627 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:03,627 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:03,628 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 13 ~a8~0))) (let ((.cse4 (not .cse0)) (.cse5 (not (= ~a16~0 6))) (.cse2 (not (= 1 ~a7~0))) (.cse3 (= ~a21~0 1)) (.cse1 (= ~a20~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse5 (= ~a17~0 1)) (and .cse5 .cse2 .cse3) (and (not (= 15 ~a8~0)) .cse3 .cse1)))) [2019-11-23 23:30:03,628 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:03,628 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:03,628 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:03,628 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:03,629 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:03,629 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:03,629 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:03,629 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:03,629 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:03,629 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:03,629 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:03,630 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:03,630 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:03,630 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:03,630 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:03,630 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:03,630 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:03,630 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:03,631 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 23:30:03,631 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:03,631 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:03,631 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:03,631 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:03,631 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:03,631 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:03,631 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:03,632 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 13 ~a8~0))) (let ((.cse4 (not .cse0)) (.cse5 (not (= ~a16~0 6))) (.cse2 (not (= 1 ~a7~0))) (.cse3 (= ~a21~0 1)) (.cse1 (= ~a20~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse5 (= ~a17~0 1)) (and .cse5 .cse2 .cse3) (and (not (= 15 ~a8~0)) .cse3 .cse1)))) [2019-11-23 23:30:03,632 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:03,632 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:03,632 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:03,632 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:03,632 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:03,633 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:03,633 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:03,633 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:03,633 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:03,633 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:03,633 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:03,633 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:03,633 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:03,634 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:03,634 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:03,634 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:03,634 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:03,634 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:03,634 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:03,634 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:03,635 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:03,635 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:03,635 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:03,635 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 515) no Hoare annotation was computed. [2019-11-23 23:30:03,635 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:03,635 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:03,636 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:03,636 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:03,636 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:03,636 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:03,636 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:03,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:03 BoogieIcfgContainer [2019-11-23 23:30:03,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:03,659 INFO L168 Benchmark]: Toolchain (without parser) took 10906.86 ms. Allocated memory was 137.9 MB in the beginning and 380.1 MB in the end (delta: 242.2 MB). Free memory was 101.8 MB in the beginning and 98.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 245.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:03,659 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 23:30:03,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.48 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 101.4 MB in the beginning and 170.5 MB in the end (delta: -69.2 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:03,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.69 ms. Allocated memory is still 204.5 MB. Free memory was 170.5 MB in the beginning and 164.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:03,662 INFO L168 Benchmark]: Boogie Preprocessor took 76.13 ms. Allocated memory is still 204.5 MB. Free memory was 164.7 MB in the beginning and 157.7 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:03,663 INFO L168 Benchmark]: RCFGBuilder took 2095.83 ms. Allocated memory was 204.5 MB in the beginning and 251.7 MB in the end (delta: 47.2 MB). Free memory was 157.7 MB in the beginning and 208.6 MB in the end (delta: -51.0 MB). Peak memory consumption was 112.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:03,664 INFO L168 Benchmark]: TraceAbstraction took 7892.02 ms. Allocated memory was 251.7 MB in the beginning and 380.1 MB in the end (delta: 128.5 MB). Free memory was 206.8 MB in the beginning and 98.7 MB in the end (delta: 108.1 MB). Peak memory consumption was 236.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:03,669 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.26 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.48 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 101.4 MB in the beginning and 170.5 MB in the end (delta: -69.2 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.69 ms. Allocated memory is still 204.5 MB. Free memory was 170.5 MB in the beginning and 164.7 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.13 ms. Allocated memory is still 204.5 MB. Free memory was 164.7 MB in the beginning and 157.7 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2095.83 ms. Allocated memory was 204.5 MB in the beginning and 251.7 MB in the end (delta: 47.2 MB). Free memory was 157.7 MB in the beginning and 208.6 MB in the end (delta: -51.0 MB). Peak memory consumption was 112.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7892.02 ms. Allocated memory was 251.7 MB in the beginning and 380.1 MB in the end (delta: 128.5 MB). Free memory was 206.8 MB in the beginning and 98.7 MB in the end (delta: 108.1 MB). Peak memory consumption was 236.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 515]: 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 && a20 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((13 == a8 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((13 == a8 && a20 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((13 == a8 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.8s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 430 SDtfs, 1287 SDslu, 76 SDs, 0 SdLazy, 3199 SolverSat, 876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred 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, 10 MinimizatonAttempts, 822 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 47 NumberOfFragments, 133 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5286 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 178 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1235 NumberOfCodeBlocks, 1235 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1225 ConstructedInterpolants, 0 QuantifiedInterpolants, 394722 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 761/761 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...