/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_spec1_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:39:27,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:39:27,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:39:27,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:39:27,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:39:27,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:39:27,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:39:27,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:39:27,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:39:27,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:39:27,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:39:27,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:39:27,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:39:27,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:39:27,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:39:27,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:39:27,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:39:27,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:39:27,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:39:27,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:39:27,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:39:27,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:39:27,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:39:27,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:39:27,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:39:27,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:39:27,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:39:27,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:39:27,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:39:27,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:39:27,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:39:27,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:39:27,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:39:27,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:39:27,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:39:27,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:39:27,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:39:27,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:39:27,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:39:27,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:39:27,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:39:27,905 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:39:27,920 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:39:27,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:39:27,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:39:27,922 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:39:27,922 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:39:27,922 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:39:27,922 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:39:27,922 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:39:27,923 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:39:27,923 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:39:27,923 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:39:27,923 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:39:27,923 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:39:27,924 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:39:27,924 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:39:27,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:39:27,925 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:39:27,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:39:27,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:39:27,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:39:27,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:39:27,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:39:27,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:39:27,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:39:27,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:39:27,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:39:27,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:39:27,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:39:27,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:39:27,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:39:27,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:39:27,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:39:27,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:39:27,928 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:39:27,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:39:27,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:39:27,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:39:27,929 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:39:28,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:39:28,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:39:28,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:39:28,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:39:28,265 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:39:28,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product27.cil.c [2019-11-24 04:39:28,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606c19a83/00a5cdae0f15416cbaf60f707219cf94/FLAG3badef6ec [2019-11-24 04:39:28,996 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:39:28,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product27.cil.c [2019-11-24 04:39:29,027 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606c19a83/00a5cdae0f15416cbaf60f707219cf94/FLAG3badef6ec [2019-11-24 04:39:29,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606c19a83/00a5cdae0f15416cbaf60f707219cf94 [2019-11-24 04:39:29,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:39:29,181 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:39:29,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:39:29,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:39:29,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:39:29,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:39:29" (1/1) ... [2019-11-24 04:39:29,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc62c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:29, skipping insertion in model container [2019-11-24 04:39:29,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:39:29" (1/1) ... [2019-11-24 04:39:29,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:39:29,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:39:30,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:39:30,014 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:39:30,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:39:30,201 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:39:30,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:30 WrapperNode [2019-11-24 04:39:30,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:39:30,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:39:30,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:39:30,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:39:30,212 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:39:30" (1/1) ... [2019-11-24 04:39:30,245 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:39:30" (1/1) ... [2019-11-24 04:39:30,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:39:30,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:39:30,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:39:30,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:39:30,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:30" (1/1) ... [2019-11-24 04:39:30,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:30" (1/1) ... [2019-11-24 04:39:30,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:30" (1/1) ... [2019-11-24 04:39:30,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:30" (1/1) ... [2019-11-24 04:39:30,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:30" (1/1) ... [2019-11-24 04:39:30,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:30" (1/1) ... [2019-11-24 04:39:30,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:30" (1/1) ... [2019-11-24 04:39:30,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:39:30,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:39:30,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:39:30,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:39:30,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:30" (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:39:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:39:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:39:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:39:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:40:01,857 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:40:01,861 INFO L284 CfgBuilder]: Removed 649 assume(true) statements. [2019-11-24 04:40:01,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:40:01 BoogieIcfgContainer [2019-11-24 04:40:01,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:40:01,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:40:01,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:40:01,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:40:01,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:39:29" (1/3) ... [2019-11-24 04:40:01,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4465cb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:40:01, skipping insertion in model container [2019-11-24 04:40:01,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:39:30" (2/3) ... [2019-11-24 04:40:01,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4465cb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:40:01, skipping insertion in model container [2019-11-24 04:40:01,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:40:01" (3/3) ... [2019-11-24 04:40:01,876 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product27.cil.c [2019-11-24 04:40:01,885 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:40:01,894 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:40:01,905 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:40:01,937 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:40:01,937 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:40:01,937 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:40:01,938 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:40:01,938 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:40:01,938 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:40:01,938 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:40:01,939 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:40:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-11-24 04:40:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:40:01,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:01,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:01,979 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:40:01,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:01,985 INFO L82 PathProgramCache]: Analyzing trace with hash -410498614, now seen corresponding path program 1 times [2019-11-24 04:40:01,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:01,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3696949] [2019-11-24 04:40:01,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:02,530 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:40:02,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3696949] [2019-11-24 04:40:02,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:02,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:40:02,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850902424] [2019-11-24 04:40:02,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:40:02,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:02,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:40:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:40:02,555 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 2 states. [2019-11-24 04:40:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:02,627 INFO L93 Difference]: Finished difference Result 766 states and 1459 transitions. [2019-11-24 04:40:02,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:40:02,628 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:40:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:02,657 INFO L225 Difference]: With dead ends: 766 [2019-11-24 04:40:02,657 INFO L226 Difference]: Without dead ends: 747 [2019-11-24 04:40:02,661 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:40:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-24 04:40:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-11-24 04:40:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-24 04:40:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1429 transitions. [2019-11-24 04:40:02,762 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1429 transitions. Word has length 14 [2019-11-24 04:40:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:02,763 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1429 transitions. [2019-11-24 04:40:02,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:40:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1429 transitions. [2019-11-24 04:40:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:40:02,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:02,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:02,766 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:40:02,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:02,767 INFO L82 PathProgramCache]: Analyzing trace with hash 137111968, now seen corresponding path program 1 times [2019-11-24 04:40:02,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:02,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745883288] [2019-11-24 04:40:02,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:03,015 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:40:03,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745883288] [2019-11-24 04:40:03,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:03,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:03,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889867590] [2019-11-24 04:40:03,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:03,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:03,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:03,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:03,019 INFO L87 Difference]: Start difference. First operand 747 states and 1429 transitions. Second operand 5 states. [2019-11-24 04:40:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:03,643 INFO L93 Difference]: Finished difference Result 1613 states and 3033 transitions. [2019-11-24 04:40:03,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:40:03,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 04:40:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:03,655 INFO L225 Difference]: With dead ends: 1613 [2019-11-24 04:40:03,656 INFO L226 Difference]: Without dead ends: 1230 [2019-11-24 04:40:03,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-11-24 04:40:03,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 755. [2019-11-24 04:40:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-24 04:40:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1441 transitions. [2019-11-24 04:40:03,710 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1441 transitions. Word has length 15 [2019-11-24 04:40:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:03,710 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1441 transitions. [2019-11-24 04:40:03,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1441 transitions. [2019-11-24 04:40:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:40:03,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:03,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:03,720 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:40:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:03,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1280069990, now seen corresponding path program 1 times [2019-11-24 04:40:03,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:03,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088509612] [2019-11-24 04:40:03,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:03,853 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:40:03,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088509612] [2019-11-24 04:40:03,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:03,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:03,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940473120] [2019-11-24 04:40:03,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:03,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:03,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:03,858 INFO L87 Difference]: Start difference. First operand 755 states and 1441 transitions. Second operand 5 states. [2019-11-24 04:40:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:04,310 INFO L93 Difference]: Finished difference Result 1605 states and 3013 transitions. [2019-11-24 04:40:04,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:40:04,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-24 04:40:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:04,320 INFO L225 Difference]: With dead ends: 1605 [2019-11-24 04:40:04,325 INFO L226 Difference]: Without dead ends: 1218 [2019-11-24 04:40:04,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-11-24 04:40:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 761. [2019-11-24 04:40:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-24 04:40:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1451 transitions. [2019-11-24 04:40:04,358 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1451 transitions. Word has length 16 [2019-11-24 04:40:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:04,359 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1451 transitions. [2019-11-24 04:40:04,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1451 transitions. [2019-11-24 04:40:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:40:04,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:04,360 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:40:04,360 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:40:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1571008650, now seen corresponding path program 1 times [2019-11-24 04:40:04,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:04,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434890282] [2019-11-24 04:40:04,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:04,490 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:40:04,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434890282] [2019-11-24 04:40:04,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:04,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:04,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640381431] [2019-11-24 04:40:04,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:40:04,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:04,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:40:04,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:40:04,493 INFO L87 Difference]: Start difference. First operand 761 states and 1451 transitions. Second operand 4 states. [2019-11-24 04:40:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:04,579 INFO L93 Difference]: Finished difference Result 1160 states and 2207 transitions. [2019-11-24 04:40:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:04,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 04:40:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:04,585 INFO L225 Difference]: With dead ends: 1160 [2019-11-24 04:40:04,585 INFO L226 Difference]: Without dead ends: 755 [2019-11-24 04:40:04,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:40:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-24 04:40:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-24 04:40:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-24 04:40:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1439 transitions. [2019-11-24 04:40:04,615 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1439 transitions. Word has length 17 [2019-11-24 04:40:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:04,616 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1439 transitions. [2019-11-24 04:40:04,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:40:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1439 transitions. [2019-11-24 04:40:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:40:04,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:04,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:40:04,619 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:40:04,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:04,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1456609554, now seen corresponding path program 1 times [2019-11-24 04:40:04,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:04,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27831863] [2019-11-24 04:40:04,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:04,770 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:40:04,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27831863] [2019-11-24 04:40:04,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:04,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:04,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358222625] [2019-11-24 04:40:04,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:04,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:04,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:04,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:04,774 INFO L87 Difference]: Start difference. First operand 755 states and 1439 transitions. Second operand 5 states. [2019-11-24 04:40:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:04,977 INFO L93 Difference]: Finished difference Result 1153 states and 2179 transitions. [2019-11-24 04:40:04,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:04,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:40:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:04,985 INFO L225 Difference]: With dead ends: 1153 [2019-11-24 04:40:04,985 INFO L226 Difference]: Without dead ends: 1140 [2019-11-24 04:40:04,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:40:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-11-24 04:40:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 757. [2019-11-24 04:40:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-11-24 04:40:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1441 transitions. [2019-11-24 04:40:05,021 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1441 transitions. Word has length 18 [2019-11-24 04:40:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:05,021 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 1441 transitions. [2019-11-24 04:40:05,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1441 transitions. [2019-11-24 04:40:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:40:05,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:05,023 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:40:05,023 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:40:05,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:05,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1079440529, now seen corresponding path program 1 times [2019-11-24 04:40:05,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:05,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431601212] [2019-11-24 04:40:05,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:05,113 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:40:05,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431601212] [2019-11-24 04:40:05,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:05,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:05,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190941369] [2019-11-24 04:40:05,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:05,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:05,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:05,116 INFO L87 Difference]: Start difference. First operand 757 states and 1441 transitions. Second operand 3 states. [2019-11-24 04:40:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:05,166 INFO L93 Difference]: Finished difference Result 770 states and 1453 transitions. [2019-11-24 04:40:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:05,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:40:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:05,172 INFO L225 Difference]: With dead ends: 770 [2019-11-24 04:40:05,172 INFO L226 Difference]: Without dead ends: 757 [2019-11-24 04:40:05,173 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:40:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-11-24 04:40:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2019-11-24 04:40:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-11-24 04:40:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1440 transitions. [2019-11-24 04:40:05,207 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1440 transitions. Word has length 19 [2019-11-24 04:40:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:05,208 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 1440 transitions. [2019-11-24 04:40:05,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1440 transitions. [2019-11-24 04:40:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:40:05,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:05,210 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:40:05,210 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:40:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:05,211 INFO L82 PathProgramCache]: Analyzing trace with hash -16536659, now seen corresponding path program 1 times [2019-11-24 04:40:05,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:05,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857941987] [2019-11-24 04:40:05,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:05,351 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:40:05,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857941987] [2019-11-24 04:40:05,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:05,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:05,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005463420] [2019-11-24 04:40:05,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:05,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:05,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:05,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:05,354 INFO L87 Difference]: Start difference. First operand 757 states and 1440 transitions. Second operand 5 states. [2019-11-24 04:40:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:06,458 INFO L93 Difference]: Finished difference Result 2336 states and 4403 transitions. [2019-11-24 04:40:06,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:06,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-24 04:40:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:06,473 INFO L225 Difference]: With dead ends: 2336 [2019-11-24 04:40:06,473 INFO L226 Difference]: Without dead ends: 1815 [2019-11-24 04:40:06,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-11-24 04:40:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1314. [2019-11-24 04:40:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-24 04:40:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 2434 transitions. [2019-11-24 04:40:06,571 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 2434 transitions. Word has length 20 [2019-11-24 04:40:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:06,571 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 2434 transitions. [2019-11-24 04:40:06,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 2434 transitions. [2019-11-24 04:40:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:40:06,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:06,574 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:40:06,574 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:40:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1848774585, now seen corresponding path program 1 times [2019-11-24 04:40:06,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:06,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489876221] [2019-11-24 04:40:06,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:07,012 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:40:07,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489876221] [2019-11-24 04:40:07,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:07,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:40:07,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26673418] [2019-11-24 04:40:07,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:40:07,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:07,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:40:07,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:40:07,015 INFO L87 Difference]: Start difference. First operand 1314 states and 2434 transitions. Second operand 6 states. [2019-11-24 04:40:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:08,141 INFO L93 Difference]: Finished difference Result 2836 states and 5231 transitions. [2019-11-24 04:40:08,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:08,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-24 04:40:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:08,149 INFO L225 Difference]: With dead ends: 2836 [2019-11-24 04:40:08,149 INFO L226 Difference]: Without dead ends: 1327 [2019-11-24 04:40:08,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:40:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-11-24 04:40:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1314. [2019-11-24 04:40:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-24 04:40:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 2426 transitions. [2019-11-24 04:40:08,220 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 2426 transitions. Word has length 20 [2019-11-24 04:40:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:08,220 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 2426 transitions. [2019-11-24 04:40:08,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:40:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 2426 transitions. [2019-11-24 04:40:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:40:08,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:08,222 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] [2019-11-24 04:40:08,222 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:40:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash -505380397, now seen corresponding path program 1 times [2019-11-24 04:40:08,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:08,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444758222] [2019-11-24 04:40:08,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:08,342 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:40:08,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444758222] [2019-11-24 04:40:08,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:08,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:08,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077120776] [2019-11-24 04:40:08,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:08,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:08,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:08,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:08,346 INFO L87 Difference]: Start difference. First operand 1314 states and 2426 transitions. Second operand 5 states. [2019-11-24 04:40:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:08,639 INFO L93 Difference]: Finished difference Result 2952 states and 5408 transitions. [2019-11-24 04:40:08,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:40:08,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:40:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:08,655 INFO L225 Difference]: With dead ends: 2952 [2019-11-24 04:40:08,655 INFO L226 Difference]: Without dead ends: 2170 [2019-11-24 04:40:08,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:40:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2019-11-24 04:40:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1312. [2019-11-24 04:40:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2019-11-24 04:40:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2422 transitions. [2019-11-24 04:40:08,747 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2422 transitions. Word has length 23 [2019-11-24 04:40:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:08,749 INFO L462 AbstractCegarLoop]: Abstraction has 1312 states and 2422 transitions. [2019-11-24 04:40:08,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2422 transitions. [2019-11-24 04:40:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:40:08,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:08,751 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] [2019-11-24 04:40:08,751 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:40:08,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:08,751 INFO L82 PathProgramCache]: Analyzing trace with hash -811389024, now seen corresponding path program 1 times [2019-11-24 04:40:08,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:08,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342759169] [2019-11-24 04:40:08,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:08,859 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:40:08,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342759169] [2019-11-24 04:40:08,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:08,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:40:08,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734532478] [2019-11-24 04:40:08,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:08,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:08,862 INFO L87 Difference]: Start difference. First operand 1312 states and 2422 transitions. Second operand 5 states. [2019-11-24 04:40:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:09,147 INFO L93 Difference]: Finished difference Result 2704 states and 4936 transitions. [2019-11-24 04:40:09,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:09,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:40:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:09,161 INFO L225 Difference]: With dead ends: 2704 [2019-11-24 04:40:09,162 INFO L226 Difference]: Without dead ends: 1957 [2019-11-24 04:40:09,164 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:40:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-11-24 04:40:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1324. [2019-11-24 04:40:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-11-24 04:40:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2434 transitions. [2019-11-24 04:40:09,273 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2434 transitions. Word has length 23 [2019-11-24 04:40:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:09,273 INFO L462 AbstractCegarLoop]: Abstraction has 1324 states and 2434 transitions. [2019-11-24 04:40:09,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2434 transitions. [2019-11-24 04:40:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:40:09,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:09,276 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] [2019-11-24 04:40:09,276 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:40:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1491608630, now seen corresponding path program 1 times [2019-11-24 04:40:09,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:09,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856300315] [2019-11-24 04:40:09,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:09,577 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:40:09,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856300315] [2019-11-24 04:40:09,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:09,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:40:09,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241001217] [2019-11-24 04:40:09,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:40:09,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:09,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:40:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:40:09,579 INFO L87 Difference]: Start difference. First operand 1324 states and 2434 transitions. Second operand 6 states. [2019-11-24 04:40:10,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:10,570 INFO L93 Difference]: Finished difference Result 2435 states and 4421 transitions. [2019-11-24 04:40:10,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:10,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-24 04:40:10,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:10,584 INFO L225 Difference]: With dead ends: 2435 [2019-11-24 04:40:10,585 INFO L226 Difference]: Without dead ends: 1695 [2019-11-24 04:40:10,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:40:10,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-11-24 04:40:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1593. [2019-11-24 04:40:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2019-11-24 04:40:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2885 transitions. [2019-11-24 04:40:10,748 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2885 transitions. Word has length 28 [2019-11-24 04:40:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:10,750 INFO L462 AbstractCegarLoop]: Abstraction has 1593 states and 2885 transitions. [2019-11-24 04:40:10,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:40:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2885 transitions. [2019-11-24 04:40:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:40:10,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:10,756 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:40:10,756 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:40:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:10,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2012521871, now seen corresponding path program 1 times [2019-11-24 04:40:10,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:10,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364672173] [2019-11-24 04:40:10,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:10,992 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:40:10,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364672173] [2019-11-24 04:40:10,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:10,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:10,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126519676] [2019-11-24 04:40:10,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:40:10,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:10,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:40:10,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:40:10,994 INFO L87 Difference]: Start difference. First operand 1593 states and 2885 transitions. Second operand 4 states. [2019-11-24 04:40:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:12,105 INFO L93 Difference]: Finished difference Result 2785 states and 5077 transitions. [2019-11-24 04:40:12,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:40:12,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-24 04:40:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:12,116 INFO L225 Difference]: With dead ends: 2785 [2019-11-24 04:40:12,116 INFO L226 Difference]: Without dead ends: 1614 [2019-11-24 04:40:12,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:40:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2019-11-24 04:40:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1593. [2019-11-24 04:40:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2019-11-24 04:40:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2785 transitions. [2019-11-24 04:40:12,225 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2785 transitions. Word has length 34 [2019-11-24 04:40:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:12,225 INFO L462 AbstractCegarLoop]: Abstraction has 1593 states and 2785 transitions. [2019-11-24 04:40:12,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:40:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2785 transitions. [2019-11-24 04:40:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:40:12,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:12,228 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] [2019-11-24 04:40:12,228 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:40:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2125143524, now seen corresponding path program 1 times [2019-11-24 04:40:12,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:12,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957760603] [2019-11-24 04:40:12,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:12,428 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:40:12,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957760603] [2019-11-24 04:40:12,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:12,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:12,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674703620] [2019-11-24 04:40:12,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:12,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:12,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:12,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:12,433 INFO L87 Difference]: Start difference. First operand 1593 states and 2785 transitions. Second operand 3 states. [2019-11-24 04:40:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:13,348 INFO L93 Difference]: Finished difference Result 3059 states and 5313 transitions. [2019-11-24 04:40:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:13,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:40:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:13,357 INFO L225 Difference]: With dead ends: 3059 [2019-11-24 04:40:13,358 INFO L226 Difference]: Without dead ends: 1909 [2019-11-24 04:40:13,360 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:40:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2019-11-24 04:40:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1533. [2019-11-24 04:40:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2019-11-24 04:40:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2625 transitions. [2019-11-24 04:40:13,470 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2625 transitions. Word has length 39 [2019-11-24 04:40:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:13,471 INFO L462 AbstractCegarLoop]: Abstraction has 1533 states and 2625 transitions. [2019-11-24 04:40:13,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2625 transitions. [2019-11-24 04:40:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 04:40:13,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:13,473 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] [2019-11-24 04:40:13,474 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:40:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1033899637, now seen corresponding path program 1 times [2019-11-24 04:40:13,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:13,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59533588] [2019-11-24 04:40:13,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:13,733 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:40:13,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59533588] [2019-11-24 04:40:13,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:13,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:13,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641124381] [2019-11-24 04:40:13,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:13,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:13,735 INFO L87 Difference]: Start difference. First operand 1533 states and 2625 transitions. Second operand 3 states. [2019-11-24 04:40:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:14,809 INFO L93 Difference]: Finished difference Result 2928 states and 4992 transitions. [2019-11-24 04:40:14,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:14,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 04:40:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:14,821 INFO L225 Difference]: With dead ends: 2928 [2019-11-24 04:40:14,821 INFO L226 Difference]: Without dead ends: 1865 [2019-11-24 04:40:14,824 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:40:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2019-11-24 04:40:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1493. [2019-11-24 04:40:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2019-11-24 04:40:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2485 transitions. [2019-11-24 04:40:14,948 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2485 transitions. Word has length 40 [2019-11-24 04:40:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:14,948 INFO L462 AbstractCegarLoop]: Abstraction has 1493 states and 2485 transitions. [2019-11-24 04:40:14,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2485 transitions. [2019-11-24 04:40:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 04:40:14,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:14,951 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] [2019-11-24 04:40:14,951 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:40:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:14,951 INFO L82 PathProgramCache]: Analyzing trace with hash -376887216, now seen corresponding path program 1 times [2019-11-24 04:40:14,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:14,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671716212] [2019-11-24 04:40:14,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:15,223 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:40:15,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671716212] [2019-11-24 04:40:15,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:15,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:15,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605660328] [2019-11-24 04:40:15,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:15,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:15,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:15,226 INFO L87 Difference]: Start difference. First operand 1493 states and 2485 transitions. Second operand 3 states. [2019-11-24 04:40:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:16,132 INFO L93 Difference]: Finished difference Result 2832 states and 4706 transitions. [2019-11-24 04:40:16,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:16,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 04:40:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:16,141 INFO L225 Difference]: With dead ends: 2832 [2019-11-24 04:40:16,142 INFO L226 Difference]: Without dead ends: 1841 [2019-11-24 04:40:16,146 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:40:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2019-11-24 04:40:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1473. [2019-11-24 04:40:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-11-24 04:40:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2365 transitions. [2019-11-24 04:40:16,259 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2365 transitions. Word has length 42 [2019-11-24 04:40:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:16,259 INFO L462 AbstractCegarLoop]: Abstraction has 1473 states and 2365 transitions. [2019-11-24 04:40:16,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2365 transitions. [2019-11-24 04:40:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:40:16,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:16,261 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:40:16,261 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:40:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1666883968, now seen corresponding path program 1 times [2019-11-24 04:40:16,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:16,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396792369] [2019-11-24 04:40:16,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:16,519 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:40:16,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396792369] [2019-11-24 04:40:16,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:16,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:16,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765778465] [2019-11-24 04:40:16,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:40:16,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:16,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:40:16,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:40:16,525 INFO L87 Difference]: Start difference. First operand 1473 states and 2365 transitions. Second operand 3 states. [2019-11-24 04:40:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:17,346 INFO L93 Difference]: Finished difference Result 2428 states and 3880 transitions. [2019-11-24 04:40:17,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:40:17,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-24 04:40:17,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:17,357 INFO L225 Difference]: With dead ends: 2428 [2019-11-24 04:40:17,358 INFO L226 Difference]: Without dead ends: 1494 [2019-11-24 04:40:17,360 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:40:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-11-24 04:40:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1473. [2019-11-24 04:40:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-11-24 04:40:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2265 transitions. [2019-11-24 04:40:17,460 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2265 transitions. Word has length 45 [2019-11-24 04:40:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:17,460 INFO L462 AbstractCegarLoop]: Abstraction has 1473 states and 2265 transitions. [2019-11-24 04:40:17,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:40:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2265 transitions. [2019-11-24 04:40:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:40:17,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:17,462 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] [2019-11-24 04:40:17,462 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:40:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:17,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1508850160, now seen corresponding path program 1 times [2019-11-24 04:40:17,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:17,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586058842] [2019-11-24 04:40:17,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:17,587 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:40:17,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586058842] [2019-11-24 04:40:17,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:17,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:40:17,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204856526] [2019-11-24 04:40:17,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:40:17,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:17,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:40:17,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:40:17,591 INFO L87 Difference]: Start difference. First operand 1473 states and 2265 transitions. Second operand 6 states. [2019-11-24 04:40:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:18,142 INFO L93 Difference]: Finished difference Result 3165 states and 4936 transitions. [2019-11-24 04:40:18,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:18,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-24 04:40:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:18,148 INFO L225 Difference]: With dead ends: 3165 [2019-11-24 04:40:18,148 INFO L226 Difference]: Without dead ends: 2217 [2019-11-24 04:40:18,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:40:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2019-11-24 04:40:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1476. [2019-11-24 04:40:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-11-24 04:40:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2269 transitions. [2019-11-24 04:40:18,257 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2269 transitions. Word has length 47 [2019-11-24 04:40:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:18,258 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 2269 transitions. [2019-11-24 04:40:18,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:40:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2269 transitions. [2019-11-24 04:40:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:40:18,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:18,260 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] [2019-11-24 04:40:18,260 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:40:18,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1286700249, now seen corresponding path program 1 times [2019-11-24 04:40:18,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:18,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021134867] [2019-11-24 04:40:18,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:18,394 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:40:18,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021134867] [2019-11-24 04:40:18,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:18,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:40:18,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468063556] [2019-11-24 04:40:18,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:40:18,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:40:18,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:18,396 INFO L87 Difference]: Start difference. First operand 1476 states and 2269 transitions. Second operand 7 states. [2019-11-24 04:40:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:19,657 INFO L93 Difference]: Finished difference Result 3090 states and 4734 transitions. [2019-11-24 04:40:19,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 04:40:19,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-24 04:40:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:19,662 INFO L225 Difference]: With dead ends: 3090 [2019-11-24 04:40:19,662 INFO L226 Difference]: Without dead ends: 2139 [2019-11-24 04:40:19,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-24 04:40:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-11-24 04:40:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1916. [2019-11-24 04:40:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2019-11-24 04:40:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2873 transitions. [2019-11-24 04:40:19,786 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2873 transitions. Word has length 47 [2019-11-24 04:40:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:19,786 INFO L462 AbstractCegarLoop]: Abstraction has 1916 states and 2873 transitions. [2019-11-24 04:40:19,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:40:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2873 transitions. [2019-11-24 04:40:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:40:19,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:19,788 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] [2019-11-24 04:40:19,788 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:40:19,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash -187692674, now seen corresponding path program 1 times [2019-11-24 04:40:19,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:19,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854573123] [2019-11-24 04:40:19,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:19,906 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:40:19,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854573123] [2019-11-24 04:40:19,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:19,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:40:19,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348799226] [2019-11-24 04:40:19,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:40:19,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:19,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:40:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:40:19,908 INFO L87 Difference]: Start difference. First operand 1916 states and 2873 transitions. Second operand 7 states. [2019-11-24 04:40:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:21,315 INFO L93 Difference]: Finished difference Result 4710 states and 7063 transitions. [2019-11-24 04:40:21,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 04:40:21,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-24 04:40:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:21,322 INFO L225 Difference]: With dead ends: 4710 [2019-11-24 04:40:21,322 INFO L226 Difference]: Without dead ends: 3315 [2019-11-24 04:40:21,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-24 04:40:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2019-11-24 04:40:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 2304. [2019-11-24 04:40:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-11-24 04:40:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3431 transitions. [2019-11-24 04:40:21,489 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3431 transitions. Word has length 47 [2019-11-24 04:40:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:21,489 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 3431 transitions. [2019-11-24 04:40:21,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:40:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3431 transitions. [2019-11-24 04:40:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:40:21,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:21,490 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:40:21,490 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:40:21,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2018518578, now seen corresponding path program 1 times [2019-11-24 04:40:21,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:21,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678213601] [2019-11-24 04:40:21,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:21,751 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:40:21,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678213601] [2019-11-24 04:40:21,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:21,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:40:21,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420976345] [2019-11-24 04:40:21,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:40:21,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:21,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:40:21,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:40:21,753 INFO L87 Difference]: Start difference. First operand 2304 states and 3431 transitions. Second operand 5 states. [2019-11-24 04:40:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:23,132 INFO L93 Difference]: Finished difference Result 4813 states and 7184 transitions. [2019-11-24 04:40:23,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:40:23,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-24 04:40:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:23,139 INFO L225 Difference]: With dead ends: 4813 [2019-11-24 04:40:23,139 INFO L226 Difference]: Without dead ends: 3077 [2019-11-24 04:40:23,142 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:40:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2019-11-24 04:40:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2008. [2019-11-24 04:40:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2019-11-24 04:40:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 2987 transitions. [2019-11-24 04:40:23,376 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 2987 transitions. Word has length 48 [2019-11-24 04:40:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:23,376 INFO L462 AbstractCegarLoop]: Abstraction has 2008 states and 2987 transitions. [2019-11-24 04:40:23,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:40:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2987 transitions. [2019-11-24 04:40:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:40:23,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:23,377 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] [2019-11-24 04:40:23,377 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:40:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:23,378 INFO L82 PathProgramCache]: Analyzing trace with hash -701338159, now seen corresponding path program 1 times [2019-11-24 04:40:23,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:23,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979825459] [2019-11-24 04:40:23,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:23,492 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:40:23,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979825459] [2019-11-24 04:40:23,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:23,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:40:23,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197381652] [2019-11-24 04:40:23,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:40:23,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:23,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:40:23,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:40:23,494 INFO L87 Difference]: Start difference. First operand 2008 states and 2987 transitions. Second operand 8 states. [2019-11-24 04:40:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:24,088 INFO L93 Difference]: Finished difference Result 5992 states and 8844 transitions. [2019-11-24 04:40:24,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 04:40:24,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-24 04:40:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:24,101 INFO L225 Difference]: With dead ends: 5992 [2019-11-24 04:40:24,102 INFO L226 Difference]: Without dead ends: 4172 [2019-11-24 04:40:24,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-11-24 04:40:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2019-11-24 04:40:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 2020. [2019-11-24 04:40:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-11-24 04:40:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2981 transitions. [2019-11-24 04:40:24,325 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2981 transitions. Word has length 49 [2019-11-24 04:40:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:24,325 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 2981 transitions. [2019-11-24 04:40:24,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:40:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2981 transitions. [2019-11-24 04:40:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:40:24,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:24,327 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:40:24,327 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:40:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash 704041098, now seen corresponding path program 1 times [2019-11-24 04:40:24,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:24,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015493103] [2019-11-24 04:40:24,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:24,544 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:40:24,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015493103] [2019-11-24 04:40:24,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:40:24,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:40:24,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989525538] [2019-11-24 04:40:24,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:40:24,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:40:24,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:40:24,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:40:24,549 INFO L87 Difference]: Start difference. First operand 2020 states and 2981 transitions. Second operand 4 states. [2019-11-24 04:40:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:40:25,558 INFO L93 Difference]: Finished difference Result 5662 states and 8346 transitions. [2019-11-24 04:40:25,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:40:25,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-24 04:40:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:40:25,566 INFO L225 Difference]: With dead ends: 5662 [2019-11-24 04:40:25,567 INFO L226 Difference]: Without dead ends: 3734 [2019-11-24 04:40:25,571 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:40:25,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2019-11-24 04:40:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 2026. [2019-11-24 04:40:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2019-11-24 04:40:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2964 transitions. [2019-11-24 04:40:25,867 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2964 transitions. Word has length 49 [2019-11-24 04:40:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:40:25,867 INFO L462 AbstractCegarLoop]: Abstraction has 2026 states and 2964 transitions. [2019-11-24 04:40:25,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:40:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2964 transitions. [2019-11-24 04:40:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:40:25,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:40:25,869 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] [2019-11-24 04:40:25,869 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:40:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:40:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1114951805, now seen corresponding path program 1 times [2019-11-24 04:40:25,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:40:25,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771250721] [2019-11-24 04:40:25,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:40:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:25,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771250721] [2019-11-24 04:40:25,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705170353] [2019-11-24 04:40:25,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:40:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:40:26,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:40:26,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:40:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:26,539 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:40:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:40:26,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1256952845] [2019-11-24 04:40:26,618 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2019-11-24 04:40:26,619 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:40:26,625 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:40:26,631 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:40:26,632 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs