/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_label19.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:34,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:34,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:34,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:34,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:34,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:34,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:34,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:34,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:34,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:34,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:34,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:34,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:34,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:34,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:34,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:34,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:34,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:34,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:34,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:34,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:34,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:34,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:34,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:34,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:34,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:34,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:34,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:34,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:34,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:34,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:34,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:34,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:34,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:34,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:34,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:34,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:34,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:34,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:34,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:34,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:34,738 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:34,752 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:34,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:34,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:34,754 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:34,754 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:34,754 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:34,754 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:34,754 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:34,755 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:34,755 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:34,755 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:34,755 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:34,755 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:34,756 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:34,756 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:34,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:34,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:34,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:34,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:34,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:34,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:34,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:34,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:34,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:34,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:34,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:34,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:34,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:34,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:34,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:34,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:34,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:34,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:34,760 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:34,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:34,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:34,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:34,761 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:35,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:35,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:35,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:35,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:35,049 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:35,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label19.c [2019-11-23 23:30:35,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880a25a28/df94d99c8ed44eccbf5484de3cd67f6b/FLAGfdbf5a355 [2019-11-23 23:30:35,698 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:35,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label19.c [2019-11-23 23:30:35,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880a25a28/df94d99c8ed44eccbf5484de3cd67f6b/FLAGfdbf5a355 [2019-11-23 23:30:35,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880a25a28/df94d99c8ed44eccbf5484de3cd67f6b [2019-11-23 23:30:35,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:35,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:35,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:35,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:35,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:35,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:35" (1/1) ... [2019-11-23 23:30:35,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7bf8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:35, skipping insertion in model container [2019-11-23 23:30:35,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:35" (1/1) ... [2019-11-23 23:30:35,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:36,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:36,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:36,466 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:36,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:36,694 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:36,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:36 WrapperNode [2019-11-23 23:30:36,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:36,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:36,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:36,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:36,704 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:36" (1/1) ... [2019-11-23 23:30:36,737 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:36" (1/1) ... [2019-11-23 23:30:36,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:36,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:36,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:36,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:36,812 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:36" (1/1) ... [2019-11-23 23:30:36,812 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:36" (1/1) ... [2019-11-23 23:30:36,825 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:36" (1/1) ... [2019-11-23 23:30:36,830 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:36" (1/1) ... [2019-11-23 23:30:36,862 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:36" (1/1) ... [2019-11-23 23:30:36,876 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:36" (1/1) ... [2019-11-23 23:30:36,880 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:36" (1/1) ... [2019-11-23 23:30:36,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:36,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:36,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:36,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:36,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:36" (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:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:36,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:38,893 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:38,893 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:38,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:38 BoogieIcfgContainer [2019-11-23 23:30:38,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:38,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:38,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:38,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:38,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:35" (1/3) ... [2019-11-23 23:30:38,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0843e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:38, skipping insertion in model container [2019-11-23 23:30:38,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:36" (2/3) ... [2019-11-23 23:30:38,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0843e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:38, skipping insertion in model container [2019-11-23 23:30:38,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:38" (3/3) ... [2019-11-23 23:30:38,903 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label19.c [2019-11-23 23:30:38,912 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:38,920 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:38,931 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:38,956 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:38,956 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:38,957 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:38,957 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:38,957 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:38,957 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:38,957 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:38,958 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:38,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:38,983 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:38,983 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:38,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:38,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1323246111, now seen corresponding path program 1 times [2019-11-23 23:30:38,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:38,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963442628] [2019-11-23 23:30:38,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:39,372 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:39,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963442628] [2019-11-23 23:30:39,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:39,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:39,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293985585] [2019-11-23 23:30:39,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:39,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:39,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:39,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:39,398 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:40,168 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:40,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:40,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:40,192 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:40,193 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:40,198 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:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:30:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:30:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-23 23:30:40,252 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-11-23 23:30:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:40,253 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-23 23:30:40,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-23 23:30:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:30:40,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:40,258 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:40,258 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash 585771609, now seen corresponding path program 1 times [2019-11-23 23:30:40,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:40,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980103610] [2019-11-23 23:30:40,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:40,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980103610] [2019-11-23 23:30:40,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:40,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:40,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44580311] [2019-11-23 23:30:40,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:40,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:40,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:40,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:40,348 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-11-23 23:30:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:40,796 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-11-23 23:30:40,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:40,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:30:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:40,800 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:30:40,800 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:40,802 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:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:30:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-11-23 23:30:40,831 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-11-23 23:30:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:40,832 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-11-23 23:30:40,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-11-23 23:30:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:30:40,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:40,839 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:40,839 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:40,839 INFO L82 PathProgramCache]: Analyzing trace with hash 928578915, now seen corresponding path program 1 times [2019-11-23 23:30:40,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:40,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487547048] [2019-11-23 23:30:40,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:40,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487547048] [2019-11-23 23:30:40,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:40,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:40,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201347461] [2019-11-23 23:30:40,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:40,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:40,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:40,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:40,941 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-11-23 23:30:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:41,373 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-11-23 23:30:41,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:41,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 23:30:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:41,378 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:30:41,378 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:30:41,380 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:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:30:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-11-23 23:30:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 23:30:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-11-23 23:30:41,417 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-11-23 23:30:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:41,417 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-11-23 23:30:41,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-11-23 23:30:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 23:30:41,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:41,427 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:41,428 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:41,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:41,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1330805370, now seen corresponding path program 1 times [2019-11-23 23:30:41,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:41,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366298498] [2019-11-23 23:30:41,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-23 23:30:41,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366298498] [2019-11-23 23:30:41,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:41,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:41,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489621300] [2019-11-23 23:30:41,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:41,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:41,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:41,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:41,548 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-11-23 23:30:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:41,967 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-11-23 23:30:41,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:41,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 23:30:41,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:41,972 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:30:41,972 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:30:41,974 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:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:30:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 571. [2019-11-23 23:30:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-23 23:30:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 877 transitions. [2019-11-23 23:30:41,994 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 877 transitions. Word has length 133 [2019-11-23 23:30:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:41,995 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 877 transitions. [2019-11-23 23:30:41,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 877 transitions. [2019-11-23 23:30:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 23:30:41,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:41,998 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-23 23:30:41,999 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:41,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:41,999 INFO L82 PathProgramCache]: Analyzing trace with hash -211736042, now seen corresponding path program 1 times [2019-11-23 23:30:41,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:42,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209559531] [2019-11-23 23:30:42,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-23 23:30:42,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209559531] [2019-11-23 23:30:42,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:42,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:42,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525434381] [2019-11-23 23:30:42,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:42,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:42,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:42,103 INFO L87 Difference]: Start difference. First operand 571 states and 877 transitions. Second operand 3 states. [2019-11-23 23:30:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:42,530 INFO L93 Difference]: Finished difference Result 1567 states and 2383 transitions. [2019-11-23 23:30:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:42,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 23:30:42,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:42,538 INFO L225 Difference]: With dead ends: 1567 [2019-11-23 23:30:42,538 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:30:42,540 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:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:30:42,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 855. [2019-11-23 23:30:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1269 transitions. [2019-11-23 23:30:42,570 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1269 transitions. Word has length 152 [2019-11-23 23:30:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:42,570 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1269 transitions. [2019-11-23 23:30:42,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1269 transitions. [2019-11-23 23:30:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 23:30:42,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:42,574 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:42,574 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1004824157, now seen corresponding path program 1 times [2019-11-23 23:30:42,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:42,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304763154] [2019-11-23 23:30:42,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:30:42,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304763154] [2019-11-23 23:30:42,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:42,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:42,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514963770] [2019-11-23 23:30:42,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:42,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:42,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:42,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:42,693 INFO L87 Difference]: Start difference. First operand 855 states and 1269 transitions. Second operand 3 states. [2019-11-23 23:30:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:43,190 INFO L93 Difference]: Finished difference Result 1851 states and 2733 transitions. [2019-11-23 23:30:43,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:43,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 23:30:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:43,202 INFO L225 Difference]: With dead ends: 1851 [2019-11-23 23:30:43,202 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:30:43,205 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:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:30:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-23 23:30:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:30:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1429 transitions. [2019-11-23 23:30:43,247 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1429 transitions. Word has length 155 [2019-11-23 23:30:43,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:43,248 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1429 transitions. [2019-11-23 23:30:43,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1429 transitions. [2019-11-23 23:30:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 23:30:43,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:43,254 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:43,254 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:43,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:43,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1683955563, now seen corresponding path program 1 times [2019-11-23 23:30:43,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:43,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074673017] [2019-11-23 23:30:43,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:30:43,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074673017] [2019-11-23 23:30:43,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:43,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:30:43,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175141000] [2019-11-23 23:30:43,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:30:43,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:30:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:43,530 INFO L87 Difference]: Start difference. First operand 997 states and 1429 transitions. Second operand 8 states. [2019-11-23 23:30:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:44,564 INFO L93 Difference]: Finished difference Result 2100 states and 2970 transitions. [2019-11-23 23:30:44,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:30:44,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-23 23:30:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:44,571 INFO L225 Difference]: With dead ends: 2100 [2019-11-23 23:30:44,572 INFO L226 Difference]: Without dead ends: 1104 [2019-11-23 23:30:44,574 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:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-11-23 23:30:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 997. [2019-11-23 23:30:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:30:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1417 transitions. [2019-11-23 23:30:44,602 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1417 transitions. Word has length 159 [2019-11-23 23:30:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:44,602 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1417 transitions. [2019-11-23 23:30:44,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:30:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1417 transitions. [2019-11-23 23:30:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-23 23:30:44,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:44,607 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:44,607 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:44,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:44,608 INFO L82 PathProgramCache]: Analyzing trace with hash -114234747, now seen corresponding path program 1 times [2019-11-23 23:30:44,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:44,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53944080] [2019-11-23 23:30:44,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 23:30:44,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53944080] [2019-11-23 23:30:44,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:44,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:44,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171637986] [2019-11-23 23:30:44,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:44,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:44,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:44,751 INFO L87 Difference]: Start difference. First operand 997 states and 1417 transitions. Second operand 4 states. [2019-11-23 23:30:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:45,372 INFO L93 Difference]: Finished difference Result 2135 states and 3035 transitions. [2019-11-23 23:30:45,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:45,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-23 23:30:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:45,379 INFO L225 Difference]: With dead ends: 2135 [2019-11-23 23:30:45,379 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 23:30:45,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 23:30:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-23 23:30:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1422 transitions. [2019-11-23 23:30:45,422 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1422 transitions. Word has length 192 [2019-11-23 23:30:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:45,424 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1422 transitions. [2019-11-23 23:30:45,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1422 transitions. [2019-11-23 23:30:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-23 23:30:45,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:45,432 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,432 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:45,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:45,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1171740985, now seen corresponding path program 1 times [2019-11-23 23:30:45,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:45,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829512340] [2019-11-23 23:30:45,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-23 23:30:45,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829512340] [2019-11-23 23:30:45,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:45,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:45,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508342244] [2019-11-23 23:30:45,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:45,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:45,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:45,734 INFO L87 Difference]: Start difference. First operand 1068 states and 1422 transitions. Second operand 4 states. [2019-11-23 23:30:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:46,366 INFO L93 Difference]: Finished difference Result 2419 states and 3181 transitions. [2019-11-23 23:30:46,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:46,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-23 23:30:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:46,372 INFO L225 Difference]: With dead ends: 2419 [2019-11-23 23:30:46,373 INFO L226 Difference]: Without dead ends: 1352 [2019-11-23 23:30:46,375 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:46,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-23 23:30:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1068. [2019-11-23 23:30:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-23 23:30:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1410 transitions. [2019-11-23 23:30:46,404 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1410 transitions. Word has length 218 [2019-11-23 23:30:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:46,405 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1410 transitions. [2019-11-23 23:30:46,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1410 transitions. [2019-11-23 23:30:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 23:30:46,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:46,412 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:46,412 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash 39380996, now seen corresponding path program 1 times [2019-11-23 23:30:46,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:46,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163674943] [2019-11-23 23:30:46,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-23 23:30:46,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163674943] [2019-11-23 23:30:46,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:46,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:30:46,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203410060] [2019-11-23 23:30:46,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:30:46,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:46,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:30:46,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:30:46,710 INFO L87 Difference]: Start difference. First operand 1068 states and 1410 transitions. Second operand 6 states. [2019-11-23 23:30:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:47,451 INFO L93 Difference]: Finished difference Result 2244 states and 2934 transitions. [2019-11-23 23:30:47,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:47,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-11-23 23:30:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:47,458 INFO L225 Difference]: With dead ends: 2244 [2019-11-23 23:30:47,458 INFO L226 Difference]: Without dead ends: 1177 [2019-11-23 23:30:47,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:30:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-11-23 23:30:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 997. [2019-11-23 23:30:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:30:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1261 transitions. [2019-11-23 23:30:47,488 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1261 transitions. Word has length 239 [2019-11-23 23:30:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:47,489 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1261 transitions. [2019-11-23 23:30:47,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:30:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1261 transitions. [2019-11-23 23:30:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-23 23:30:47,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:47,494 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-23 23:30:47,495 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:47,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1839440475, now seen corresponding path program 1 times [2019-11-23 23:30:47,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:47,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195762291] [2019-11-23 23:30:47,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-23 23:30:48,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195762291] [2019-11-23 23:30:48,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:48,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-23 23:30:48,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755724742] [2019-11-23 23:30:48,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 23:30:48,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:48,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 23:30:48,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-23 23:30:48,533 INFO L87 Difference]: Start difference. First operand 997 states and 1261 transitions. Second operand 14 states. [2019-11-23 23:30:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:49,794 INFO L93 Difference]: Finished difference Result 2252 states and 2825 transitions. [2019-11-23 23:30:49,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 23:30:49,795 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2019-11-23 23:30:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:49,796 INFO L225 Difference]: With dead ends: 2252 [2019-11-23 23:30:49,796 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:49,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2019-11-23 23:30:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:49,800 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-11-23 23:30:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:49,800 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:49,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 23:30:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:49,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:49,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:49,984 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 108 [2019-11-23 23:30:50,134 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 108 [2019-11-23 23:30:50,772 WARN L192 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-11-23 23:30:51,305 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-11-23 23:30:51,309 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:51,309 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:51,310 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:51,310 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:51,310 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:51,310 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 23:30:51,310 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:51,311 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:51,311 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:51,311 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:51,311 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:51,311 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:51,311 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:51,312 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:51,312 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:51,312 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:51,312 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:51,312 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:51,312 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:51,313 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 1 ~a7~0)) (.cse4 (= ~a16~0 6)) (.cse1 (= ~a21~0 1))) (let ((.cse5 (not .cse1)) (.cse7 (= 13 ~a8~0)) (.cse10 (<= ~a17~0 0)) (.cse11 (= ~a16~0 4)) (.cse8 (not .cse4)) (.cse9 (= ~a17~0 1)) (.cse3 (= ~a20~0 1)) (.cse2 (not .cse6)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 (= ~a16~0 5)) (and .cse2 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse0) (and .cse5 .cse6 .cse7 .cse0 .cse10 .cse3 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse4) (and .cse6 .cse7 .cse11 .cse0 .cse10) (and .cse11 .cse0 .cse1 (not .cse9)) (and .cse8 .cse2 .cse9 .cse0 .cse1) (and .cse9 .cse0 .cse1 .cse3) (and .cse2 .cse0 .cse1 (= 15 ~a8~0) .cse4)))) [2019-11-23 23:30:51,313 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:51,313 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:51,314 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:51,314 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:51,314 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:51,314 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:51,314 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:51,314 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:51,314 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:51,314 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:51,315 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:51,315 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:51,315 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:51,315 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:51,315 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:51,315 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:51,315 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:51,315 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:51,315 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:51,316 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:51,316 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:51,316 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:51,316 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:51,316 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= 1 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse1 (= ~a21~0 1))) (let ((.cse2 (not .cse1)) (.cse7 (= ~a20~0 1)) (.cse4 (= 13 ~a8~0)) (.cse10 (<= ~a17~0 0)) (.cse11 (= ~a16~0 4)) (.cse5 (not .cse9)) (.cse6 (= ~a17~0 1)) (.cse8 (not .cse3)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 (= ~a16~0 5)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse0) (and .cse0 (or (and .cse6 .cse1 .cse7) (and .cse8 .cse1 .cse7 .cse9))) (and .cse2 .cse3 .cse4 .cse0 .cse10 .cse7 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse9) (and .cse3 .cse4 .cse11 .cse0 .cse10) (and .cse11 .cse0 .cse1 (not .cse6)) (and .cse5 .cse8 .cse6 .cse0 .cse1) (and .cse8 .cse0 .cse1 (= 15 ~a8~0) .cse9)))) [2019-11-23 23:30:51,316 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:51,316 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:51,317 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:51,318 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:51,318 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:51,318 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:51,318 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:51,318 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:51,318 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:51,318 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:51,318 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:51,318 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:51,318 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:51,319 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 434) no Hoare annotation was computed. [2019-11-23 23:30:51,319 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:51,319 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:51,319 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:51,319 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:51,319 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:51,319 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:51,320 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:51,320 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:51,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:51 BoogieIcfgContainer [2019-11-23 23:30:51,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:51,347 INFO L168 Benchmark]: Toolchain (without parser) took 15411.75 ms. Allocated memory was 138.9 MB in the beginning and 487.6 MB in the end (delta: 348.7 MB). Free memory was 101.2 MB in the beginning and 414.6 MB in the end (delta: -313.4 MB). Peak memory consumption was 302.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,348 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.35 ms. Allocated memory was 138.9 MB in the beginning and 206.0 MB in the end (delta: 67.1 MB). Free memory was 101.0 MB in the beginning and 172.3 MB in the end (delta: -71.3 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.48 ms. Allocated memory is still 206.0 MB. Free memory was 172.3 MB in the beginning and 166.8 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,350 INFO L168 Benchmark]: Boogie Preprocessor took 92.03 ms. Allocated memory is still 206.0 MB. Free memory was 166.8 MB in the beginning and 161.8 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,350 INFO L168 Benchmark]: RCFGBuilder took 2006.64 ms. Allocated memory was 206.0 MB in the beginning and 250.1 MB in the end (delta: 44.0 MB). Free memory was 161.8 MB in the beginning and 205.6 MB in the end (delta: -43.8 MB). Peak memory consumption was 114.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,351 INFO L168 Benchmark]: TraceAbstraction took 12448.95 ms. Allocated memory was 250.1 MB in the beginning and 487.6 MB in the end (delta: 237.5 MB). Free memory was 205.6 MB in the beginning and 414.6 MB in the end (delta: -209.0 MB). Peak memory consumption was 295.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:51,355 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 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.35 ms. Allocated memory was 138.9 MB in the beginning and 206.0 MB in the end (delta: 67.1 MB). Free memory was 101.0 MB in the beginning and 172.3 MB in the end (delta: -71.3 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 100.48 ms. Allocated memory is still 206.0 MB. Free memory was 172.3 MB in the beginning and 166.8 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 92.03 ms. Allocated memory is still 206.0 MB. Free memory was 166.8 MB in the beginning and 161.8 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2006.64 ms. Allocated memory was 206.0 MB in the beginning and 250.1 MB in the end (delta: 44.0 MB). Free memory was 161.8 MB in the beginning and 205.6 MB in the end (delta: -43.8 MB). Peak memory consumption was 114.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12448.95 ms. Allocated memory was 250.1 MB in the beginning and 487.6 MB in the end (delta: 237.5 MB). Free memory was 205.6 MB in the beginning and 414.6 MB in the end (delta: -209.0 MB). Peak memory consumption was 295.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 434]: 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: (((((((((a12 == 8 && a21 == 1) && a16 == 5) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && a20 == 1) && a16 == 6)) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || ((((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((a12 == 8 && a21 == 1) && a16 == 5) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (a12 == 8 && (((a17 == 1 && a21 == 1) && a20 == 1) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 6)))) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || ((((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 12.3s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 598 SDtfs, 1439 SDslu, 102 SDs, 0 SdLazy, 4267 SolverSat, 989 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1068 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 332 HoareAnnotationTreeSize, 3 FomulaSimplifications, 16580 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3519 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1753 NumberOfCodeBlocks, 1753 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1742 ConstructedInterpolants, 0 QuantifiedInterpolants, 1294486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2252/2252 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...