/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:38:13,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:38:13,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:38:13,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:38:13,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:38:13,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:38:13,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:38:13,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:38:13,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:38:13,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:38:13,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:38:13,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:38:13,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:38:13,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:38:13,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:38:13,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:38:13,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:38:13,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:38:13,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:38:13,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:38:13,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:38:13,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:38:13,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:38:13,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:38:13,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:38:13,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:38:13,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:38:13,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:38:13,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:38:13,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:38:13,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:38:13,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:38:13,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:38:13,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:38:13,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:38:13,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:38:13,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:38:13,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:38:13,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:38:13,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:38:13,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:38:13,677 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:38:13,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:38:13,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:38:13,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:38:13,693 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:38:13,694 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:38:13,694 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:38:13,694 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:38:13,694 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:38:13,694 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:38:13,695 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:38:13,695 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:38:13,695 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:38:13,695 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:38:13,695 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:38:13,696 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:38:13,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:38:13,697 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:38:13,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:38:13,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:38:13,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:38:13,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:38:13,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:38:13,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:38:13,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:38:13,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:38:13,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:38:13,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:38:13,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:38:13,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:38:13,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:38:13,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:38:13,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:38:13,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:38:13,700 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:38:13,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:38:13,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:38:13,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:38:13,701 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:38:13,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:38:13,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:38:13,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:38:14,000 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:38:14,000 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:38:14,001 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product20.cil.c [2019-11-24 04:38:14,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0014b7d9b/452d3b86878f45dda056d4ca4e0883cb/FLAG66bd95e71 [2019-11-24 04:38:14,735 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:38:14,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product20.cil.c [2019-11-24 04:38:14,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0014b7d9b/452d3b86878f45dda056d4ca4e0883cb/FLAG66bd95e71 [2019-11-24 04:38:14,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0014b7d9b/452d3b86878f45dda056d4ca4e0883cb [2019-11-24 04:38:14,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:38:14,958 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:38:14,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:38:14,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:38:14,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:38:14,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16438b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:14, skipping insertion in model container [2019-11-24 04:38:14,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:38:14" (1/1) ... [2019-11-24 04:38:14,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:38:15,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:38:15,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:38:15,808 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:38:15,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:38:15,996 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:38:15,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:15 WrapperNode [2019-11-24 04:38:15,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:38:15,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:38:15,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:38:15,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:38:16,007 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:38:15" (1/1) ... [2019-11-24 04:38:16,040 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:38:15" (1/1) ... [2019-11-24 04:38:16,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:38:16,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:38:16,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:38:16,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:38:16,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:15" (1/1) ... [2019-11-24 04:38:16,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:15" (1/1) ... [2019-11-24 04:38:16,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:15" (1/1) ... [2019-11-24 04:38:16,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:15" (1/1) ... [2019-11-24 04:38:16,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:15" (1/1) ... [2019-11-24 04:38:16,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:15" (1/1) ... [2019-11-24 04:38:16,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:15" (1/1) ... [2019-11-24 04:38:16,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:38:16,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:38:16,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:38:16,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:38:16,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:15" (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:38:16,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:38:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:38:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:38:16,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:39:05,342 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:39:05,343 INFO L284 CfgBuilder]: Removed 1113 assume(true) statements. [2019-11-24 04:39:05,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:39:05 BoogieIcfgContainer [2019-11-24 04:39:05,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:39:05,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:39:05,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:39:05,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:39:05,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:38:14" (1/3) ... [2019-11-24 04:39:05,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b00efdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:39:05, skipping insertion in model container [2019-11-24 04:39:05,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:38:15" (2/3) ... [2019-11-24 04:39:05,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b00efdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:39:05, skipping insertion in model container [2019-11-24 04:39:05,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:39:05" (3/3) ... [2019-11-24 04:39:05,353 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product20.cil.c [2019-11-24 04:39:05,362 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:39:05,370 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:39:05,379 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:39:05,414 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:39:05,414 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:39:05,414 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:39:05,414 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:39:05,415 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:39:05,415 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:39:05,415 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:39:05,415 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:39:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states. [2019-11-24 04:39:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:39:05,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:05,466 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:05,467 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:39:05,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:05,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1084499171, now seen corresponding path program 1 times [2019-11-24 04:39:05,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:05,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549176053] [2019-11-24 04:39:05,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:05,873 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:39:05,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549176053] [2019-11-24 04:39:05,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:05,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:39:05,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367917008] [2019-11-24 04:39:05,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:39:05,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:05,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:39:05,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:39:05,895 INFO L87 Difference]: Start difference. First operand 1449 states. Second operand 2 states. [2019-11-24 04:39:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:06,012 INFO L93 Difference]: Finished difference Result 1466 states and 2819 transitions. [2019-11-24 04:39:06,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:39:06,017 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-24 04:39:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:06,061 INFO L225 Difference]: With dead ends: 1466 [2019-11-24 04:39:06,061 INFO L226 Difference]: Without dead ends: 1447 [2019-11-24 04:39:06,068 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:39:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2019-11-24 04:39:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2019-11-24 04:39:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2019-11-24 04:39:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2789 transitions. [2019-11-24 04:39:06,231 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2789 transitions. Word has length 12 [2019-11-24 04:39:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:06,232 INFO L462 AbstractCegarLoop]: Abstraction has 1447 states and 2789 transitions. [2019-11-24 04:39:06,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:39:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2789 transitions. [2019-11-24 04:39:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:39:06,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:06,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:06,241 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:39:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash 690650164, now seen corresponding path program 1 times [2019-11-24 04:39:06,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:06,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663666561] [2019-11-24 04:39:06,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:06,464 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:39:06,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663666561] [2019-11-24 04:39:06,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:06,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:06,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190392802] [2019-11-24 04:39:06,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:06,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:06,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:06,468 INFO L87 Difference]: Start difference. First operand 1447 states and 2789 transitions. Second operand 3 states. [2019-11-24 04:39:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:06,582 INFO L93 Difference]: Finished difference Result 2187 states and 4210 transitions. [2019-11-24 04:39:06,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:06,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 04:39:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:06,594 INFO L225 Difference]: With dead ends: 2187 [2019-11-24 04:39:06,594 INFO L226 Difference]: Without dead ends: 1443 [2019-11-24 04:39:06,599 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:39:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-24 04:39:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2019-11-24 04:39:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-11-24 04:39:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2781 transitions. [2019-11-24 04:39:06,644 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2781 transitions. Word has length 13 [2019-11-24 04:39:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:06,644 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 2781 transitions. [2019-11-24 04:39:06,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2781 transitions. [2019-11-24 04:39:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:39:06,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:06,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:06,646 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:39:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1193493800, now seen corresponding path program 1 times [2019-11-24 04:39:06,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:06,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489024251] [2019-11-24 04:39:06,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:06,777 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:39:06,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489024251] [2019-11-24 04:39:06,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:06,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:06,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127097471] [2019-11-24 04:39:06,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:39:06,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:06,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:39:06,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:06,781 INFO L87 Difference]: Start difference. First operand 1443 states and 2781 transitions. Second operand 4 states. [2019-11-24 04:39:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:08,171 INFO L93 Difference]: Finished difference Result 3693 states and 7077 transitions. [2019-11-24 04:39:08,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:08,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:39:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:08,188 INFO L225 Difference]: With dead ends: 3693 [2019-11-24 04:39:08,188 INFO L226 Difference]: Without dead ends: 2710 [2019-11-24 04:39:08,191 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:39:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2019-11-24 04:39:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 1901. [2019-11-24 04:39:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1901 states. [2019-11-24 04:39:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 3568 transitions. [2019-11-24 04:39:08,256 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 3568 transitions. Word has length 15 [2019-11-24 04:39:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:08,256 INFO L462 AbstractCegarLoop]: Abstraction has 1901 states and 3568 transitions. [2019-11-24 04:39:08,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:39:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 3568 transitions. [2019-11-24 04:39:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:39:08,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:08,258 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:39:08,258 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:39:08,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1015241510, now seen corresponding path program 1 times [2019-11-24 04:39:08,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:08,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373462676] [2019-11-24 04:39:08,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:08,691 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:39:08,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373462676] [2019-11-24 04:39:08,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:08,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:08,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608234441] [2019-11-24 04:39:08,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:08,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:08,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:08,694 INFO L87 Difference]: Start difference. First operand 1901 states and 3568 transitions. Second operand 5 states. [2019-11-24 04:39:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:08,901 INFO L93 Difference]: Finished difference Result 3218 states and 6047 transitions. [2019-11-24 04:39:08,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:08,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 04:39:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:08,920 INFO L225 Difference]: With dead ends: 3218 [2019-11-24 04:39:08,920 INFO L226 Difference]: Without dead ends: 3205 [2019-11-24 04:39:08,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2019-11-24 04:39:09,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 1905. [2019-11-24 04:39:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1905 states. [2019-11-24 04:39:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 3572 transitions. [2019-11-24 04:39:09,016 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 3572 transitions. Word has length 17 [2019-11-24 04:39:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:09,016 INFO L462 AbstractCegarLoop]: Abstraction has 1905 states and 3572 transitions. [2019-11-24 04:39:09,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 3572 transitions. [2019-11-24 04:39:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:39:09,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:09,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:09,020 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:39:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1411204490, now seen corresponding path program 1 times [2019-11-24 04:39:09,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:09,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622005234] [2019-11-24 04:39:09,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:09,191 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:39:09,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622005234] [2019-11-24 04:39:09,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:09,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:39:09,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184245819] [2019-11-24 04:39:09,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:09,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:09,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:09,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:09,193 INFO L87 Difference]: Start difference. First operand 1905 states and 3572 transitions. Second operand 3 states. [2019-11-24 04:39:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:09,715 INFO L93 Difference]: Finished difference Result 3563 states and 6675 transitions. [2019-11-24 04:39:09,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:09,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 04:39:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:09,728 INFO L225 Difference]: With dead ends: 3563 [2019-11-24 04:39:09,729 INFO L226 Difference]: Without dead ends: 2249 [2019-11-24 04:39:09,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:09,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-24 04:39:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2236. [2019-11-24 04:39:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2236 states. [2019-11-24 04:39:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 4184 transitions. [2019-11-24 04:39:09,819 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 4184 transitions. Word has length 18 [2019-11-24 04:39:09,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:09,819 INFO L462 AbstractCegarLoop]: Abstraction has 2236 states and 4184 transitions. [2019-11-24 04:39:09,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 4184 transitions. [2019-11-24 04:39:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:39:09,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:09,821 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:39:09,821 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:39:09,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:09,822 INFO L82 PathProgramCache]: Analyzing trace with hash -765173927, now seen corresponding path program 1 times [2019-11-24 04:39:09,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:09,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863194147] [2019-11-24 04:39:09,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:09,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863194147] [2019-11-24 04:39:09,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:09,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:09,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886536485] [2019-11-24 04:39:09,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:39:09,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:39:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:39:09,921 INFO L87 Difference]: Start difference. First operand 2236 states and 4184 transitions. Second operand 4 states. [2019-11-24 04:39:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:10,170 INFO L93 Difference]: Finished difference Result 4131 states and 7690 transitions. [2019-11-24 04:39:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:39:10,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-24 04:39:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:10,185 INFO L225 Difference]: With dead ends: 4131 [2019-11-24 04:39:10,185 INFO L226 Difference]: Without dead ends: 2183 [2019-11-24 04:39:10,189 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:39:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2019-11-24 04:39:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1724. [2019-11-24 04:39:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-11-24 04:39:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3210 transitions. [2019-11-24 04:39:10,270 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3210 transitions. Word has length 19 [2019-11-24 04:39:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:10,270 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 3210 transitions. [2019-11-24 04:39:10,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:39:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3210 transitions. [2019-11-24 04:39:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:39:10,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:10,272 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:39:10,272 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:39:10,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:10,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1039400507, now seen corresponding path program 1 times [2019-11-24 04:39:10,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:10,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193412635] [2019-11-24 04:39:10,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:10,378 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:39:10,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193412635] [2019-11-24 04:39:10,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:10,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:39:10,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135268233] [2019-11-24 04:39:10,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:10,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:10,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:10,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:10,381 INFO L87 Difference]: Start difference. First operand 1724 states and 3210 transitions. Second operand 5 states. [2019-11-24 04:39:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:10,538 INFO L93 Difference]: Finished difference Result 1823 states and 3339 transitions. [2019-11-24 04:39:10,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:10,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-24 04:39:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:10,547 INFO L225 Difference]: With dead ends: 1823 [2019-11-24 04:39:10,548 INFO L226 Difference]: Without dead ends: 1810 [2019-11-24 04:39:10,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:39:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-11-24 04:39:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1775. [2019-11-24 04:39:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-11-24 04:39:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 3283 transitions. [2019-11-24 04:39:10,628 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 3283 transitions. Word has length 20 [2019-11-24 04:39:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:10,629 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 3283 transitions. [2019-11-24 04:39:10,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3283 transitions. [2019-11-24 04:39:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:39:10,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:10,631 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:39:10,631 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:39:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1382727612, now seen corresponding path program 1 times [2019-11-24 04:39:10,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:10,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799686906] [2019-11-24 04:39:10,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:10,729 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:39:10,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799686906] [2019-11-24 04:39:10,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:10,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:39:10,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136187397] [2019-11-24 04:39:10,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:39:10,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:39:10,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:39:10,732 INFO L87 Difference]: Start difference. First operand 1775 states and 3283 transitions. Second operand 3 states. [2019-11-24 04:39:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:10,888 INFO L93 Difference]: Finished difference Result 4133 states and 7682 transitions. [2019-11-24 04:39:10,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:39:10,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:39:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:10,906 INFO L225 Difference]: With dead ends: 4133 [2019-11-24 04:39:10,906 INFO L226 Difference]: Without dead ends: 2951 [2019-11-24 04:39:10,910 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:39:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-11-24 04:39:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2951. [2019-11-24 04:39:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2019-11-24 04:39:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 5475 transitions. [2019-11-24 04:39:11,050 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 5475 transitions. Word has length 21 [2019-11-24 04:39:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:11,051 INFO L462 AbstractCegarLoop]: Abstraction has 2951 states and 5475 transitions. [2019-11-24 04:39:11,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:39:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 5475 transitions. [2019-11-24 04:39:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:39:11,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:11,053 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] [2019-11-24 04:39:11,053 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:39:11,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash -85088217, now seen corresponding path program 1 times [2019-11-24 04:39:11,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:11,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651639809] [2019-11-24 04:39:11,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:11,333 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:39:11,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651639809] [2019-11-24 04:39:11,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:11,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:39:11,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072105101] [2019-11-24 04:39:11,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:39:11,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:11,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:39:11,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:11,336 INFO L87 Difference]: Start difference. First operand 2951 states and 5475 transitions. Second operand 7 states. [2019-11-24 04:39:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:12,904 INFO L93 Difference]: Finished difference Result 7975 states and 14835 transitions. [2019-11-24 04:39:12,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:39:12,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-24 04:39:12,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:12,937 INFO L225 Difference]: With dead ends: 7975 [2019-11-24 04:39:12,937 INFO L226 Difference]: Without dead ends: 5627 [2019-11-24 04:39:12,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:39:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2019-11-24 04:39:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 5293. [2019-11-24 04:39:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2019-11-24 04:39:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 9802 transitions. [2019-11-24 04:39:13,482 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 9802 transitions. Word has length 22 [2019-11-24 04:39:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:13,485 INFO L462 AbstractCegarLoop]: Abstraction has 5293 states and 9802 transitions. [2019-11-24 04:39:13,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:39:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 9802 transitions. [2019-11-24 04:39:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:39:13,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:13,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:39:13,491 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:39:13,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:13,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1498348952, now seen corresponding path program 1 times [2019-11-24 04:39:13,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:13,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940376516] [2019-11-24 04:39:13,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:13,630 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:39:13,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940376516] [2019-11-24 04:39:13,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:13,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:39:13,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894607385] [2019-11-24 04:39:13,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:39:13,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:13,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:39:13,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:39:13,636 INFO L87 Difference]: Start difference. First operand 5293 states and 9802 transitions. Second operand 5 states. [2019-11-24 04:39:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:14,252 INFO L93 Difference]: Finished difference Result 9938 states and 18405 transitions. [2019-11-24 04:39:14,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:14,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-24 04:39:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:14,275 INFO L225 Difference]: With dead ends: 9938 [2019-11-24 04:39:14,275 INFO L226 Difference]: Without dead ends: 7596 [2019-11-24 04:39:14,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:39:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7596 states. [2019-11-24 04:39:14,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7596 to 5293. [2019-11-24 04:39:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2019-11-24 04:39:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 9794 transitions. [2019-11-24 04:39:14,663 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 9794 transitions. Word has length 22 [2019-11-24 04:39:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:14,664 INFO L462 AbstractCegarLoop]: Abstraction has 5293 states and 9794 transitions. [2019-11-24 04:39:14,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:39:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 9794 transitions. [2019-11-24 04:39:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:39:14,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:14,666 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] [2019-11-24 04:39:14,666 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:39:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash 28202243, now seen corresponding path program 1 times [2019-11-24 04:39:14,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:14,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966558051] [2019-11-24 04:39:14,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:14,962 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:39:14,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966558051] [2019-11-24 04:39:14,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:14,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:39:14,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154351445] [2019-11-24 04:39:14,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:39:14,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:39:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:39:14,964 INFO L87 Difference]: Start difference. First operand 5293 states and 9794 transitions. Second operand 6 states. [2019-11-24 04:39:16,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:16,011 INFO L93 Difference]: Finished difference Result 5647 states and 10427 transitions. [2019-11-24 04:39:16,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:39:16,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-24 04:39:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:16,029 INFO L225 Difference]: With dead ends: 5647 [2019-11-24 04:39:16,030 INFO L226 Difference]: Without dead ends: 5634 [2019-11-24 04:39:16,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:39:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5634 states. [2019-11-24 04:39:16,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5634 to 5293. [2019-11-24 04:39:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2019-11-24 04:39:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 9790 transitions. [2019-11-24 04:39:16,344 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 9790 transitions. Word has length 22 [2019-11-24 04:39:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:16,345 INFO L462 AbstractCegarLoop]: Abstraction has 5293 states and 9790 transitions. [2019-11-24 04:39:16,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:39:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 9790 transitions. [2019-11-24 04:39:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:39:16,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:16,351 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] [2019-11-24 04:39:16,351 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:39:16,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1621021562, now seen corresponding path program 1 times [2019-11-24 04:39:16,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:16,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609400832] [2019-11-24 04:39:16,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:16,591 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:39:16,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609400832] [2019-11-24 04:39:16,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:39:16,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 04:39:16,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813117534] [2019-11-24 04:39:16,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:39:16,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:39:16,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:39:16,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:39:16,593 INFO L87 Difference]: Start difference. First operand 5293 states and 9790 transitions. Second operand 8 states. [2019-11-24 04:39:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:39:20,323 INFO L93 Difference]: Finished difference Result 14676 states and 27212 transitions. [2019-11-24 04:39:20,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:39:20,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-11-24 04:39:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:39:20,344 INFO L225 Difference]: With dead ends: 14676 [2019-11-24 04:39:20,344 INFO L226 Difference]: Without dead ends: 10000 [2019-11-24 04:39:20,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:39:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10000 states. [2019-11-24 04:39:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10000 to 7647. [2019-11-24 04:39:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7647 states. [2019-11-24 04:39:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7647 states to 7647 states and 14182 transitions. [2019-11-24 04:39:20,889 INFO L78 Accepts]: Start accepts. Automaton has 7647 states and 14182 transitions. Word has length 36 [2019-11-24 04:39:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:39:20,889 INFO L462 AbstractCegarLoop]: Abstraction has 7647 states and 14182 transitions. [2019-11-24 04:39:20,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:39:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7647 states and 14182 transitions. [2019-11-24 04:39:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:39:20,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:39:20,898 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] [2019-11-24 04:39:20,898 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:39:20,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:39:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1614632176, now seen corresponding path program 1 times [2019-11-24 04:39:20,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:39:20,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894036451] [2019-11-24 04:39:20,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:39:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:21,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894036451] [2019-11-24 04:39:21,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871205731] [2019-11-24 04:39:21,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:39:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:39:21,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:39:21,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:39:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:21,623 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:39:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:39:21,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1774358937] [2019-11-24 04:39:21,747 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2019-11-24 04:39:21,747 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:39:21,754 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:39:21,767 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:39:21,768 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs