/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_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:42:01,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:42:01,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:42:01,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:42:01,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:42:01,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:42:01,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:42:01,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:42:01,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:42:01,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:42:01,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:42:02,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:42:02,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:42:02,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:42:02,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:42:02,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:42:02,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:42:02,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:42:02,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:42:02,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:42:02,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:42:02,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:42:02,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:42:02,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:42:02,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:42:02,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:42:02,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:42:02,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:42:02,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:42:02,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:42:02,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:42:02,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:42:02,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:42:02,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:42:02,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:42:02,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:42:02,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:42:02,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:42:02,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:42:02,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:42:02,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:42:02,035 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:02,049 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:42:02,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:42:02,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:42:02,051 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:42:02,051 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:42:02,051 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:42:02,051 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:42:02,051 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:42:02,052 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:42:02,052 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:42:02,052 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:42:02,052 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:42:02,052 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:42:02,052 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:42:02,053 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:42:02,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:42:02,053 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:42:02,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:42:02,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:42:02,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:42:02,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:42:02,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:42:02,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:42:02,055 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:42:02,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:42:02,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:42:02,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:42:02,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:42:02,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:42:02,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:42:02,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:42:02,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:42:02,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:42:02,057 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:42:02,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:42:02,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:42:02,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:42:02,058 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:42:02,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:42:02,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:42:02,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:42:02,327 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:42:02,327 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:42:02,328 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product23.cil.c [2019-11-24 04:42:02,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835c6ab2f/d7b9d58e194444a68283946d6169eb09/FLAGdfb3314aa [2019-11-24 04:42:03,032 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:42:03,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product23.cil.c [2019-11-24 04:42:03,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835c6ab2f/d7b9d58e194444a68283946d6169eb09/FLAGdfb3314aa [2019-11-24 04:42:03,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/835c6ab2f/d7b9d58e194444a68283946d6169eb09 [2019-11-24 04:42:03,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:42:03,267 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:42:03,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:42:03,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:42:03,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:42:03,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:42:03" (1/1) ... [2019-11-24 04:42:03,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6318e249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:03, skipping insertion in model container [2019-11-24 04:42:03,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:42:03" (1/1) ... [2019-11-24 04:42:03,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:42:03,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:42:04,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:42:04,056 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:42:04,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:42:04,245 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:42:04,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:04 WrapperNode [2019-11-24 04:42:04,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:42:04,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:42:04,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:42:04,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:42:04,256 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:04" (1/1) ... [2019-11-24 04:42:04,297 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:04" (1/1) ... [2019-11-24 04:42:04,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:42:04,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:42:04,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:42:04,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:42:04,533 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:04" (1/1) ... [2019-11-24 04:42:04,534 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:04" (1/1) ... [2019-11-24 04:42:04,575 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:04" (1/1) ... [2019-11-24 04:42:04,575 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:04" (1/1) ... [2019-11-24 04:42:04,733 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:04" (1/1) ... [2019-11-24 04:42:04,819 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:04" (1/1) ... [2019-11-24 04:42:04,848 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:04" (1/1) ... [2019-11-24 04:42:04,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:42:04,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:42:04,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:42:04,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:42:04,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:04" (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:04,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:42:04,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:42:04,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:42:04,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:42:38,729 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:42:38,730 INFO L284 CfgBuilder]: Removed 845 assume(true) statements. [2019-11-24 04:42:38,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:42:38 BoogieIcfgContainer [2019-11-24 04:42:38,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:42:38,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:42:38,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:42:38,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:42:38,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:42:03" (1/3) ... [2019-11-24 04:42:38,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1db8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:42:38, skipping insertion in model container [2019-11-24 04:42:38,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:42:04" (2/3) ... [2019-11-24 04:42:38,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1db8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:42:38, skipping insertion in model container [2019-11-24 04:42:38,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:42:38" (3/3) ... [2019-11-24 04:42:38,740 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product23.cil.c [2019-11-24 04:42:38,750 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:42:38,758 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:42:38,766 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:42:38,797 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:42:38,797 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:42:38,798 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:42:38,798 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:42:38,798 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:42:38,798 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:42:38,798 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:42:38,798 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:42:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states. [2019-11-24 04:42:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:42:38,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:38,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:38,853 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:42:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash -363736237, now seen corresponding path program 1 times [2019-11-24 04:42:38,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:38,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897776813] [2019-11-24 04:42:38,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:39,328 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:42:39,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897776813] [2019-11-24 04:42:39,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:39,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:42:39,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666252656] [2019-11-24 04:42:39,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:42:39,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:42:39,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:42:39,360 INFO L87 Difference]: Start difference. First operand 1241 states. Second operand 2 states. [2019-11-24 04:42:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:39,490 INFO L93 Difference]: Finished difference Result 1258 states and 2415 transitions. [2019-11-24 04:42:39,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:42:39,492 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:42:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:39,530 INFO L225 Difference]: With dead ends: 1258 [2019-11-24 04:42:39,530 INFO L226 Difference]: Without dead ends: 1239 [2019-11-24 04:42:39,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:42:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-11-24 04:42:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2019-11-24 04:42:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-11-24 04:42:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2385 transitions. [2019-11-24 04:42:39,658 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2385 transitions. Word has length 14 [2019-11-24 04:42:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:39,658 INFO L462 AbstractCegarLoop]: Abstraction has 1239 states and 2385 transitions. [2019-11-24 04:42:39,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:42:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2385 transitions. [2019-11-24 04:42:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:42:39,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:39,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:39,663 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:42:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:39,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1597426106, now seen corresponding path program 1 times [2019-11-24 04:42:39,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:39,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172719481] [2019-11-24 04:42:39,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:42:39,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172719481] [2019-11-24 04:42:39,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:39,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:39,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158290769] [2019-11-24 04:42:39,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:39,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:39,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:39,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:39,863 INFO L87 Difference]: Start difference. First operand 1239 states and 2385 transitions. Second operand 3 states. [2019-11-24 04:42:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:40,217 INFO L93 Difference]: Finished difference Result 2321 states and 4462 transitions. [2019-11-24 04:42:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:40,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:42:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:40,227 INFO L225 Difference]: With dead ends: 2321 [2019-11-24 04:42:40,228 INFO L226 Difference]: Without dead ends: 1681 [2019-11-24 04:42:40,235 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:42:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-11-24 04:42:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1644. [2019-11-24 04:42:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1644 states. [2019-11-24 04:42:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 3163 transitions. [2019-11-24 04:42:40,292 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 3163 transitions. Word has length 15 [2019-11-24 04:42:40,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:40,293 INFO L462 AbstractCegarLoop]: Abstraction has 1644 states and 3163 transitions. [2019-11-24 04:42:40,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 3163 transitions. [2019-11-24 04:42:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:42:40,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:40,298 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:42:40,298 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:42:40,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:40,299 INFO L82 PathProgramCache]: Analyzing trace with hash -713436943, now seen corresponding path program 1 times [2019-11-24 04:42:40,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:40,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342282091] [2019-11-24 04:42:40,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:40,445 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:42:40,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342282091] [2019-11-24 04:42:40,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:40,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:40,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128815562] [2019-11-24 04:42:40,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:40,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:40,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:40,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:40,449 INFO L87 Difference]: Start difference. First operand 1644 states and 3163 transitions. Second operand 3 states. [2019-11-24 04:42:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:40,763 INFO L93 Difference]: Finished difference Result 3585 states and 6894 transitions. [2019-11-24 04:42:40,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:40,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:42:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:40,782 INFO L225 Difference]: With dead ends: 3585 [2019-11-24 04:42:40,792 INFO L226 Difference]: Without dead ends: 2557 [2019-11-24 04:42:40,794 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:42:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2019-11-24 04:42:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2444. [2019-11-24 04:42:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2019-11-24 04:42:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 4701 transitions. [2019-11-24 04:42:40,891 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 4701 transitions. Word has length 17 [2019-11-24 04:42:40,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:40,892 INFO L462 AbstractCegarLoop]: Abstraction has 2444 states and 4701 transitions. [2019-11-24 04:42:40,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 4701 transitions. [2019-11-24 04:42:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:42:40,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:40,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:40,896 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:42:40,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:40,896 INFO L82 PathProgramCache]: Analyzing trace with hash -207462816, now seen corresponding path program 1 times [2019-11-24 04:42:40,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:40,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581379867] [2019-11-24 04:42:40,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:41,028 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:42:41,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581379867] [2019-11-24 04:42:41,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:41,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:41,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434183461] [2019-11-24 04:42:41,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:41,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:41,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:41,033 INFO L87 Difference]: Start difference. First operand 2444 states and 4701 transitions. Second operand 3 states. [2019-11-24 04:42:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:41,346 INFO L93 Difference]: Finished difference Result 4259 states and 8187 transitions. [2019-11-24 04:42:41,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:41,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:42:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:41,362 INFO L225 Difference]: With dead ends: 4259 [2019-11-24 04:42:41,362 INFO L226 Difference]: Without dead ends: 2434 [2019-11-24 04:42:41,366 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:42:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2019-11-24 04:42:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2019-11-24 04:42:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-11-24 04:42:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 4675 transitions. [2019-11-24 04:42:41,465 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 4675 transitions. Word has length 19 [2019-11-24 04:42:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:41,466 INFO L462 AbstractCegarLoop]: Abstraction has 2434 states and 4675 transitions. [2019-11-24 04:42:41,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 4675 transitions. [2019-11-24 04:42:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:42:41,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:41,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:41,469 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:42:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash -700440013, now seen corresponding path program 1 times [2019-11-24 04:42:41,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:41,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627985677] [2019-11-24 04:42:41,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:41,602 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:42:41,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627985677] [2019-11-24 04:42:41,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:41,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:41,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321297420] [2019-11-24 04:42:41,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:41,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:41,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:41,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:41,604 INFO L87 Difference]: Start difference. First operand 2434 states and 4675 transitions. Second operand 3 states. [2019-11-24 04:42:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:41,966 INFO L93 Difference]: Finished difference Result 5956 states and 11437 transitions. [2019-11-24 04:42:41,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:41,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:42:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:41,991 INFO L225 Difference]: With dead ends: 5956 [2019-11-24 04:42:41,991 INFO L226 Difference]: Without dead ends: 4158 [2019-11-24 04:42:41,995 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:42:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2019-11-24 04:42:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 4006. [2019-11-24 04:42:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4006 states. [2019-11-24 04:42:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4006 states to 4006 states and 7688 transitions. [2019-11-24 04:42:42,129 INFO L78 Accepts]: Start accepts. Automaton has 4006 states and 7688 transitions. Word has length 20 [2019-11-24 04:42:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:42,129 INFO L462 AbstractCegarLoop]: Abstraction has 4006 states and 7688 transitions. [2019-11-24 04:42:42,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4006 states and 7688 transitions. [2019-11-24 04:42:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:42:42,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:42,132 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:42:42,132 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:42:42,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash -238780854, now seen corresponding path program 1 times [2019-11-24 04:42:42,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:42,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756600189] [2019-11-24 04:42:42,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:42,230 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:42:42,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756600189] [2019-11-24 04:42:42,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:42,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:42,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588103472] [2019-11-24 04:42:42,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:42,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:42,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:42,233 INFO L87 Difference]: Start difference. First operand 4006 states and 7688 transitions. Second operand 3 states. [2019-11-24 04:42:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:42,512 INFO L93 Difference]: Finished difference Result 4006 states and 7688 transitions. [2019-11-24 04:42:42,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:42,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:42:42,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:42,534 INFO L225 Difference]: With dead ends: 4006 [2019-11-24 04:42:42,534 INFO L226 Difference]: Without dead ends: 3999 [2019-11-24 04:42:42,536 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:42:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2019-11-24 04:42:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3999. [2019-11-24 04:42:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3999 states. [2019-11-24 04:42:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 7676 transitions. [2019-11-24 04:42:42,807 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 7676 transitions. Word has length 21 [2019-11-24 04:42:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:42,807 INFO L462 AbstractCegarLoop]: Abstraction has 3999 states and 7676 transitions. [2019-11-24 04:42:42,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 7676 transitions. [2019-11-24 04:42:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:42:42,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:42,811 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:42:42,811 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:42:42,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:42,817 INFO L82 PathProgramCache]: Analyzing trace with hash 769019480, now seen corresponding path program 1 times [2019-11-24 04:42:42,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:42,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970314318] [2019-11-24 04:42:42,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:43,042 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:42:43,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970314318] [2019-11-24 04:42:43,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:43,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:43,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341267304] [2019-11-24 04:42:43,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:43,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:43,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:43,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:43,045 INFO L87 Difference]: Start difference. First operand 3999 states and 7676 transitions. Second operand 3 states. [2019-11-24 04:42:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:44,154 INFO L93 Difference]: Finished difference Result 10705 states and 20518 transitions. [2019-11-24 04:42:44,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:44,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 04:42:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:44,218 INFO L225 Difference]: With dead ends: 10705 [2019-11-24 04:42:44,218 INFO L226 Difference]: Without dead ends: 7141 [2019-11-24 04:42:44,229 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:42:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7141 states. [2019-11-24 04:42:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7141 to 3959. [2019-11-24 04:42:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3959 states. [2019-11-24 04:42:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 7576 transitions. [2019-11-24 04:42:44,463 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 7576 transitions. Word has length 31 [2019-11-24 04:42:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:44,463 INFO L462 AbstractCegarLoop]: Abstraction has 3959 states and 7576 transitions. [2019-11-24 04:42:44,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 7576 transitions. [2019-11-24 04:42:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:42:44,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:44,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:44,467 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:42:44,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:44,467 INFO L82 PathProgramCache]: Analyzing trace with hash -560839312, now seen corresponding path program 1 times [2019-11-24 04:42:44,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:44,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058087944] [2019-11-24 04:42:44,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:44,680 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:42:44,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058087944] [2019-11-24 04:42:44,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:44,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:44,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547453214] [2019-11-24 04:42:44,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:44,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:44,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:44,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:44,683 INFO L87 Difference]: Start difference. First operand 3959 states and 7576 transitions. Second operand 3 states. [2019-11-24 04:42:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:45,650 INFO L93 Difference]: Finished difference Result 10611 states and 20304 transitions. [2019-11-24 04:42:45,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:45,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 04:42:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:45,669 INFO L225 Difference]: With dead ends: 10611 [2019-11-24 04:42:45,669 INFO L226 Difference]: Without dead ends: 7109 [2019-11-24 04:42:45,677 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:42:45,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7109 states. [2019-11-24 04:42:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7109 to 3929. [2019-11-24 04:42:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2019-11-24 04:42:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 7486 transitions. [2019-11-24 04:42:45,865 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 7486 transitions. Word has length 32 [2019-11-24 04:42:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:45,865 INFO L462 AbstractCegarLoop]: Abstraction has 3929 states and 7486 transitions. [2019-11-24 04:42:45,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 7486 transitions. [2019-11-24 04:42:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:42:45,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:45,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:45,869 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:42:45,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash 840066677, now seen corresponding path program 1 times [2019-11-24 04:42:45,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:45,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735272599] [2019-11-24 04:42:45,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:46,106 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:42:46,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735272599] [2019-11-24 04:42:46,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:46,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:46,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671792032] [2019-11-24 04:42:46,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:46,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:46,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:46,109 INFO L87 Difference]: Start difference. First operand 3929 states and 7486 transitions. Second operand 3 states. [2019-11-24 04:42:48,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:48,151 INFO L93 Difference]: Finished difference Result 10532 states and 20105 transitions. [2019-11-24 04:42:48,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:48,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:42:48,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:48,167 INFO L225 Difference]: With dead ends: 10532 [2019-11-24 04:42:48,167 INFO L226 Difference]: Without dead ends: 7087 [2019-11-24 04:42:48,174 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:42:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7087 states. [2019-11-24 04:42:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7087 to 3909. [2019-11-24 04:42:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3909 states. [2019-11-24 04:42:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 7406 transitions. [2019-11-24 04:42:48,350 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 7406 transitions. Word has length 34 [2019-11-24 04:42:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:48,350 INFO L462 AbstractCegarLoop]: Abstraction has 3909 states and 7406 transitions. [2019-11-24 04:42:48,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 7406 transitions. [2019-11-24 04:42:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:42:48,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:48,354 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:42:48,354 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:42:48,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:48,354 INFO L82 PathProgramCache]: Analyzing trace with hash -728131148, now seen corresponding path program 1 times [2019-11-24 04:42:48,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:48,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730380984] [2019-11-24 04:42:48,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:48,618 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:42:48,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730380984] [2019-11-24 04:42:48,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:48,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:48,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48277242] [2019-11-24 04:42:48,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:48,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:48,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:48,622 INFO L87 Difference]: Start difference. First operand 3909 states and 7406 transitions. Second operand 3 states. [2019-11-24 04:42:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:49,429 INFO L93 Difference]: Finished difference Result 10468 states and 19921 transitions. [2019-11-24 04:42:49,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:49,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:42:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:49,447 INFO L225 Difference]: With dead ends: 10468 [2019-11-24 04:42:49,448 INFO L226 Difference]: Without dead ends: 7075 [2019-11-24 04:42:49,454 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:42:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2019-11-24 04:42:49,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 3899. [2019-11-24 04:42:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3899 states. [2019-11-24 04:42:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 7336 transitions. [2019-11-24 04:42:49,640 INFO L78 Accepts]: Start accepts. Automaton has 3899 states and 7336 transitions. Word has length 37 [2019-11-24 04:42:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:49,641 INFO L462 AbstractCegarLoop]: Abstraction has 3899 states and 7336 transitions. [2019-11-24 04:42:49,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3899 states and 7336 transitions. [2019-11-24 04:42:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:42:49,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:49,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:49,647 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:42:49,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:49,647 INFO L82 PathProgramCache]: Analyzing trace with hash 779402942, now seen corresponding path program 1 times [2019-11-24 04:42:49,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:49,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958909719] [2019-11-24 04:42:49,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:49,919 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:42:49,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958909719] [2019-11-24 04:42:49,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:49,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:49,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038159224] [2019-11-24 04:42:49,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:42:49,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:49,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:42:49,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:42:49,921 INFO L87 Difference]: Start difference. First operand 3899 states and 7336 transitions. Second operand 3 states. [2019-11-24 04:42:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:50,682 INFO L93 Difference]: Finished difference Result 7636 states and 14420 transitions. [2019-11-24 04:42:50,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:42:50,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:42:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:50,692 INFO L225 Difference]: With dead ends: 7636 [2019-11-24 04:42:50,693 INFO L226 Difference]: Without dead ends: 4290 [2019-11-24 04:42:50,698 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:42:50,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4290 states. [2019-11-24 04:42:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4290 to 3899. [2019-11-24 04:42:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3899 states. [2019-11-24 04:42:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 7276 transitions. [2019-11-24 04:42:50,883 INFO L78 Accepts]: Start accepts. Automaton has 3899 states and 7276 transitions. Word has length 41 [2019-11-24 04:42:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:50,885 INFO L462 AbstractCegarLoop]: Abstraction has 3899 states and 7276 transitions. [2019-11-24 04:42:50,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:42:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3899 states and 7276 transitions. [2019-11-24 04:42:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:42:50,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:50,890 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:42:50,890 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:42:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1105199527, now seen corresponding path program 1 times [2019-11-24 04:42:50,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:50,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352637665] [2019-11-24 04:42:50,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:51,189 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:42:51,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352637665] [2019-11-24 04:42:51,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:51,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:42:51,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692724280] [2019-11-24 04:42:51,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:42:51,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:51,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:42:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:42:51,191 INFO L87 Difference]: Start difference. First operand 3899 states and 7276 transitions. Second operand 5 states. [2019-11-24 04:42:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:53,329 INFO L93 Difference]: Finished difference Result 16804 states and 31740 transitions. [2019-11-24 04:42:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:42:53,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:42:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:53,353 INFO L225 Difference]: With dead ends: 16804 [2019-11-24 04:42:53,353 INFO L226 Difference]: Without dead ends: 12930 [2019-11-24 04:42:53,363 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:42:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12930 states. [2019-11-24 04:42:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12930 to 5021. [2019-11-24 04:42:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5021 states. [2019-11-24 04:42:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5021 states to 5021 states and 8934 transitions. [2019-11-24 04:42:53,807 INFO L78 Accepts]: Start accepts. Automaton has 5021 states and 8934 transitions. Word has length 45 [2019-11-24 04:42:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:53,807 INFO L462 AbstractCegarLoop]: Abstraction has 5021 states and 8934 transitions. [2019-11-24 04:42:53,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:42:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 5021 states and 8934 transitions. [2019-11-24 04:42:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:42:53,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:53,810 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:42:53,810 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:42:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash -716494456, now seen corresponding path program 1 times [2019-11-24 04:42:53,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:53,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813538583] [2019-11-24 04:42:53,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:54,653 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:42:54,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813538583] [2019-11-24 04:42:54,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:54,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:42:54,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150718777] [2019-11-24 04:42:54,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:42:54,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:54,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:42:54,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:42:54,661 INFO L87 Difference]: Start difference. First operand 5021 states and 8934 transitions. Second operand 22 states. [2019-11-24 04:42:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:56,720 INFO L93 Difference]: Finished difference Result 15586 states and 28188 transitions. [2019-11-24 04:42:56,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:42:56,720 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-11-24 04:42:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:56,736 INFO L225 Difference]: With dead ends: 15586 [2019-11-24 04:42:56,736 INFO L226 Difference]: Without dead ends: 10818 [2019-11-24 04:42:56,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:42:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10818 states. [2019-11-24 04:42:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10818 to 4756. [2019-11-24 04:42:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4756 states. [2019-11-24 04:42:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 8454 transitions. [2019-11-24 04:42:57,469 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 8454 transitions. Word has length 46 [2019-11-24 04:42:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:57,469 INFO L462 AbstractCegarLoop]: Abstraction has 4756 states and 8454 transitions. [2019-11-24 04:42:57,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:42:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 8454 transitions. [2019-11-24 04:42:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:42:57,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:57,472 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:42:57,472 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:42:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:57,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1539468618, now seen corresponding path program 1 times [2019-11-24 04:42:57,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:57,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222778300] [2019-11-24 04:42:57,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:42:57,693 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:42:57,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222778300] [2019-11-24 04:42:57,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:42:57,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:42:57,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227259146] [2019-11-24 04:42:57,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:42:57,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:42:57,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:42:57,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:42:57,695 INFO L87 Difference]: Start difference. First operand 4756 states and 8454 transitions. Second operand 4 states. [2019-11-24 04:42:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:42:59,248 INFO L93 Difference]: Finished difference Result 13251 states and 23759 transitions. [2019-11-24 04:42:59,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:42:59,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-24 04:42:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:42:59,259 INFO L225 Difference]: With dead ends: 13251 [2019-11-24 04:42:59,259 INFO L226 Difference]: Without dead ends: 8723 [2019-11-24 04:42:59,265 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:42:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8723 states. [2019-11-24 04:42:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8723 to 4484. [2019-11-24 04:42:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-11-24 04:42:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 7996 transitions. [2019-11-24 04:42:59,867 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 7996 transitions. Word has length 48 [2019-11-24 04:42:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:42:59,868 INFO L462 AbstractCegarLoop]: Abstraction has 4484 states and 7996 transitions. [2019-11-24 04:42:59,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:42:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 7996 transitions. [2019-11-24 04:42:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:42:59,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:42:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:42:59,871 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:42:59,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:42:59,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1118344782, now seen corresponding path program 1 times [2019-11-24 04:42:59,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:42:59,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461091795] [2019-11-24 04:42:59,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:42:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:00,516 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:00,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461091795] [2019-11-24 04:43:00,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:00,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:43:00,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493391276] [2019-11-24 04:43:00,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:43:00,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:00,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:43:00,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:43:00,519 INFO L87 Difference]: Start difference. First operand 4484 states and 7996 transitions. Second operand 22 states. [2019-11-24 04:43:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:02,859 INFO L93 Difference]: Finished difference Result 14569 states and 26353 transitions. [2019-11-24 04:43:02,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:43:02,859 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2019-11-24 04:43:02,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:02,870 INFO L225 Difference]: With dead ends: 14569 [2019-11-24 04:43:02,870 INFO L226 Difference]: Without dead ends: 10460 [2019-11-24 04:43:02,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:43:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10460 states. [2019-11-24 04:43:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10460 to 4702. [2019-11-24 04:43:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4702 states. [2019-11-24 04:43:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4702 states to 4702 states and 8280 transitions. [2019-11-24 04:43:03,330 INFO L78 Accepts]: Start accepts. Automaton has 4702 states and 8280 transitions. Word has length 49 [2019-11-24 04:43:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:03,330 INFO L462 AbstractCegarLoop]: Abstraction has 4702 states and 8280 transitions. [2019-11-24 04:43:03,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:43:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4702 states and 8280 transitions. [2019-11-24 04:43:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 04:43:03,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:03,333 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:03,333 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:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash 988249143, now seen corresponding path program 1 times [2019-11-24 04:43:03,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:03,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298820768] [2019-11-24 04:43:03,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:04,075 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:04,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298820768] [2019-11-24 04:43:04,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:04,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:43:04,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548504853] [2019-11-24 04:43:04,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:43:04,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:04,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:43:04,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:43:04,079 INFO L87 Difference]: Start difference. First operand 4702 states and 8280 transitions. Second operand 22 states. [2019-11-24 04:43:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:06,489 INFO L93 Difference]: Finished difference Result 13337 states and 23691 transitions. [2019-11-24 04:43:06,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:43:06,490 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2019-11-24 04:43:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:06,500 INFO L225 Difference]: With dead ends: 13337 [2019-11-24 04:43:06,500 INFO L226 Difference]: Without dead ends: 9010 [2019-11-24 04:43:06,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:43:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9010 states. [2019-11-24 04:43:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9010 to 5042. [2019-11-24 04:43:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5042 states. [2019-11-24 04:43:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 8749 transitions. [2019-11-24 04:43:07,098 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 8749 transitions. Word has length 51 [2019-11-24 04:43:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:07,099 INFO L462 AbstractCegarLoop]: Abstraction has 5042 states and 8749 transitions. [2019-11-24 04:43:07,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:43:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 8749 transitions. [2019-11-24 04:43:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 04:43:07,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:07,101 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:07,101 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:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash -743991732, now seen corresponding path program 1 times [2019-11-24 04:43:07,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:07,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489734638] [2019-11-24 04:43:07,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:07,251 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:07,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489734638] [2019-11-24 04:43:07,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:07,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:43:07,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490542419] [2019-11-24 04:43:07,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:07,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:07,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:07,253 INFO L87 Difference]: Start difference. First operand 5042 states and 8749 transitions. Second operand 5 states. [2019-11-24 04:43:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:08,664 INFO L93 Difference]: Finished difference Result 14063 states and 24991 transitions. [2019-11-24 04:43:08,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:43:08,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-24 04:43:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:08,674 INFO L225 Difference]: With dead ends: 14063 [2019-11-24 04:43:08,675 INFO L226 Difference]: Without dead ends: 9400 [2019-11-24 04:43:08,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:43:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2019-11-24 04:43:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 5123. [2019-11-24 04:43:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5123 states. [2019-11-24 04:43:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5123 states to 5123 states and 8830 transitions. [2019-11-24 04:43:09,252 INFO L78 Accepts]: Start accepts. Automaton has 5123 states and 8830 transitions. Word has length 62 [2019-11-24 04:43:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:09,252 INFO L462 AbstractCegarLoop]: Abstraction has 5123 states and 8830 transitions. [2019-11-24 04:43:09,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:43:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 5123 states and 8830 transitions. [2019-11-24 04:43:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 04:43:09,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:09,255 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:43:09,255 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:09,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:09,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1515770041, now seen corresponding path program 1 times [2019-11-24 04:43:09,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:09,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960118811] [2019-11-24 04:43:09,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:09,397 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:09,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960118811] [2019-11-24 04:43:09,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:09,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:43:09,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731256568] [2019-11-24 04:43:09,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:09,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:09,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:09,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:09,399 INFO L87 Difference]: Start difference. First operand 5123 states and 8830 transitions. Second operand 5 states. [2019-11-24 04:43:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:10,873 INFO L93 Difference]: Finished difference Result 14144 states and 25032 transitions. [2019-11-24 04:43:10,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:43:10,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-24 04:43:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:10,885 INFO L225 Difference]: With dead ends: 14144 [2019-11-24 04:43:10,885 INFO L226 Difference]: Without dead ends: 9400 [2019-11-24 04:43:10,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:43:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2019-11-24 04:43:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 5123. [2019-11-24 04:43:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5123 states. [2019-11-24 04:43:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5123 states to 5123 states and 8790 transitions. [2019-11-24 04:43:11,513 INFO L78 Accepts]: Start accepts. Automaton has 5123 states and 8790 transitions. Word has length 63 [2019-11-24 04:43:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:11,513 INFO L462 AbstractCegarLoop]: Abstraction has 5123 states and 8790 transitions. [2019-11-24 04:43:11,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:43:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5123 states and 8790 transitions. [2019-11-24 04:43:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:43:11,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:11,517 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] [2019-11-24 04:43:11,517 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:11,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1553403670, now seen corresponding path program 1 times [2019-11-24 04:43:11,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:11,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823385740] [2019-11-24 04:43:11,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:11,738 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:11,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823385740] [2019-11-24 04:43:11,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:11,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:43:11,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361306064] [2019-11-24 04:43:11,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:11,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:11,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:11,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:11,740 INFO L87 Difference]: Start difference. First operand 5123 states and 8790 transitions. Second operand 5 states. [2019-11-24 04:43:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:43:13,335 INFO L93 Difference]: Finished difference Result 14204 states and 25033 transitions. [2019-11-24 04:43:13,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:43:13,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-24 04:43:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:43:13,347 INFO L225 Difference]: With dead ends: 14204 [2019-11-24 04:43:13,347 INFO L226 Difference]: Without dead ends: 9460 [2019-11-24 04:43:13,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:43:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9460 states. [2019-11-24 04:43:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9460 to 5115. [2019-11-24 04:43:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5115 states. [2019-11-24 04:43:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 8779 transitions. [2019-11-24 04:43:13,972 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 8779 transitions. Word has length 64 [2019-11-24 04:43:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:43:13,972 INFO L462 AbstractCegarLoop]: Abstraction has 5115 states and 8779 transitions. [2019-11-24 04:43:13,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:43:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 8779 transitions. [2019-11-24 04:43:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:43:13,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:43:13,975 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] [2019-11-24 04:43:13,976 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:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:43:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash -765217740, now seen corresponding path program 1 times [2019-11-24 04:43:13,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:43:13,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751485124] [2019-11-24 04:43:13,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:43:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:43:14,207 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:14,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751485124] [2019-11-24 04:43:14,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:43:14,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:43:14,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278603904] [2019-11-24 04:43:14,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:43:14,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:43:14,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:43:14,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:43:14,210 INFO L87 Difference]: Start difference. First operand 5115 states and 8779 transitions. Second operand 5 states.