/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/product-lines/email_spec8_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:11:20,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:11:20,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:11:20,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:11:20,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:11:20,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:11:20,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:11:20,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:11:20,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:11:20,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:11:20,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:11:20,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:11:20,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:11:20,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:11:20,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:11:20,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:11:20,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:11:20,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:11:20,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:11:20,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:11:20,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:11:20,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:11:20,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:11:20,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:11:20,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:11:20,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:11:20,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:11:20,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:11:20,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:11:20,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:11:20,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:11:20,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:11:20,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:11:20,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:11:20,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:11:20,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:11:20,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:11:20,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:11:20,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:11:20,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:11:20,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:11:20,804 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-24 05:11:20,825 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:11:20,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:11:20,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:11:20,826 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:11:20,826 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:11:20,826 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:11:20,827 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:11:20,827 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:11:20,827 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:11:20,828 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:11:20,828 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:11:20,828 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:11:20,828 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:11:20,828 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:11:20,829 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:11:20,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:11:20,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:11:20,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:11:20,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:11:20,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:11:20,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:11:20,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:11:20,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:11:20,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:11:20,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:11:20,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:11:20,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:11:20,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:11:20,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:11:20,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:11:20,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:11:20,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:11:20,836 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:11:20,836 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:11:20,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:11:20,837 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:11:20,837 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:11:20,837 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:11:21,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:11:21,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:11:21,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:11:21,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:11:21,167 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:11:21,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product21.cil.c [2019-11-24 05:11:21,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e596293d1/71198d17205c47e2879ac2a1340ff65c/FLAGadd29ba1c [2019-11-24 05:11:21,920 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:11:21,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product21.cil.c [2019-11-24 05:11:21,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e596293d1/71198d17205c47e2879ac2a1340ff65c/FLAGadd29ba1c [2019-11-24 05:11:22,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e596293d1/71198d17205c47e2879ac2a1340ff65c [2019-11-24 05:11:22,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:11:22,131 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:11:22,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:11:22,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:11:22,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:11:22,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:11:22" (1/1) ... [2019-11-24 05:11:22,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd13ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:22, skipping insertion in model container [2019-11-24 05:11:22,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:11:22" (1/1) ... [2019-11-24 05:11:22,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:11:22,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:11:23,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:11:23,186 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:11:23,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:11:23,382 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:11:23,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23 WrapperNode [2019-11-24 05:11:23,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:11:23,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:11:23,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:11:23,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:11:23,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (1/1) ... [2019-11-24 05:11:23,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (1/1) ... [2019-11-24 05:11:23,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:11:23,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:11:23,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:11:23,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:11:23,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (1/1) ... [2019-11-24 05:11:23,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (1/1) ... [2019-11-24 05:11:23,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (1/1) ... [2019-11-24 05:11:23,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (1/1) ... [2019-11-24 05:11:23,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (1/1) ... [2019-11-24 05:11:23,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (1/1) ... [2019-11-24 05:11:23,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (1/1) ... [2019-11-24 05:11:23,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:11:23,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:11:23,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:11:23,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:11:23,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (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-24 05:11:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 05:11:23,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 05:11:23,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 05:11:23,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:11:23,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:11:38,698 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:11:38,698 INFO L284 CfgBuilder]: Removed 649 assume(true) statements. [2019-11-24 05:11:38,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:11:38 BoogieIcfgContainer [2019-11-24 05:11:38,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:11:38,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:11:38,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:11:38,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:11:38,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:11:22" (1/3) ... [2019-11-24 05:11:38,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69279747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:11:38, skipping insertion in model container [2019-11-24 05:11:38,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:11:23" (2/3) ... [2019-11-24 05:11:38,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69279747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:11:38, skipping insertion in model container [2019-11-24 05:11:38,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:11:38" (3/3) ... [2019-11-24 05:11:38,715 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product21.cil.c [2019-11-24 05:11:38,725 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:11:38,733 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:11:38,745 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:11:38,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:11:38,770 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:11:38,771 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:11:38,771 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:11:38,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:11:38,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:11:38,771 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:11:38,771 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:11:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-24 05:11:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 05:11:38,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:38,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:38,797 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:38,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2000054344, now seen corresponding path program 1 times [2019-11-24 05:11:38,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:38,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074426361] [2019-11-24 05:11:38,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:39,196 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-24 05:11:39,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074426361] [2019-11-24 05:11:39,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:39,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:11:39,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538807939] [2019-11-24 05:11:39,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 05:11:39,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:39,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 05:11:39,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:11:39,221 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2019-11-24 05:11:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:39,244 INFO L93 Difference]: Finished difference Result 100 states and 153 transitions. [2019-11-24 05:11:39,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 05:11:39,246 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 05:11:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:39,257 INFO L225 Difference]: With dead ends: 100 [2019-11-24 05:11:39,258 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 05:11:39,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:11:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 05:11:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-24 05:11:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 05:11:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2019-11-24 05:11:39,301 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 8 [2019-11-24 05:11:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:39,301 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2019-11-24 05:11:39,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 05:11:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2019-11-24 05:11:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 05:11:39,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:39,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:39,303 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:39,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:39,304 INFO L82 PathProgramCache]: Analyzing trace with hash -898179980, now seen corresponding path program 1 times [2019-11-24 05:11:39,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:39,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202102702] [2019-11-24 05:11:39,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:39,450 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-24 05:11:39,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202102702] [2019-11-24 05:11:39,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:39,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:39,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312851049] [2019-11-24 05:11:39,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:39,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:39,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:39,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:39,454 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand 3 states. [2019-11-24 05:11:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:39,479 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-24 05:11:39,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:39,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 05:11:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:39,480 INFO L225 Difference]: With dead ends: 94 [2019-11-24 05:11:39,481 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 05:11:39,482 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-24 05:11:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 05:11:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 05:11:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 05:11:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 05:11:39,497 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 9 [2019-11-24 05:11:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:39,497 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 05:11:39,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 05:11:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 05:11:39,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:39,499 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:39,499 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:39,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:39,500 INFO L82 PathProgramCache]: Analyzing trace with hash -370728834, now seen corresponding path program 1 times [2019-11-24 05:11:39,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:39,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805320783] [2019-11-24 05:11:39,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:11:39,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805320783] [2019-11-24 05:11:39,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:39,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:11:39,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434163265] [2019-11-24 05:11:39,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:39,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:39,761 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 05:11:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:39,901 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2019-11-24 05:11:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:39,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 05:11:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:39,904 INFO L225 Difference]: With dead ends: 86 [2019-11-24 05:11:39,904 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 05:11:39,907 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-24 05:11:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 05:11:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-24 05:11:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 05:11:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-24 05:11:39,919 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2019-11-24 05:11:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:39,920 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-24 05:11:39,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-24 05:11:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:11:39,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:39,923 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:39,924 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:39,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:39,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1439038952, now seen corresponding path program 1 times [2019-11-24 05:11:39,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:39,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082833503] [2019-11-24 05:11:39,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:11:40,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082833503] [2019-11-24 05:11:40,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:40,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:11:40,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681518985] [2019-11-24 05:11:40,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:11:40,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:40,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:11:40,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:11:40,388 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 8 states. [2019-11-24 05:11:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:41,570 INFO L93 Difference]: Finished difference Result 132 states and 206 transitions. [2019-11-24 05:11:41,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:11:41,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-24 05:11:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:41,573 INFO L225 Difference]: With dead ends: 132 [2019-11-24 05:11:41,573 INFO L226 Difference]: Without dead ends: 112 [2019-11-24 05:11:41,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:11:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-24 05:11:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-11-24 05:11:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-24 05:11:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 180 transitions. [2019-11-24 05:11:41,589 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 180 transitions. Word has length 15 [2019-11-24 05:11:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:41,589 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 180 transitions. [2019-11-24 05:11:41,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:11:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 180 transitions. [2019-11-24 05:11:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 05:11:41,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:41,591 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:41,591 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:41,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:41,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1395471386, now seen corresponding path program 1 times [2019-11-24 05:11:41,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:41,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710543886] [2019-11-24 05:11:41,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:11:41,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710543886] [2019-11-24 05:11:41,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:41,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:41,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171495564] [2019-11-24 05:11:41,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:41,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:41,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:41,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:41,653 INFO L87 Difference]: Start difference. First operand 108 states and 180 transitions. Second operand 3 states. [2019-11-24 05:11:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:41,678 INFO L93 Difference]: Finished difference Result 313 states and 526 transitions. [2019-11-24 05:11:41,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:41,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 05:11:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:41,680 INFO L225 Difference]: With dead ends: 313 [2019-11-24 05:11:41,680 INFO L226 Difference]: Without dead ends: 209 [2019-11-24 05:11:41,682 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-24 05:11:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-24 05:11:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 177. [2019-11-24 05:11:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-24 05:11:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 312 transitions. [2019-11-24 05:11:41,705 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 312 transitions. Word has length 16 [2019-11-24 05:11:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:41,705 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 312 transitions. [2019-11-24 05:11:41,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 312 transitions. [2019-11-24 05:11:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 05:11:41,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:41,707 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:41,707 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:41,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2135000365, now seen corresponding path program 1 times [2019-11-24 05:11:41,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:41,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492414956] [2019-11-24 05:11:41,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:11:41,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492414956] [2019-11-24 05:11:41,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:41,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:11:41,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284394324] [2019-11-24 05:11:41,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:11:41,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:41,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:11:41,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:11:41,932 INFO L87 Difference]: Start difference. First operand 177 states and 312 transitions. Second operand 7 states. [2019-11-24 05:11:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:42,793 INFO L93 Difference]: Finished difference Result 260 states and 443 transitions. [2019-11-24 05:11:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:11:42,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-24 05:11:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:42,796 INFO L225 Difference]: With dead ends: 260 [2019-11-24 05:11:42,797 INFO L226 Difference]: Without dead ends: 239 [2019-11-24 05:11:42,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:11:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-24 05:11:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2019-11-24 05:11:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-24 05:11:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 417 transitions. [2019-11-24 05:11:42,841 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 417 transitions. Word has length 17 [2019-11-24 05:11:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:42,842 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 417 transitions. [2019-11-24 05:11:42,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:11:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 417 transitions. [2019-11-24 05:11:42,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:11:42,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:42,848 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:42,848 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:42,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:42,851 INFO L82 PathProgramCache]: Analyzing trace with hash 815811210, now seen corresponding path program 1 times [2019-11-24 05:11:42,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:42,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380698468] [2019-11-24 05:11:42,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:11:43,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380698468] [2019-11-24 05:11:43,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:43,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:43,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378102374] [2019-11-24 05:11:43,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:11:43,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:43,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:11:43,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:11:43,023 INFO L87 Difference]: Start difference. First operand 237 states and 417 transitions. Second operand 4 states. [2019-11-24 05:11:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:43,121 INFO L93 Difference]: Finished difference Result 290 states and 473 transitions. [2019-11-24 05:11:43,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:11:43,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 05:11:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:43,125 INFO L225 Difference]: With dead ends: 290 [2019-11-24 05:11:43,125 INFO L226 Difference]: Without dead ends: 249 [2019-11-24 05:11:43,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:11:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-24 05:11:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 190. [2019-11-24 05:11:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-24 05:11:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 322 transitions. [2019-11-24 05:11:43,154 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 322 transitions. Word has length 18 [2019-11-24 05:11:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:43,155 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 322 transitions. [2019-11-24 05:11:43,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:11:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 322 transitions. [2019-11-24 05:11:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:11:43,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:43,160 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:43,160 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:43,161 INFO L82 PathProgramCache]: Analyzing trace with hash 816895765, now seen corresponding path program 1 times [2019-11-24 05:11:43,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:43,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936153024] [2019-11-24 05:11:43,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:11:43,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936153024] [2019-11-24 05:11:43,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:43,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:11:43,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265242793] [2019-11-24 05:11:43,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:11:43,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:43,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:11:43,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:11:43,449 INFO L87 Difference]: Start difference. First operand 190 states and 322 transitions. Second operand 5 states. [2019-11-24 05:11:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:43,656 INFO L93 Difference]: Finished difference Result 378 states and 642 transitions. [2019-11-24 05:11:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:11:43,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 05:11:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:43,660 INFO L225 Difference]: With dead ends: 378 [2019-11-24 05:11:43,660 INFO L226 Difference]: Without dead ends: 340 [2019-11-24 05:11:43,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:11:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-24 05:11:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 336. [2019-11-24 05:11:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-24 05:11:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 588 transitions. [2019-11-24 05:11:43,692 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 588 transitions. Word has length 18 [2019-11-24 05:11:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:43,692 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 588 transitions. [2019-11-24 05:11:43,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:11:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 588 transitions. [2019-11-24 05:11:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 05:11:43,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:43,694 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:11:43,694 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1024529234, now seen corresponding path program 1 times [2019-11-24 05:11:43,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:43,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731537967] [2019-11-24 05:11:43,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:11:43,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731537967] [2019-11-24 05:11:43,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:43,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:43,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189504107] [2019-11-24 05:11:43,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:43,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:43,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:43,792 INFO L87 Difference]: Start difference. First operand 336 states and 588 transitions. Second operand 3 states. [2019-11-24 05:11:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:43,857 INFO L93 Difference]: Finished difference Result 992 states and 1736 transitions. [2019-11-24 05:11:43,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:43,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 05:11:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:43,862 INFO L225 Difference]: With dead ends: 992 [2019-11-24 05:11:43,862 INFO L226 Difference]: Without dead ends: 658 [2019-11-24 05:11:43,864 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-24 05:11:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-11-24 05:11:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 606. [2019-11-24 05:11:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-11-24 05:11:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1083 transitions. [2019-11-24 05:11:43,936 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1083 transitions. Word has length 26 [2019-11-24 05:11:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:43,937 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1083 transitions. [2019-11-24 05:11:43,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1083 transitions. [2019-11-24 05:11:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 05:11:43,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:43,939 INFO L410 BasicCegarLoop]: trace histogram [3, 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-24 05:11:43,940 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:43,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:43,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1853661255, now seen corresponding path program 1 times [2019-11-24 05:11:43,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:43,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480589786] [2019-11-24 05:11:43,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:11:44,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480589786] [2019-11-24 05:11:44,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:44,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:44,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925659517] [2019-11-24 05:11:44,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:44,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:44,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:44,031 INFO L87 Difference]: Start difference. First operand 606 states and 1083 transitions. Second operand 3 states. [2019-11-24 05:11:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:44,874 INFO L93 Difference]: Finished difference Result 1790 states and 3197 transitions. [2019-11-24 05:11:44,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:44,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 05:11:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:44,882 INFO L225 Difference]: With dead ends: 1790 [2019-11-24 05:11:44,882 INFO L226 Difference]: Without dead ends: 1186 [2019-11-24 05:11:44,884 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-24 05:11:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-24 05:11:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1134. [2019-11-24 05:11:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-11-24 05:11:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 2037 transitions. [2019-11-24 05:11:44,979 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 2037 transitions. Word has length 27 [2019-11-24 05:11:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:44,979 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 2037 transitions. [2019-11-24 05:11:44,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 2037 transitions. [2019-11-24 05:11:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 05:11:44,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:44,982 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:11:44,982 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:44,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:44,982 INFO L82 PathProgramCache]: Analyzing trace with hash 520174420, now seen corresponding path program 1 times [2019-11-24 05:11:44,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:44,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473009926] [2019-11-24 05:11:44,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:11:45,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473009926] [2019-11-24 05:11:45,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:45,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:45,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127893998] [2019-11-24 05:11:45,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:45,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:45,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:45,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:45,046 INFO L87 Difference]: Start difference. First operand 1134 states and 2037 transitions. Second operand 3 states. [2019-11-24 05:11:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:45,201 INFO L93 Difference]: Finished difference Result 2994 states and 5386 transitions. [2019-11-24 05:11:45,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:45,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 05:11:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:45,213 INFO L225 Difference]: With dead ends: 2994 [2019-11-24 05:11:45,213 INFO L226 Difference]: Without dead ends: 1862 [2019-11-24 05:11:45,216 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-24 05:11:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-11-24 05:11:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1822. [2019-11-24 05:11:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2019-11-24 05:11:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 3261 transitions. [2019-11-24 05:11:45,410 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 3261 transitions. Word has length 28 [2019-11-24 05:11:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:45,411 INFO L462 AbstractCegarLoop]: Abstraction has 1822 states and 3261 transitions. [2019-11-24 05:11:45,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3261 transitions. [2019-11-24 05:11:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:11:45,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:45,414 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:11:45,414 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash 509951576, now seen corresponding path program 1 times [2019-11-24 05:11:45,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:45,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815046810] [2019-11-24 05:11:45,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:11:45,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815046810] [2019-11-24 05:11:45,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:45,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:45,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040597006] [2019-11-24 05:11:45,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:45,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:45,535 INFO L87 Difference]: Start difference. First operand 1822 states and 3261 transitions. Second operand 3 states. [2019-11-24 05:11:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:45,818 INFO L93 Difference]: Finished difference Result 5026 states and 9010 transitions. [2019-11-24 05:11:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:45,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 05:11:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:45,836 INFO L225 Difference]: With dead ends: 5026 [2019-11-24 05:11:45,837 INFO L226 Difference]: Without dead ends: 3206 [2019-11-24 05:11:45,841 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-24 05:11:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2019-11-24 05:11:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 3166. [2019-11-24 05:11:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3166 states. [2019-11-24 05:11:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 5629 transitions. [2019-11-24 05:11:46,131 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 5629 transitions. Word has length 29 [2019-11-24 05:11:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:46,131 INFO L462 AbstractCegarLoop]: Abstraction has 3166 states and 5629 transitions. [2019-11-24 05:11:46,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 5629 transitions. [2019-11-24 05:11:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 05:11:46,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:46,134 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:11:46,134 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:46,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1424637691, now seen corresponding path program 1 times [2019-11-24 05:11:46,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:46,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390277663] [2019-11-24 05:11:46,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 05:11:46,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390277663] [2019-11-24 05:11:46,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:11:46,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:11:46,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000607549] [2019-11-24 05:11:46,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:11:46,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:11:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:11:46,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:11:46,257 INFO L87 Difference]: Start difference. First operand 3166 states and 5629 transitions. Second operand 3 states. [2019-11-24 05:11:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:11:46,609 INFO L93 Difference]: Finished difference Result 7864 states and 14005 transitions. [2019-11-24 05:11:46,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:11:46,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-24 05:11:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:11:46,635 INFO L225 Difference]: With dead ends: 7864 [2019-11-24 05:11:46,635 INFO L226 Difference]: Without dead ends: 4700 [2019-11-24 05:11:46,642 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-24 05:11:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4700 states. [2019-11-24 05:11:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4700 to 4654. [2019-11-24 05:11:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4654 states. [2019-11-24 05:11:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 8185 transitions. [2019-11-24 05:11:47,001 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 8185 transitions. Word has length 30 [2019-11-24 05:11:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:11:47,001 INFO L462 AbstractCegarLoop]: Abstraction has 4654 states and 8185 transitions. [2019-11-24 05:11:47,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:11:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 8185 transitions. [2019-11-24 05:11:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 05:11:47,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:11:47,004 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:11:47,005 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:11:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:11:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash 803095573, now seen corresponding path program 1 times [2019-11-24 05:11:47,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:11:47,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883306631] [2019-11-24 05:11:47,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:11:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:11:47,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883306631] [2019-11-24 05:11:47,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489208949] [2019-11-24 05:11:47,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:11:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:11:47,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 05:11:47,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:11:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:11:47,700 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:11:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:11:47,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1001874552] [2019-11-24 05:11:47,764 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-24 05:11:47,764 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:11:47,771 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:11:47,778 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:11:47,779 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:12:56,617 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 712