/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/elevator_spec2_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:40:58,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:40:58,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:40:58,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:40:58,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:40:58,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:40:58,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:40:58,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:40:58,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:40:58,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:40:58,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:40:58,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:40:58,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:40:58,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:40:58,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:40:58,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:40:58,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:40:58,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:40:58,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:40:58,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:40:58,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:40:58,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:40:58,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:40:58,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:40:58,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:40:58,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:40:58,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:40:58,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:40:58,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:40:58,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:40:58,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:40:58,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:40:58,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:40:58,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:40:58,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:40:58,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:40:58,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:40:58,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:40:58,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:40:58,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:40:58,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:40:58,929 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 04:40:58,946 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:40:58,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:40:58,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:40:58,948 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:40:58,948 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:40:58,948 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:40:58,948 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:40:58,948 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:40:58,948 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:40:58,949 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:40:58,949 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:40:58,949 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:40:58,949 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:40:58,950 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:40:58,950 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:40:58,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:40:58,951 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:40:58,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:40:58,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:40:58,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:40:58,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:40:58,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:40:58,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:40:58,952 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:40:58,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:40:58,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:40:58,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:40:58,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:40:58,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:40:58,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:40:58,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:40:58,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:40:58,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:40:58,954 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:40:58,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:40:58,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:40:58,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:40:58,958 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:40:59,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:40:59,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:40:59,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:40:59,267 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:40:59,268 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:40:59,268 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product19.cil.c [2019-11-24 04:40:59,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3d3f6409/ce8a5b75f92147dcbef4c95c81b80804/FLAG0e426e26b [2019-11-24 04:41:00,054 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:41:00,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product19.cil.c [2019-11-24 04:41:00,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3d3f6409/ce8a5b75f92147dcbef4c95c81b80804/FLAG0e426e26b [2019-11-24 04:41:00,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3d3f6409/ce8a5b75f92147dcbef4c95c81b80804 [2019-11-24 04:41:00,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:41:00,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:41:00,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:41:00,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:41:00,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:41:00,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:41:00" (1/1) ... [2019-11-24 04:41:00,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a899d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:00, skipping insertion in model container [2019-11-24 04:41:00,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:41:00" (1/1) ... [2019-11-24 04:41:00,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:41:00,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:41:01,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:41:01,130 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:41:01,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:41:01,393 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:41:01,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01 WrapperNode [2019-11-24 04:41:01,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:41:01,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:41:01,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:41:01,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:41:01,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (1/1) ... [2019-11-24 04:41:01,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (1/1) ... [2019-11-24 04:41:01,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:41:01,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:41:01,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:41:01,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:41:01,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (1/1) ... [2019-11-24 04:41:01,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (1/1) ... [2019-11-24 04:41:01,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (1/1) ... [2019-11-24 04:41:01,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (1/1) ... [2019-11-24 04:41:01,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (1/1) ... [2019-11-24 04:41:01,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (1/1) ... [2019-11-24 04:41:01,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (1/1) ... [2019-11-24 04:41:02,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:41:02,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:41:02,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:41:02,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:41:02,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (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 04:41:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:41:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:41:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:41:02,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:41:32,840 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:41:32,841 INFO L284 CfgBuilder]: Removed 613 assume(true) statements. [2019-11-24 04:41:32,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:32 BoogieIcfgContainer [2019-11-24 04:41:32,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:41:32,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:41:32,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:41:32,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:41:32,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:41:00" (1/3) ... [2019-11-24 04:41:32,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d87af9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:32, skipping insertion in model container [2019-11-24 04:41:32,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:41:01" (2/3) ... [2019-11-24 04:41:32,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d87af9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:41:32, skipping insertion in model container [2019-11-24 04:41:32,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:41:32" (3/3) ... [2019-11-24 04:41:32,850 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product19.cil.c [2019-11-24 04:41:32,859 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:41:32,865 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:41:32,873 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:41:32,901 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:41:32,901 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:41:32,901 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:41:32,902 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:41:32,902 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:41:32,902 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:41:32,902 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:41:32,903 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:41:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-11-24 04:41:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:41:32,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:32,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:32,946 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash 14928637, now seen corresponding path program 1 times [2019-11-24 04:41:32,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:32,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360243872] [2019-11-24 04:41:32,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:33,383 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 04:41:33,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360243872] [2019-11-24 04:41:33,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:33,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:41:33,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448484753] [2019-11-24 04:41:33,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:41:33,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:33,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:41:33,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:41:33,408 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 2 states. [2019-11-24 04:41:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:33,512 INFO L93 Difference]: Finished difference Result 766 states and 1459 transitions. [2019-11-24 04:41:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:41:33,516 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:41:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:33,560 INFO L225 Difference]: With dead ends: 766 [2019-11-24 04:41:33,560 INFO L226 Difference]: Without dead ends: 747 [2019-11-24 04:41:33,567 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 04:41:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-24 04:41:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-11-24 04:41:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-24 04:41:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1429 transitions. [2019-11-24 04:41:33,669 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1429 transitions. Word has length 14 [2019-11-24 04:41:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:33,670 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1429 transitions. [2019-11-24 04:41:33,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:41:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1429 transitions. [2019-11-24 04:41:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:41:33,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:33,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:33,676 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:33,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash 448245234, now seen corresponding path program 1 times [2019-11-24 04:41:33,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:33,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64378770] [2019-11-24 04:41:33,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:33,899 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 04:41:33,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64378770] [2019-11-24 04:41:33,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:33,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:33,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002829091] [2019-11-24 04:41:33,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:33,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:33,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:33,905 INFO L87 Difference]: Start difference. First operand 747 states and 1429 transitions. Second operand 3 states. [2019-11-24 04:41:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:34,216 INFO L93 Difference]: Finished difference Result 1337 states and 2550 transitions. [2019-11-24 04:41:34,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:34,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:41:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:34,223 INFO L225 Difference]: With dead ends: 1337 [2019-11-24 04:41:34,223 INFO L226 Difference]: Without dead ends: 943 [2019-11-24 04:41:34,231 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 04:41:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-11-24 04:41:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 906. [2019-11-24 04:41:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-24 04:41:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1729 transitions. [2019-11-24 04:41:34,298 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1729 transitions. Word has length 15 [2019-11-24 04:41:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:34,298 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1729 transitions. [2019-11-24 04:41:34,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1729 transitions. [2019-11-24 04:41:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:41:34,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:34,310 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:34,311 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:34,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:34,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1556671026, now seen corresponding path program 1 times [2019-11-24 04:41:34,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:34,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258102062] [2019-11-24 04:41:34,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:34,492 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 04:41:34,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258102062] [2019-11-24 04:41:34,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:34,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:34,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485417583] [2019-11-24 04:41:34,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:34,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:34,496 INFO L87 Difference]: Start difference. First operand 906 states and 1729 transitions. Second operand 3 states. [2019-11-24 04:41:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:34,760 INFO L93 Difference]: Finished difference Result 1863 states and 3548 transitions. [2019-11-24 04:41:34,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:34,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:41:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:34,774 INFO L225 Difference]: With dead ends: 1863 [2019-11-24 04:41:34,783 INFO L226 Difference]: Without dead ends: 1327 [2019-11-24 04:41:34,787 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 04:41:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-11-24 04:41:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1214. [2019-11-24 04:41:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-11-24 04:41:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2311 transitions. [2019-11-24 04:41:34,834 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2311 transitions. Word has length 17 [2019-11-24 04:41:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:34,834 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2311 transitions. [2019-11-24 04:41:34,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2311 transitions. [2019-11-24 04:41:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:41:34,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:34,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:41:34,837 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1994617302, now seen corresponding path program 1 times [2019-11-24 04:41:34,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:34,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722569638] [2019-11-24 04:41:34,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:34,949 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 04:41:34,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722569638] [2019-11-24 04:41:34,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:34,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:34,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737013004] [2019-11-24 04:41:34,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:34,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:34,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:34,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:34,951 INFO L87 Difference]: Start difference. First operand 1214 states and 2311 transitions. Second operand 3 states. [2019-11-24 04:41:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:35,264 INFO L93 Difference]: Finished difference Result 2045 states and 3885 transitions. [2019-11-24 04:41:35,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:35,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:41:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:35,275 INFO L225 Difference]: With dead ends: 2045 [2019-11-24 04:41:35,275 INFO L226 Difference]: Without dead ends: 1204 [2019-11-24 04:41:35,278 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 04:41:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-11-24 04:41:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204. [2019-11-24 04:41:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-11-24 04:41:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 2285 transitions. [2019-11-24 04:41:35,334 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 2285 transitions. Word has length 19 [2019-11-24 04:41:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:35,335 INFO L462 AbstractCegarLoop]: Abstraction has 1204 states and 2285 transitions. [2019-11-24 04:41:35,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 2285 transitions. [2019-11-24 04:41:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:41:35,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:35,336 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] [2019-11-24 04:41:35,337 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:35,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash 820360355, now seen corresponding path program 1 times [2019-11-24 04:41:35,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:35,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004667537] [2019-11-24 04:41:35,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:35,448 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 04:41:35,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004667537] [2019-11-24 04:41:35,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:35,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:35,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532050212] [2019-11-24 04:41:35,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:35,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:35,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:35,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:35,450 INFO L87 Difference]: Start difference. First operand 1204 states and 2285 transitions. Second operand 3 states. [2019-11-24 04:41:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:35,781 INFO L93 Difference]: Finished difference Result 2758 states and 5223 transitions. [2019-11-24 04:41:35,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:35,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:41:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:35,796 INFO L225 Difference]: With dead ends: 2758 [2019-11-24 04:41:35,796 INFO L226 Difference]: Without dead ends: 1944 [2019-11-24 04:41:35,799 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 04:41:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2019-11-24 04:41:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1792. [2019-11-24 04:41:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-11-24 04:41:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 3386 transitions. [2019-11-24 04:41:35,896 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 3386 transitions. Word has length 20 [2019-11-24 04:41:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:35,897 INFO L462 AbstractCegarLoop]: Abstraction has 1792 states and 3386 transitions. [2019-11-24 04:41:35,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 3386 transitions. [2019-11-24 04:41:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:41:35,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:35,899 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] [2019-11-24 04:41:35,899 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:35,900 INFO L82 PathProgramCache]: Analyzing trace with hash -338614858, now seen corresponding path program 1 times [2019-11-24 04:41:35,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:35,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106196328] [2019-11-24 04:41:35,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:36,038 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 04:41:36,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106196328] [2019-11-24 04:41:36,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:36,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:36,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917561144] [2019-11-24 04:41:36,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:36,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:36,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:36,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:36,041 INFO L87 Difference]: Start difference. First operand 1792 states and 3386 transitions. Second operand 3 states. [2019-11-24 04:41:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:36,322 INFO L93 Difference]: Finished difference Result 1792 states and 3386 transitions. [2019-11-24 04:41:36,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:36,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:41:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:36,334 INFO L225 Difference]: With dead ends: 1792 [2019-11-24 04:41:36,334 INFO L226 Difference]: Without dead ends: 1785 [2019-11-24 04:41:36,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 04:41:36,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-11-24 04:41:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785. [2019-11-24 04:41:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-11-24 04:41:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 3374 transitions. [2019-11-24 04:41:36,404 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 3374 transitions. Word has length 21 [2019-11-24 04:41:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:36,405 INFO L462 AbstractCegarLoop]: Abstraction has 1785 states and 3374 transitions. [2019-11-24 04:41:36,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 3374 transitions. [2019-11-24 04:41:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:41:36,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:36,408 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] [2019-11-24 04:41:36,408 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:36,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:36,408 INFO L82 PathProgramCache]: Analyzing trace with hash 187757807, now seen corresponding path program 1 times [2019-11-24 04:41:36,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:36,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155805687] [2019-11-24 04:41:36,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:36,611 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 04:41:36,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155805687] [2019-11-24 04:41:36,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:36,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:36,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223578765] [2019-11-24 04:41:36,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:36,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:36,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:36,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:36,614 INFO L87 Difference]: Start difference. First operand 1785 states and 3374 transitions. Second operand 3 states. [2019-11-24 04:41:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:39,550 INFO L93 Difference]: Finished difference Result 4555 states and 8568 transitions. [2019-11-24 04:41:39,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:39,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 04:41:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:39,568 INFO L225 Difference]: With dead ends: 4555 [2019-11-24 04:41:39,568 INFO L226 Difference]: Without dead ends: 2959 [2019-11-24 04:41:39,572 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 04:41:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2019-11-24 04:41:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1745. [2019-11-24 04:41:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-11-24 04:41:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 3274 transitions. [2019-11-24 04:41:39,663 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 3274 transitions. Word has length 31 [2019-11-24 04:41:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:39,664 INFO L462 AbstractCegarLoop]: Abstraction has 1745 states and 3274 transitions. [2019-11-24 04:41:39,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3274 transitions. [2019-11-24 04:41:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:41:39,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:39,667 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] [2019-11-24 04:41:39,667 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2127173631, now seen corresponding path program 1 times [2019-11-24 04:41:39,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:39,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010118875] [2019-11-24 04:41:39,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:41:39,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010118875] [2019-11-24 04:41:39,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:39,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:39,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524737346] [2019-11-24 04:41:39,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:39,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:39,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:39,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:39,879 INFO L87 Difference]: Start difference. First operand 1745 states and 3274 transitions. Second operand 3 states. [2019-11-24 04:41:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:41,051 INFO L93 Difference]: Finished difference Result 4461 states and 8354 transitions. [2019-11-24 04:41:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:41,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 04:41:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:41,068 INFO L225 Difference]: With dead ends: 4461 [2019-11-24 04:41:41,068 INFO L226 Difference]: Without dead ends: 2927 [2019-11-24 04:41:41,072 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 04:41:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2019-11-24 04:41:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1715. [2019-11-24 04:41:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-11-24 04:41:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 3184 transitions. [2019-11-24 04:41:41,168 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 3184 transitions. Word has length 32 [2019-11-24 04:41:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:41,168 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 3184 transitions. [2019-11-24 04:41:41,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 3184 transitions. [2019-11-24 04:41:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:41:41,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:41,171 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] [2019-11-24 04:41:41,171 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:41,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:41,171 INFO L82 PathProgramCache]: Analyzing trace with hash 803899972, now seen corresponding path program 1 times [2019-11-24 04:41:41,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:41,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125319994] [2019-11-24 04:41:41,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:41,420 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 04:41:41,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125319994] [2019-11-24 04:41:41,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:41,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:41,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949221761] [2019-11-24 04:41:41,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:41,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:41,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:41,422 INFO L87 Difference]: Start difference. First operand 1715 states and 3184 transitions. Second operand 3 states. [2019-11-24 04:41:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:42,408 INFO L93 Difference]: Finished difference Result 4382 states and 8155 transitions. [2019-11-24 04:41:42,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:42,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:41:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:42,424 INFO L225 Difference]: With dead ends: 4382 [2019-11-24 04:41:42,424 INFO L226 Difference]: Without dead ends: 2905 [2019-11-24 04:41:42,428 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 04:41:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2019-11-24 04:41:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1695. [2019-11-24 04:41:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-11-24 04:41:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 3104 transitions. [2019-11-24 04:41:42,529 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 3104 transitions. Word has length 34 [2019-11-24 04:41:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:42,529 INFO L462 AbstractCegarLoop]: Abstraction has 1695 states and 3104 transitions. [2019-11-24 04:41:42,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3104 transitions. [2019-11-24 04:41:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:41:42,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:42,533 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] [2019-11-24 04:41:42,533 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash -72330403, now seen corresponding path program 1 times [2019-11-24 04:41:42,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:42,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486438934] [2019-11-24 04:41:42,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:42,926 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 04:41:42,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486438934] [2019-11-24 04:41:42,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:42,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:42,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491727497] [2019-11-24 04:41:42,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:42,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:42,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:42,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:42,928 INFO L87 Difference]: Start difference. First operand 1695 states and 3104 transitions. Second operand 3 states. [2019-11-24 04:41:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:43,963 INFO L93 Difference]: Finished difference Result 4318 states and 7971 transitions. [2019-11-24 04:41:43,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:43,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:41:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:43,985 INFO L225 Difference]: With dead ends: 4318 [2019-11-24 04:41:43,985 INFO L226 Difference]: Without dead ends: 2893 [2019-11-24 04:41:43,989 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 04:41:43,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2019-11-24 04:41:44,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1685. [2019-11-24 04:41:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-11-24 04:41:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 3034 transitions. [2019-11-24 04:41:44,108 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 3034 transitions. Word has length 37 [2019-11-24 04:41:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:44,109 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 3034 transitions. [2019-11-24 04:41:44,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 3034 transitions. [2019-11-24 04:41:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:41:44,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:44,112 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] [2019-11-24 04:41:44,112 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1331832807, now seen corresponding path program 1 times [2019-11-24 04:41:44,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:44,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739606841] [2019-11-24 04:41:44,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:44,346 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 04:41:44,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739606841] [2019-11-24 04:41:44,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:44,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:44,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867819547] [2019-11-24 04:41:44,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:41:44,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:44,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:41:44,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:41:44,349 INFO L87 Difference]: Start difference. First operand 1685 states and 3034 transitions. Second operand 3 states. [2019-11-24 04:41:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:45,136 INFO L93 Difference]: Finished difference Result 3208 states and 5816 transitions. [2019-11-24 04:41:45,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:41:45,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:41:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:45,146 INFO L225 Difference]: With dead ends: 3208 [2019-11-24 04:41:45,147 INFO L226 Difference]: Without dead ends: 1830 [2019-11-24 04:41:45,149 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 04:41:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-11-24 04:41:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1685. [2019-11-24 04:41:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-11-24 04:41:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2974 transitions. [2019-11-24 04:41:45,236 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2974 transitions. Word has length 41 [2019-11-24 04:41:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:45,237 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 2974 transitions. [2019-11-24 04:41:45,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:41:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2974 transitions. [2019-11-24 04:41:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:41:45,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:45,239 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] [2019-11-24 04:41:45,239 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:45,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1647644802, now seen corresponding path program 1 times [2019-11-24 04:41:45,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:45,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759280908] [2019-11-24 04:41:45,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:45,467 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 04:41:45,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759280908] [2019-11-24 04:41:45,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:45,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:41:45,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983270341] [2019-11-24 04:41:45,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:41:45,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:45,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:41:45,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:41:45,469 INFO L87 Difference]: Start difference. First operand 1685 states and 2974 transitions. Second operand 5 states. [2019-11-24 04:41:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:46,860 INFO L93 Difference]: Finished difference Result 6642 states and 12096 transitions. [2019-11-24 04:41:46,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:41:46,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:41:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:46,880 INFO L225 Difference]: With dead ends: 6642 [2019-11-24 04:41:46,880 INFO L226 Difference]: Without dead ends: 4972 [2019-11-24 04:41:46,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:41:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2019-11-24 04:41:47,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 2063. [2019-11-24 04:41:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2019-11-24 04:41:47,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3540 transitions. [2019-11-24 04:41:47,052 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 3540 transitions. Word has length 45 [2019-11-24 04:41:47,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:47,052 INFO L462 AbstractCegarLoop]: Abstraction has 2063 states and 3540 transitions. [2019-11-24 04:41:47,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:41:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 3540 transitions. [2019-11-24 04:41:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:41:47,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:47,054 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] [2019-11-24 04:41:47,055 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:47,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:47,055 INFO L82 PathProgramCache]: Analyzing trace with hash 945013973, now seen corresponding path program 1 times [2019-11-24 04:41:47,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:47,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350452706] [2019-11-24 04:41:47,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:47,855 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 04:41:47,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350452706] [2019-11-24 04:41:47,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:47,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:41:47,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002865112] [2019-11-24 04:41:47,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:41:47,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:47,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:41:47,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:41:47,858 INFO L87 Difference]: Start difference. First operand 2063 states and 3540 transitions. Second operand 22 states. [2019-11-24 04:41:50,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:50,722 INFO L93 Difference]: Finished difference Result 6200 states and 10854 transitions. [2019-11-24 04:41:50,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:50,723 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-11-24 04:41:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:50,732 INFO L225 Difference]: With dead ends: 6200 [2019-11-24 04:41:50,733 INFO L226 Difference]: Without dead ends: 4272 [2019-11-24 04:41:50,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2019-11-24 04:41:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 2022. [2019-11-24 04:41:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-11-24 04:41:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 3420 transitions. [2019-11-24 04:41:50,945 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 3420 transitions. Word has length 46 [2019-11-24 04:41:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:50,946 INFO L462 AbstractCegarLoop]: Abstraction has 2022 states and 3420 transitions. [2019-11-24 04:41:50,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:41:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 3420 transitions. [2019-11-24 04:41:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:41:50,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:50,949 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] [2019-11-24 04:41:50,949 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:50,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:50,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1581250909, now seen corresponding path program 1 times [2019-11-24 04:41:50,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:50,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546180192] [2019-11-24 04:41:50,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:51,215 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 04:41:51,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546180192] [2019-11-24 04:41:51,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:51,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:41:51,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312458202] [2019-11-24 04:41:51,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:41:51,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:51,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:41:51,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:41:51,218 INFO L87 Difference]: Start difference. First operand 2022 states and 3420 transitions. Second operand 4 states. [2019-11-24 04:41:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:52,248 INFO L93 Difference]: Finished difference Result 5533 states and 9451 transitions. [2019-11-24 04:41:52,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:41:52,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-24 04:41:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:52,258 INFO L225 Difference]: With dead ends: 5533 [2019-11-24 04:41:52,258 INFO L226 Difference]: Without dead ends: 3621 [2019-11-24 04:41:52,262 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 04:41:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2019-11-24 04:41:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 1918. [2019-11-24 04:41:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2019-11-24 04:41:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 3232 transitions. [2019-11-24 04:41:52,447 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 3232 transitions. Word has length 48 [2019-11-24 04:41:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:52,449 INFO L462 AbstractCegarLoop]: Abstraction has 1918 states and 3232 transitions. [2019-11-24 04:41:52,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:41:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 3232 transitions. [2019-11-24 04:41:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:41:52,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:52,451 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] [2019-11-24 04:41:52,451 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash 336204215, now seen corresponding path program 1 times [2019-11-24 04:41:52,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:52,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760122760] [2019-11-24 04:41:52,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:53,301 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 04:41:53,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760122760] [2019-11-24 04:41:53,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:53,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:41:53,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79169441] [2019-11-24 04:41:53,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:41:53,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:53,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:41:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:41:53,303 INFO L87 Difference]: Start difference. First operand 1918 states and 3232 transitions. Second operand 22 states. [2019-11-24 04:41:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:41:56,188 INFO L93 Difference]: Finished difference Result 6023 states and 10369 transitions. [2019-11-24 04:41:56,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:41:56,192 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2019-11-24 04:41:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:41:56,199 INFO L225 Difference]: With dead ends: 6023 [2019-11-24 04:41:56,199 INFO L226 Difference]: Without dead ends: 4306 [2019-11-24 04:41:56,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:41:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4306 states. [2019-11-24 04:41:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4306 to 2136. [2019-11-24 04:41:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2019-11-24 04:41:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 3516 transitions. [2019-11-24 04:41:56,458 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 3516 transitions. Word has length 49 [2019-11-24 04:41:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:41:56,458 INFO L462 AbstractCegarLoop]: Abstraction has 2136 states and 3516 transitions. [2019-11-24 04:41:56,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:41:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 3516 transitions. [2019-11-24 04:41:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:41:56,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:41:56,460 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] [2019-11-24 04:41:56,461 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:41:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:41:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash 970276064, now seen corresponding path program 1 times [2019-11-24 04:41:56,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:41:56,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432879886] [2019-11-24 04:41:56,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:41:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:41:57,375 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 04:41:57,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432879886] [2019-11-24 04:41:57,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:41:57,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:41:57,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422769703] [2019-11-24 04:41:57,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:41:57,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:41:57,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:41:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:41:57,378 INFO L87 Difference]: Start difference. First operand 2136 states and 3516 transitions. Second operand 22 states. [2019-11-24 04:42:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:00,476 INFO L93 Difference]: Finished difference Result 5987 states and 9951 transitions. [2019-11-24 04:42:00,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:42:00,477 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2019-11-24 04:42:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:00,481 INFO L225 Difference]: With dead ends: 5987 [2019-11-24 04:42:00,481 INFO L226 Difference]: Without dead ends: 4052 [2019-11-24 04:42:00,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:42:00,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2019-11-24 04:42:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 2476. [2019-11-24 04:42:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2019-11-24 04:42:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3985 transitions. [2019-11-24 04:42:00,768 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3985 transitions. Word has length 51 [2019-11-24 04:42:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:00,768 INFO L462 AbstractCegarLoop]: Abstraction has 2476 states and 3985 transitions. [2019-11-24 04:42:00,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:42:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3985 transitions. [2019-11-24 04:42:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 04:42:00,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:00,772 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:42:00,772 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:42:00,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1850998525, now seen corresponding path program 1 times [2019-11-24 04:42:00,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:00,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880341840] [2019-11-24 04:42:00,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:00,939 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 04:42:00,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880341840] [2019-11-24 04:42:00,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:00,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:42:00,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546322126] [2019-11-24 04:42:00,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:00,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:00,941 INFO L87 Difference]: Start difference. First operand 2476 states and 3985 transitions. Second operand 5 states. [2019-11-24 04:42:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:03,121 INFO L93 Difference]: Finished difference Result 8268 states and 13598 transitions. [2019-11-24 04:42:03,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:42:03,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-24 04:42:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:03,134 INFO L225 Difference]: With dead ends: 8268 [2019-11-24 04:42:03,134 INFO L226 Difference]: Without dead ends: 5997 [2019-11-24 04:42:03,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:42:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2019-11-24 04:42:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3674. [2019-11-24 04:42:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3674 states. [2019-11-24 04:42:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 5712 transitions. [2019-11-24 04:42:03,442 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 5712 transitions. Word has length 62 [2019-11-24 04:42:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:03,442 INFO L462 AbstractCegarLoop]: Abstraction has 3674 states and 5712 transitions. [2019-11-24 04:42:03,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:42:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 5712 transitions. [2019-11-24 04:42:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 04:42:03,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:03,446 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:42:03,446 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:42:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1036558272, now seen corresponding path program 1 times [2019-11-24 04:42:03,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:03,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107531672] [2019-11-24 04:42:03,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:03,588 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 04:42:03,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107531672] [2019-11-24 04:42:03,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:03,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:42:03,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375234980] [2019-11-24 04:42:03,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:03,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:03,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:03,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:03,590 INFO L87 Difference]: Start difference. First operand 3674 states and 5712 transitions. Second operand 5 states. [2019-11-24 04:42:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:05,943 INFO L93 Difference]: Finished difference Result 11323 states and 18244 transitions. [2019-11-24 04:42:05,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:42:05,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-24 04:42:05,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:05,951 INFO L225 Difference]: With dead ends: 11323 [2019-11-24 04:42:05,951 INFO L226 Difference]: Without dead ends: 7856 [2019-11-24 04:42:05,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:42:05,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7856 states. [2019-11-24 04:42:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7856 to 4624. [2019-11-24 04:42:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4624 states. [2019-11-24 04:42:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6951 transitions. [2019-11-24 04:42:06,338 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6951 transitions. Word has length 62 [2019-11-24 04:42:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:06,338 INFO L462 AbstractCegarLoop]: Abstraction has 4624 states and 6951 transitions. [2019-11-24 04:42:06,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:42:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6951 transitions. [2019-11-24 04:42:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 04:42:06,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:06,342 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:42:06,342 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:42:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1012088003, now seen corresponding path program 1 times [2019-11-24 04:42:06,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:06,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119380347] [2019-11-24 04:42:06,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:06,516 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 04:42:06,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119380347] [2019-11-24 04:42:06,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:06,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:42:06,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731645577] [2019-11-24 04:42:06,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:42:06,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:06,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:42:06,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:42:06,518 INFO L87 Difference]: Start difference. First operand 4624 states and 6951 transitions. Second operand 6 states. [2019-11-24 04:42:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:09,375 INFO L93 Difference]: Finished difference Result 12885 states and 20747 transitions. [2019-11-24 04:42:09,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-24 04:42:09,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-24 04:42:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:09,387 INFO L225 Difference]: With dead ends: 12885 [2019-11-24 04:42:09,387 INFO L226 Difference]: Without dead ends: 8472 [2019-11-24 04:42:09,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-24 04:42:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2019-11-24 04:42:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 3904. [2019-11-24 04:42:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3904 states. [2019-11-24 04:42:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 5828 transitions. [2019-11-24 04:42:10,083 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 5828 transitions. Word has length 63 [2019-11-24 04:42:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:10,084 INFO L462 AbstractCegarLoop]: Abstraction has 3904 states and 5828 transitions. [2019-11-24 04:42:10,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:42:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 5828 transitions. [2019-11-24 04:42:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 04:42:10,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:10,087 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:42:10,087 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:42:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1989649632, now seen corresponding path program 1 times [2019-11-24 04:42:10,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:10,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303402553] [2019-11-24 04:42:10,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:10,255 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 04:42:10,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303402553] [2019-11-24 04:42:10,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:10,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:42:10,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583539830] [2019-11-24 04:42:10,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:42:10,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:10,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:42:10,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:42:10,257 INFO L87 Difference]: Start difference. First operand 3904 states and 5828 transitions. Second operand 6 states. [2019-11-24 04:42:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:12,638 INFO L93 Difference]: Finished difference Result 9237 states and 14415 transitions. [2019-11-24 04:42:12,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:42:12,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-24 04:42:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:12,644 INFO L225 Difference]: With dead ends: 9237 [2019-11-24 04:42:12,644 INFO L226 Difference]: Without dead ends: 5458 [2019-11-24 04:42:12,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:42:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5458 states. [2019-11-24 04:42:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5458 to 3584. [2019-11-24 04:42:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2019-11-24 04:42:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 5428 transitions. [2019-11-24 04:42:13,089 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 5428 transitions. Word has length 63 [2019-11-24 04:42:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:13,089 INFO L462 AbstractCegarLoop]: Abstraction has 3584 states and 5428 transitions. [2019-11-24 04:42:13,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:42:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 5428 transitions. [2019-11-24 04:42:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 04:42:13,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:13,092 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:42:13,092 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:42:13,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:13,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1787828540, now seen corresponding path program 1 times [2019-11-24 04:42:13,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:13,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485712321] [2019-11-24 04:42:13,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:13,317 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 04:42:13,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485712321] [2019-11-24 04:42:13,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:13,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:42:13,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935365256] [2019-11-24 04:42:13,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:42:13,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:13,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:42:13,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:42:13,320 INFO L87 Difference]: Start difference. First operand 3584 states and 5428 transitions. Second operand 6 states.