/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:42:29,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:42:29,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:42:29,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:42:29,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:42:29,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:42:29,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:42:29,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:42:29,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:42:29,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:42:29,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:42:29,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:42:29,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:42:29,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:42:29,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:42:29,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:42:29,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:42:29,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:42:29,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:42:29,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:42:29,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:42:29,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:42:29,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:42:29,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:42:29,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:42:29,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:42:29,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:42:29,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:42:29,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:42:29,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:42:29,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:42:29,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:42:29,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:42:29,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:42:29,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:42:29,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:42:29,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:42:29,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:42:29,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:42:29,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:42:29,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:42:29,894 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:42:29,916 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:42:29,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:42:29,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:42:29,918 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:42:29,918 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:42:29,918 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:42:29,918 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:42:29,919 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:42:29,919 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:42:29,919 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:42:29,920 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:42:29,920 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:42:29,921 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:42:29,921 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:42:29,921 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:42:29,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:42:29,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:42:29,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:42:29,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:42:29,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:42:29,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:42:29,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:42:29,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:42:29,925 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:42:29,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:42:29,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:42:29,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:42:29,926 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:42:29,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:42:29,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:42:29,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:42:29,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:42:29,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:42:29,928 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:42:29,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:42:29,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:42:29,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:42:29,929 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:42:30,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:42:30,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:42:30,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:42:30,240 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:42:30,240 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:42:30,241 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product29.cil.c [2019-11-24 04:42:30,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6f2b12a/35509fb901ec45848174a3eab85caaca/FLAGd20212a16 [2019-11-24 04:42:30,970 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:42:30,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product29.cil.c [2019-11-24 04:42:31,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6f2b12a/35509fb901ec45848174a3eab85caaca/FLAGd20212a16 [2019-11-24 04:42:31,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6f2b12a/35509fb901ec45848174a3eab85caaca [2019-11-24 04:42:31,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:42:31,150 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:42:31,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:42:31,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:42:31,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:42:31,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:42:31" (1/1) ... [2019-11-24 04:42:31,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7f376d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:31, skipping insertion in model container [2019-11-24 04:42:31,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:42:31" (1/1) ... [2019-11-24 04:42:31,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:42:31,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:42:31,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:42:31,993 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:42:32,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:42:32,217 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:42:32,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:32 WrapperNode [2019-11-24 04:42:32,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:42:32,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:42:32,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:42:32,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:42:32,226 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:42:32" (1/1) ... [2019-11-24 04:42:32,259 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:42:32" (1/1) ... [2019-11-24 04:42:32,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:42:32,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:42:32,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:42:32,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:42:32,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:32" (1/1) ... [2019-11-24 04:42:32,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:32" (1/1) ... [2019-11-24 04:42:32,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:32" (1/1) ... [2019-11-24 04:42:32,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:32" (1/1) ... [2019-11-24 04:42:32,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:32" (1/1) ... [2019-11-24 04:42:32,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:32" (1/1) ... [2019-11-24 04:42:32,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:32" (1/1) ... [2019-11-24 04:42:32,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:42:32,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:42:32,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:42:32,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:42:32,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:32" (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:42:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:42:32,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:42:32,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:42:32,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:43:07,137 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:43:07,138 INFO L284 CfgBuilder]: Removed 821 assume(true) statements. [2019-11-24 04:43:07,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:43:07 BoogieIcfgContainer [2019-11-24 04:43:07,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:43:07,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:43:07,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:43:07,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:43:07,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:42:31" (1/3) ... [2019-11-24 04:43:07,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3d9b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:43:07, skipping insertion in model container [2019-11-24 04:43:07,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:32" (2/3) ... [2019-11-24 04:43:07,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3d9b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:43:07, skipping insertion in model container [2019-11-24 04:43:07,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:43:07" (3/3) ... [2019-11-24 04:43:07,149 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product29.cil.c [2019-11-24 04:43:07,157 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:43:07,166 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:43:07,178 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:43:07,218 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:43:07,219 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:43:07,219 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:43:07,219 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:43:07,219 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:43:07,219 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:43:07,220 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:43:07,220 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:43:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states. [2019-11-24 04:43:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:43:07,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:07,274 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:43:07,275 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:43:07,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:07,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1583394812, now seen corresponding path program 1 times [2019-11-24 04:43:07,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:07,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918314171] [2019-11-24 04:43:07,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:07,803 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:43:07,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918314171] [2019-11-24 04:43:07,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:07,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:43:07,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538856104] [2019-11-24 04:43:07,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:07,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:07,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:07,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:07,830 INFO L87 Difference]: Start difference. First operand 1233 states. Second operand 5 states. [2019-11-24 04:43:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:08,261 INFO L93 Difference]: Finished difference Result 3185 states and 6095 transitions. [2019-11-24 04:43:08,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:43:08,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:43:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:08,297 INFO L225 Difference]: With dead ends: 3185 [2019-11-24 04:43:08,297 INFO L226 Difference]: Without dead ends: 2261 [2019-11-24 04:43:08,305 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:43:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-11-24 04:43:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1406. [2019-11-24 04:43:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1406 states. [2019-11-24 04:43:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2701 transitions. [2019-11-24 04:43:08,464 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2701 transitions. Word has length 17 [2019-11-24 04:43:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:08,465 INFO L462 AbstractCegarLoop]: Abstraction has 1406 states and 2701 transitions. [2019-11-24 04:43:08,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:43:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2701 transitions. [2019-11-24 04:43:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:43:08,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:08,471 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:43:08,471 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:43:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:08,472 INFO L82 PathProgramCache]: Analyzing trace with hash -870325426, now seen corresponding path program 1 times [2019-11-24 04:43:08,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:08,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733042472] [2019-11-24 04:43:08,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:08,658 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:43:08,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733042472] [2019-11-24 04:43:08,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:08,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:43:08,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265628644] [2019-11-24 04:43:08,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:08,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:08,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:08,662 INFO L87 Difference]: Start difference. First operand 1406 states and 2701 transitions. Second operand 5 states. [2019-11-24 04:43:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:09,205 INFO L93 Difference]: Finished difference Result 2424 states and 4588 transitions. [2019-11-24 04:43:09,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:43:09,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:43:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:09,218 INFO L225 Difference]: With dead ends: 2424 [2019-11-24 04:43:09,219 INFO L226 Difference]: Without dead ends: 1785 [2019-11-24 04:43:09,221 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:43:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-11-24 04:43:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1416. [2019-11-24 04:43:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-11-24 04:43:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2711 transitions. [2019-11-24 04:43:09,276 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2711 transitions. Word has length 18 [2019-11-24 04:43:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:09,277 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2711 transitions. [2019-11-24 04:43:09,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:43:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2711 transitions. [2019-11-24 04:43:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:43:09,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:09,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:09,280 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:43:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash -139324724, now seen corresponding path program 1 times [2019-11-24 04:43:09,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:09,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613716714] [2019-11-24 04:43:09,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:09,408 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:43:09,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613716714] [2019-11-24 04:43:09,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:09,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:43:09,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959319914] [2019-11-24 04:43:09,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:09,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:09,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:09,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:09,411 INFO L87 Difference]: Start difference. First operand 1416 states and 2711 transitions. Second operand 3 states. [2019-11-24 04:43:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:10,277 INFO L93 Difference]: Finished difference Result 2408 states and 4586 transitions. [2019-11-24 04:43:10,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:10,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:43:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:10,287 INFO L225 Difference]: With dead ends: 2408 [2019-11-24 04:43:10,293 INFO L226 Difference]: Without dead ends: 1495 [2019-11-24 04:43:10,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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:43:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2019-11-24 04:43:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1467. [2019-11-24 04:43:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2019-11-24 04:43:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2690 transitions. [2019-11-24 04:43:10,363 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2690 transitions. Word has length 21 [2019-11-24 04:43:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:10,364 INFO L462 AbstractCegarLoop]: Abstraction has 1467 states and 2690 transitions. [2019-11-24 04:43:10,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2690 transitions. [2019-11-24 04:43:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:43:10,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:10,366 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:43:10,366 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:43:10,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1332509491, now seen corresponding path program 1 times [2019-11-24 04:43:10,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:10,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014691137] [2019-11-24 04:43:10,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:10,476 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:43:10,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014691137] [2019-11-24 04:43:10,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:10,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:10,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566510188] [2019-11-24 04:43:10,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:10,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:10,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:10,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:10,479 INFO L87 Difference]: Start difference. First operand 1467 states and 2690 transitions. Second operand 3 states. [2019-11-24 04:43:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:10,756 INFO L93 Difference]: Finished difference Result 2843 states and 5238 transitions. [2019-11-24 04:43:10,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:10,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:43:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:10,772 INFO L225 Difference]: With dead ends: 2843 [2019-11-24 04:43:10,773 INFO L226 Difference]: Without dead ends: 2123 [2019-11-24 04:43:10,775 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:43:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-11-24 04:43:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2049. [2019-11-24 04:43:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2019-11-24 04:43:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3745 transitions. [2019-11-24 04:43:10,868 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 3745 transitions. Word has length 23 [2019-11-24 04:43:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:10,869 INFO L462 AbstractCegarLoop]: Abstraction has 2049 states and 3745 transitions. [2019-11-24 04:43:10,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 3745 transitions. [2019-11-24 04:43:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:43:10,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:10,871 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] [2019-11-24 04:43:10,871 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:43:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:10,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1999592863, now seen corresponding path program 1 times [2019-11-24 04:43:10,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:10,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337846621] [2019-11-24 04:43:10,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:10,981 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:43:10,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337846621] [2019-11-24 04:43:10,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:10,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:10,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900822170] [2019-11-24 04:43:10,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:10,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:10,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:10,984 INFO L87 Difference]: Start difference. First operand 2049 states and 3745 transitions. Second operand 3 states. [2019-11-24 04:43:11,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:11,431 INFO L93 Difference]: Finished difference Result 4614 states and 8486 transitions. [2019-11-24 04:43:11,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:11,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:43:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:11,456 INFO L225 Difference]: With dead ends: 4614 [2019-11-24 04:43:11,456 INFO L226 Difference]: Without dead ends: 3426 [2019-11-24 04:43:11,459 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:43:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2019-11-24 04:43:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3202. [2019-11-24 04:43:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3202 states. [2019-11-24 04:43:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 5833 transitions. [2019-11-24 04:43:11,834 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 5833 transitions. Word has length 25 [2019-11-24 04:43:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:11,835 INFO L462 AbstractCegarLoop]: Abstraction has 3202 states and 5833 transitions. [2019-11-24 04:43:11,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:11,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 5833 transitions. [2019-11-24 04:43:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:43:11,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:11,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:11,837 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:43:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1677718916, now seen corresponding path program 1 times [2019-11-24 04:43:11,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:11,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142217701] [2019-11-24 04:43:11,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:11,918 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:43:11,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142217701] [2019-11-24 04:43:11,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:11,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:11,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881108040] [2019-11-24 04:43:11,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:11,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:11,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:11,920 INFO L87 Difference]: Start difference. First operand 3202 states and 5833 transitions. Second operand 3 states. [2019-11-24 04:43:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:12,256 INFO L93 Difference]: Finished difference Result 5962 states and 10882 transitions. [2019-11-24 04:43:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:12,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 04:43:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:12,279 INFO L225 Difference]: With dead ends: 5962 [2019-11-24 04:43:12,279 INFO L226 Difference]: Without dead ends: 3187 [2019-11-24 04:43:12,284 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:43:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2019-11-24 04:43:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3187. [2019-11-24 04:43:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3187 states. [2019-11-24 04:43:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 5792 transitions. [2019-11-24 04:43:12,443 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 5792 transitions. Word has length 27 [2019-11-24 04:43:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:12,444 INFO L462 AbstractCegarLoop]: Abstraction has 3187 states and 5792 transitions. [2019-11-24 04:43:12,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 5792 transitions. [2019-11-24 04:43:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:43:12,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:12,446 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:43:12,446 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:43:12,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:12,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1241315155, now seen corresponding path program 1 times [2019-11-24 04:43:12,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:12,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618655007] [2019-11-24 04:43:12,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:12,535 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:43:12,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618655007] [2019-11-24 04:43:12,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:12,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:12,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71696929] [2019-11-24 04:43:12,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:12,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:12,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:12,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:12,537 INFO L87 Difference]: Start difference. First operand 3187 states and 5792 transitions. Second operand 3 states. [2019-11-24 04:43:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:12,915 INFO L93 Difference]: Finished difference Result 7860 states and 14385 transitions. [2019-11-24 04:43:12,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:12,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 04:43:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:12,945 INFO L225 Difference]: With dead ends: 7860 [2019-11-24 04:43:12,945 INFO L226 Difference]: Without dead ends: 5742 [2019-11-24 04:43:12,950 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:43:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2019-11-24 04:43:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5442. [2019-11-24 04:43:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5442 states. [2019-11-24 04:43:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5442 states to 5442 states and 9860 transitions. [2019-11-24 04:43:13,185 INFO L78 Accepts]: Start accepts. Automaton has 5442 states and 9860 transitions. Word has length 28 [2019-11-24 04:43:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:13,186 INFO L462 AbstractCegarLoop]: Abstraction has 5442 states and 9860 transitions. [2019-11-24 04:43:13,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5442 states and 9860 transitions. [2019-11-24 04:43:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 04:43:13,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:13,188 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] [2019-11-24 04:43:13,188 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:43:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:13,189 INFO L82 PathProgramCache]: Analyzing trace with hash -173912752, now seen corresponding path program 1 times [2019-11-24 04:43:13,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:13,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417246467] [2019-11-24 04:43:13,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:13,296 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:43:13,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417246467] [2019-11-24 04:43:13,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:13,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:13,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298825880] [2019-11-24 04:43:13,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:13,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:13,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:13,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:13,299 INFO L87 Difference]: Start difference. First operand 5442 states and 9860 transitions. Second operand 3 states. [2019-11-24 04:43:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:13,653 INFO L93 Difference]: Finished difference Result 5442 states and 9860 transitions. [2019-11-24 04:43:13,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:13,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 04:43:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:13,679 INFO L225 Difference]: With dead ends: 5442 [2019-11-24 04:43:13,679 INFO L226 Difference]: Without dead ends: 5435 [2019-11-24 04:43:13,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5435 states. [2019-11-24 04:43:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5435 to 5435. [2019-11-24 04:43:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5435 states. [2019-11-24 04:43:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 9845 transitions. [2019-11-24 04:43:13,887 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 9845 transitions. Word has length 29 [2019-11-24 04:43:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:13,887 INFO L462 AbstractCegarLoop]: Abstraction has 5435 states and 9845 transitions. [2019-11-24 04:43:13,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 9845 transitions. [2019-11-24 04:43:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:43:13,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:13,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:13,890 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:43:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:13,890 INFO L82 PathProgramCache]: Analyzing trace with hash 756302440, now seen corresponding path program 1 times [2019-11-24 04:43:13,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:13,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427697851] [2019-11-24 04:43:13,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:14,089 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:43:14,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427697851] [2019-11-24 04:43:14,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:14,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:43:14,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6448850] [2019-11-24 04:43:14,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:43:14,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:43:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:43:14,092 INFO L87 Difference]: Start difference. First operand 5435 states and 9845 transitions. Second operand 4 states. [2019-11-24 04:43:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:15,441 INFO L93 Difference]: Finished difference Result 11079 states and 20122 transitions. [2019-11-24 04:43:15,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:43:15,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-24 04:43:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:15,457 INFO L225 Difference]: With dead ends: 11079 [2019-11-24 04:43:15,457 INFO L226 Difference]: Without dead ends: 5908 [2019-11-24 04:43:15,465 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:43:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5908 states. [2019-11-24 04:43:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5908 to 5435. [2019-11-24 04:43:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5435 states. [2019-11-24 04:43:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 9770 transitions. [2019-11-24 04:43:15,682 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 9770 transitions. Word has length 31 [2019-11-24 04:43:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:15,683 INFO L462 AbstractCegarLoop]: Abstraction has 5435 states and 9770 transitions. [2019-11-24 04:43:15,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:43:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 9770 transitions. [2019-11-24 04:43:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:43:15,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:15,687 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] [2019-11-24 04:43:15,687 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:43:15,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:15,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2105427873, now seen corresponding path program 1 times [2019-11-24 04:43:15,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:15,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026907410] [2019-11-24 04:43:15,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:15,938 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:43:15,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026907410] [2019-11-24 04:43:15,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:15,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:15,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643917462] [2019-11-24 04:43:15,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:15,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:15,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:15,943 INFO L87 Difference]: Start difference. First operand 5435 states and 9770 transitions. Second operand 3 states. [2019-11-24 04:43:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:17,006 INFO L93 Difference]: Finished difference Result 15133 states and 27252 transitions. [2019-11-24 04:43:17,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:17,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 04:43:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:17,034 INFO L225 Difference]: With dead ends: 15133 [2019-11-24 04:43:17,034 INFO L226 Difference]: Without dead ends: 9983 [2019-11-24 04:43:17,044 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:43:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2019-11-24 04:43:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 5390. [2019-11-24 04:43:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5390 states. [2019-11-24 04:43:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5390 states to 5390 states and 9650 transitions. [2019-11-24 04:43:17,295 INFO L78 Accepts]: Start accepts. Automaton has 5390 states and 9650 transitions. Word has length 36 [2019-11-24 04:43:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:17,295 INFO L462 AbstractCegarLoop]: Abstraction has 5390 states and 9650 transitions. [2019-11-24 04:43:17,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 5390 states and 9650 transitions. [2019-11-24 04:43:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:43:17,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:17,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:17,298 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:43:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash 921628061, now seen corresponding path program 1 times [2019-11-24 04:43:17,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:17,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960204390] [2019-11-24 04:43:17,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:17,508 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:43:17,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960204390] [2019-11-24 04:43:17,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:17,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:17,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361947563] [2019-11-24 04:43:17,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:17,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:17,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:17,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:17,511 INFO L87 Difference]: Start difference. First operand 5390 states and 9650 transitions. Second operand 3 states. [2019-11-24 04:43:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:18,671 INFO L93 Difference]: Finished difference Result 15028 states and 27002 transitions. [2019-11-24 04:43:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:18,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:43:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:18,696 INFO L225 Difference]: With dead ends: 15028 [2019-11-24 04:43:18,697 INFO L226 Difference]: Without dead ends: 9950 [2019-11-24 04:43:18,706 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:43:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9950 states. [2019-11-24 04:43:18,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9950 to 5360. [2019-11-24 04:43:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5360 states. [2019-11-24 04:43:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 9545 transitions. [2019-11-24 04:43:18,974 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 9545 transitions. Word has length 37 [2019-11-24 04:43:18,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:18,974 INFO L462 AbstractCegarLoop]: Abstraction has 5360 states and 9545 transitions. [2019-11-24 04:43:18,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 9545 transitions. [2019-11-24 04:43:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:43:18,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:18,978 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:43:18,978 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:43:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1876665800, now seen corresponding path program 1 times [2019-11-24 04:43:18,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:18,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227396669] [2019-11-24 04:43:18,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:19,187 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:43:19,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227396669] [2019-11-24 04:43:19,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:19,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:19,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454565043] [2019-11-24 04:43:19,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:19,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:19,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:19,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:19,190 INFO L87 Difference]: Start difference. First operand 5360 states and 9545 transitions. Second operand 3 states. [2019-11-24 04:43:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:20,210 INFO L93 Difference]: Finished difference Result 14948 states and 26777 transitions. [2019-11-24 04:43:20,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:20,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:43:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:20,231 INFO L225 Difference]: With dead ends: 14948 [2019-11-24 04:43:20,232 INFO L226 Difference]: Without dead ends: 9932 [2019-11-24 04:43:20,241 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:43:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9932 states. [2019-11-24 04:43:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9932 to 5345. [2019-11-24 04:43:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5345 states. [2019-11-24 04:43:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5345 states to 5345 states and 9455 transitions. [2019-11-24 04:43:22,108 INFO L78 Accepts]: Start accepts. Automaton has 5345 states and 9455 transitions. Word has length 39 [2019-11-24 04:43:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:22,108 INFO L462 AbstractCegarLoop]: Abstraction has 5345 states and 9455 transitions. [2019-11-24 04:43:22,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5345 states and 9455 transitions. [2019-11-24 04:43:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 04:43:22,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:22,110 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:43:22,111 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:43:22,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash 17341189, now seen corresponding path program 1 times [2019-11-24 04:43:22,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:22,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546607382] [2019-11-24 04:43:22,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:22,322 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:43:22,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546607382] [2019-11-24 04:43:22,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:22,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:22,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679676307] [2019-11-24 04:43:22,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:22,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:22,324 INFO L87 Difference]: Start difference. First operand 5345 states and 9455 transitions. Second operand 3 states. [2019-11-24 04:43:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:23,183 INFO L93 Difference]: Finished difference Result 10782 states and 19185 transitions. [2019-11-24 04:43:23,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:23,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 04:43:23,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:23,194 INFO L225 Difference]: With dead ends: 10782 [2019-11-24 04:43:23,195 INFO L226 Difference]: Without dead ends: 5818 [2019-11-24 04:43:23,203 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:43:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2019-11-24 04:43:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 5345. [2019-11-24 04:43:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5345 states. [2019-11-24 04:43:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5345 states to 5345 states and 9380 transitions. [2019-11-24 04:43:23,541 INFO L78 Accepts]: Start accepts. Automaton has 5345 states and 9380 transitions. Word has length 42 [2019-11-24 04:43:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:23,542 INFO L462 AbstractCegarLoop]: Abstraction has 5345 states and 9380 transitions. [2019-11-24 04:43:23,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 5345 states and 9380 transitions. [2019-11-24 04:43:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:43:23,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:23,548 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:43:23,549 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:43:23,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:23,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1179077887, now seen corresponding path program 1 times [2019-11-24 04:43:23,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:23,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806412142] [2019-11-24 04:43:23,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:23,872 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:43:23,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806412142] [2019-11-24 04:43:23,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:23,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:43:23,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064212026] [2019-11-24 04:43:23,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:23,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:23,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:23,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:23,874 INFO L87 Difference]: Start difference. First operand 5345 states and 9380 transitions. Second operand 5 states. [2019-11-24 04:43:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:26,091 INFO L93 Difference]: Finished difference Result 18066 states and 32463 transitions. [2019-11-24 04:43:26,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:43:26,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:43:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:26,107 INFO L225 Difference]: With dead ends: 18066 [2019-11-24 04:43:26,108 INFO L226 Difference]: Without dead ends: 12919 [2019-11-24 04:43:26,118 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:43:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12919 states. [2019-11-24 04:43:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12919 to 5049. [2019-11-24 04:43:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5049 states. [2019-11-24 04:43:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5049 states to 5049 states and 8936 transitions. [2019-11-24 04:43:26,446 INFO L78 Accepts]: Start accepts. Automaton has 5049 states and 8936 transitions. Word has length 45 [2019-11-24 04:43:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:26,446 INFO L462 AbstractCegarLoop]: Abstraction has 5049 states and 8936 transitions. [2019-11-24 04:43:26,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:43:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5049 states and 8936 transitions. [2019-11-24 04:43:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:43:26,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:26,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:26,449 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:43:26,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:26,449 INFO L82 PathProgramCache]: Analyzing trace with hash -879480005, now seen corresponding path program 1 times [2019-11-24 04:43:26,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:26,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523140368] [2019-11-24 04:43:26,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:26,710 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:43:26,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523140368] [2019-11-24 04:43:26,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:26,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:43:26,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609418202] [2019-11-24 04:43:26,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:26,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:26,712 INFO L87 Difference]: Start difference. First operand 5049 states and 8936 transitions. Second operand 5 states. [2019-11-24 04:43:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:27,166 INFO L93 Difference]: Finished difference Result 7287 states and 12508 transitions. [2019-11-24 04:43:27,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:43:27,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-24 04:43:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:27,174 INFO L225 Difference]: With dead ends: 7287 [2019-11-24 04:43:27,174 INFO L226 Difference]: Without dead ends: 7269 [2019-11-24 04:43:27,177 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:43:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2019-11-24 04:43:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 5063. [2019-11-24 04:43:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5063 states. [2019-11-24 04:43:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 8950 transitions. [2019-11-24 04:43:27,554 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 8950 transitions. Word has length 46 [2019-11-24 04:43:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:27,554 INFO L462 AbstractCegarLoop]: Abstraction has 5063 states and 8950 transitions. [2019-11-24 04:43:27,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:43:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 8950 transitions. [2019-11-24 04:43:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:43:27,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:27,557 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] [2019-11-24 04:43:27,557 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:43:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1875628748, now seen corresponding path program 1 times [2019-11-24 04:43:27,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:27,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23953210] [2019-11-24 04:43:27,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:27,803 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:43:27,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23953210] [2019-11-24 04:43:27,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:27,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:27,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154696800] [2019-11-24 04:43:27,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:43:27,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:27,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:43:27,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:43:27,811 INFO L87 Difference]: Start difference. First operand 5063 states and 8950 transitions. Second operand 3 states. [2019-11-24 04:43:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:28,347 INFO L93 Difference]: Finished difference Result 5085 states and 8973 transitions. [2019-11-24 04:43:28,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:43:28,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-24 04:43:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:28,356 INFO L225 Difference]: With dead ends: 5085 [2019-11-24 04:43:28,356 INFO L226 Difference]: Without dead ends: 5067 [2019-11-24 04:43:28,359 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:43:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2019-11-24 04:43:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5063. [2019-11-24 04:43:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5063 states. [2019-11-24 04:43:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 8936 transitions. [2019-11-24 04:43:28,718 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 8936 transitions. Word has length 47 [2019-11-24 04:43:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:28,719 INFO L462 AbstractCegarLoop]: Abstraction has 5063 states and 8936 transitions. [2019-11-24 04:43:28,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:43:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 8936 transitions. [2019-11-24 04:43:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:43:28,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:28,721 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:43:28,721 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:43:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash 445166369, now seen corresponding path program 1 times [2019-11-24 04:43:28,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:28,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619950735] [2019-11-24 04:43:28,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:29,454 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:43:29,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619950735] [2019-11-24 04:43:29,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:29,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:43:29,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409521039] [2019-11-24 04:43:29,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:43:29,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:29,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:43:29,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:43:29,457 INFO L87 Difference]: Start difference. First operand 5063 states and 8936 transitions. Second operand 21 states. [2019-11-24 04:43:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:32,434 INFO L93 Difference]: Finished difference Result 15696 states and 28194 transitions. [2019-11-24 04:43:32,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:43:32,435 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2019-11-24 04:43:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:32,447 INFO L225 Difference]: With dead ends: 15696 [2019-11-24 04:43:32,447 INFO L226 Difference]: Without dead ends: 10890 [2019-11-24 04:43:32,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:43:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-11-24 04:43:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 4805. [2019-11-24 04:43:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4805 states. [2019-11-24 04:43:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 8525 transitions. [2019-11-24 04:43:32,787 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 8525 transitions. Word has length 48 [2019-11-24 04:43:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:32,787 INFO L462 AbstractCegarLoop]: Abstraction has 4805 states and 8525 transitions. [2019-11-24 04:43:32,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:43:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 8525 transitions. [2019-11-24 04:43:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:43:32,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:32,790 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:43:32,790 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:43:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:32,791 INFO L82 PathProgramCache]: Analyzing trace with hash -660803150, now seen corresponding path program 1 times [2019-11-24 04:43:32,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:32,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751973621] [2019-11-24 04:43:32,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:33,052 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:43:33,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751973621] [2019-11-24 04:43:33,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:33,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:43:33,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245224094] [2019-11-24 04:43:33,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:43:33,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:33,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:43:33,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:43:33,055 INFO L87 Difference]: Start difference. First operand 4805 states and 8525 transitions. Second operand 4 states. [2019-11-24 04:43:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:35,018 INFO L93 Difference]: Finished difference Result 13449 states and 24098 transitions. [2019-11-24 04:43:35,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:43:35,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-24 04:43:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:35,028 INFO L225 Difference]: With dead ends: 13449 [2019-11-24 04:43:35,028 INFO L226 Difference]: Without dead ends: 8877 [2019-11-24 04:43:35,033 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:43:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2019-11-24 04:43:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 4626. [2019-11-24 04:43:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4626 states. [2019-11-24 04:43:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 8224 transitions. [2019-11-24 04:43:35,350 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 8224 transitions. Word has length 49 [2019-11-24 04:43:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:35,350 INFO L462 AbstractCegarLoop]: Abstraction has 4626 states and 8224 transitions. [2019-11-24 04:43:35,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:43:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 8224 transitions. [2019-11-24 04:43:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:43:35,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:35,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:35,353 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:43:35,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:35,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1691110134, now seen corresponding path program 1 times [2019-11-24 04:43:35,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:35,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188407246] [2019-11-24 04:43:35,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:36,175 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:43:36,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188407246] [2019-11-24 04:43:36,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:36,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:43:36,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471732673] [2019-11-24 04:43:36,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:43:36,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:36,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:43:36,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:43:36,178 INFO L87 Difference]: Start difference. First operand 4626 states and 8224 transitions. Second operand 21 states. [2019-11-24 04:43:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:39,253 INFO L93 Difference]: Finished difference Result 12902 states and 23219 transitions. [2019-11-24 04:43:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:43:39,254 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-11-24 04:43:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:39,262 INFO L225 Difference]: With dead ends: 12902 [2019-11-24 04:43:39,262 INFO L226 Difference]: Without dead ends: 8766 [2019-11-24 04:43:39,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-11-24 04:43:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8766 states. [2019-11-24 04:43:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8766 to 4876. [2019-11-24 04:43:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4876 states. [2019-11-24 04:43:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 8622 transitions. [2019-11-24 04:43:39,667 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 8622 transitions. Word has length 50 [2019-11-24 04:43:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:39,667 INFO L462 AbstractCegarLoop]: Abstraction has 4876 states and 8622 transitions. [2019-11-24 04:43:39,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:43:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 8622 transitions. [2019-11-24 04:43:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:43:39,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:39,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:39,670 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:43:39,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash -266038470, now seen corresponding path program 1 times [2019-11-24 04:43:39,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:39,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611548568] [2019-11-24 04:43:39,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:39,889 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:43:39,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611548568] [2019-11-24 04:43:39,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:39,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:43:39,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392330735] [2019-11-24 04:43:39,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:43:39,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:39,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:43:39,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:43:39,891 INFO L87 Difference]: Start difference. First operand 4876 states and 8622 transitions. Second operand 4 states. [2019-11-24 04:43:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:40,880 INFO L93 Difference]: Finished difference Result 12112 states and 21435 transitions. [2019-11-24 04:43:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:43:40,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-24 04:43:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:40,888 INFO L225 Difference]: With dead ends: 12112 [2019-11-24 04:43:40,888 INFO L226 Difference]: Without dead ends: 7483 [2019-11-24 04:43:40,894 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:43:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2019-11-24 04:43:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 4790. [2019-11-24 04:43:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2019-11-24 04:43:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 8491 transitions. [2019-11-24 04:43:41,311 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 8491 transitions. Word has length 51 [2019-11-24 04:43:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:41,311 INFO L462 AbstractCegarLoop]: Abstraction has 4790 states and 8491 transitions. [2019-11-24 04:43:41,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:43:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 8491 transitions. [2019-11-24 04:43:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 04:43:41,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:41,315 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:41,315 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:43:41,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2096802998, now seen corresponding path program 1 times [2019-11-24 04:43:41,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:41,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476395261] [2019-11-24 04:43:41,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:41,578 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:43:41,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476395261] [2019-11-24 04:43:41,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:41,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:43:41,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026596533] [2019-11-24 04:43:41,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:41,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:41,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:41,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:41,581 INFO L87 Difference]: Start difference. First operand 4790 states and 8491 transitions. Second operand 5 states.