/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_spec9_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:47:20,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:47:20,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:47:20,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:47:20,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:47:20,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:47:20,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:47:20,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:47:20,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:47:20,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:47:20,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:47:20,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:47:20,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:47:20,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:47:20,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:47:20,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:47:20,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:47:20,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:47:20,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:47:20,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:47:20,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:47:20,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:47:20,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:47:20,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:47:20,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:47:20,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:47:20,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:47:20,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:47:20,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:47:20,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:47:20,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:47:20,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:47:20,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:47:20,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:47:20,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:47:20,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:47:20,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:47:20,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:47:20,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:47:20,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:47:20,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:47:20,775 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:47:20,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:47:20,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:47:20,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:47:20,792 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:47:20,792 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:47:20,792 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:47:20,792 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:47:20,792 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:47:20,793 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:47:20,793 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:47:20,793 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:47:20,793 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:47:20,793 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:47:20,794 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:47:20,794 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:47:20,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:47:20,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:47:20,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:47:20,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:47:20,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:47:20,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:47:20,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:47:20,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:47:20,796 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:47:20,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:47:20,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:47:20,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:47:20,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:47:20,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:47:20,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:47:20,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:47:20,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:47:20,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:47:20,799 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:47:20,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:47:20,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:47:20,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:47:20,799 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:47:21,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:47:21,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:47:21,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:47:21,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:47:21,129 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:47:21,130 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product11.cil.c [2019-11-24 04:47:21,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d012dcc/a814a032f8fa4493a21e3866fd57014b/FLAG5a0c4884b [2019-11-24 04:47:21,882 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:47:21,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product11.cil.c [2019-11-24 04:47:21,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d012dcc/a814a032f8fa4493a21e3866fd57014b/FLAG5a0c4884b [2019-11-24 04:47:22,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d012dcc/a814a032f8fa4493a21e3866fd57014b [2019-11-24 04:47:22,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:47:22,070 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:47:22,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:47:22,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:47:22,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:47:22,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:47:22" (1/1) ... [2019-11-24 04:47:22,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18dbcd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:22, skipping insertion in model container [2019-11-24 04:47:22,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:47:22" (1/1) ... [2019-11-24 04:47:22,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:47:22,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:47:22,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:47:22,894 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:47:23,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:47:23,087 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:47:23,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:23 WrapperNode [2019-11-24 04:47:23,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:47:23,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:47:23,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:47:23,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:47:23,098 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:47:23" (1/1) ... [2019-11-24 04:47:23,136 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:47:23" (1/1) ... [2019-11-24 04:47:23,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:47:23,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:47:23,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:47:23,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:47:23,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:23" (1/1) ... [2019-11-24 04:47:23,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:23" (1/1) ... [2019-11-24 04:47:23,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:23" (1/1) ... [2019-11-24 04:47:23,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:23" (1/1) ... [2019-11-24 04:47:23,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:23" (1/1) ... [2019-11-24 04:47:23,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:23" (1/1) ... [2019-11-24 04:47:23,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:23" (1/1) ... [2019-11-24 04:47:23,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:47:23,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:47:23,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:47:23,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:47:23,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:23" (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:47:23,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:47:23,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:47:23,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:47:23,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:47:49,440 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:47:49,440 INFO L284 CfgBuilder]: Removed 553 assume(true) statements. [2019-11-24 04:47:49,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:47:49 BoogieIcfgContainer [2019-11-24 04:47:49,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:47:49,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:47:49,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:47:49,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:47:49,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:47:22" (1/3) ... [2019-11-24 04:47:49,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c3af5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:47:49, skipping insertion in model container [2019-11-24 04:47:49,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:23" (2/3) ... [2019-11-24 04:47:49,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c3af5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:47:49, skipping insertion in model container [2019-11-24 04:47:49,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:47:49" (3/3) ... [2019-11-24 04:47:49,449 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product11.cil.c [2019-11-24 04:47:49,456 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:47:49,464 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:47:49,474 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:47:49,507 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:47:49,507 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:47:49,508 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:47:49,508 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:47:49,508 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:47:49,508 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:47:49,508 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:47:49,509 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:47:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states. [2019-11-24 04:47:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:47:49,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:49,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:47:49,549 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:47:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash -736299972, now seen corresponding path program 1 times [2019-11-24 04:47:49,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:49,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615615216] [2019-11-24 04:47:49,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:51,286 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:47:51,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615615216] [2019-11-24 04:47:51,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:51,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:47:51,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461417549] [2019-11-24 04:47:51,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:47:51,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:51,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:47:51,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:47:51,312 INFO L87 Difference]: Start difference. First operand 745 states. Second operand 2 states. [2019-11-24 04:47:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:47:51,405 INFO L93 Difference]: Finished difference Result 762 states and 1451 transitions. [2019-11-24 04:47:51,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:47:51,407 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-24 04:47:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:47:51,451 INFO L225 Difference]: With dead ends: 762 [2019-11-24 04:47:51,451 INFO L226 Difference]: Without dead ends: 743 [2019-11-24 04:47:51,458 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:47:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-24 04:47:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2019-11-24 04:47:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-11-24 04:47:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1421 transitions. [2019-11-24 04:47:51,571 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1421 transitions. Word has length 12 [2019-11-24 04:47:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:47:51,572 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1421 transitions. [2019-11-24 04:47:51,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:47:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1421 transitions. [2019-11-24 04:47:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:47:51,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:51,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:47:51,583 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:47:51,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1425056459, now seen corresponding path program 1 times [2019-11-24 04:47:51,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:51,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962448037] [2019-11-24 04:47:51,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:51,817 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:47:51,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962448037] [2019-11-24 04:47:51,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:51,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:47:51,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310867837] [2019-11-24 04:47:51,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:47:51,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:51,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:47:51,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:51,821 INFO L87 Difference]: Start difference. First operand 743 states and 1421 transitions. Second operand 3 states. [2019-11-24 04:47:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:47:52,126 INFO L93 Difference]: Finished difference Result 1318 states and 2513 transitions. [2019-11-24 04:47:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:47:52,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 04:47:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:47:52,135 INFO L225 Difference]: With dead ends: 1318 [2019-11-24 04:47:52,136 INFO L226 Difference]: Without dead ends: 937 [2019-11-24 04:47:52,143 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:47:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-11-24 04:47:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 900. [2019-11-24 04:47:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-11-24 04:47:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1717 transitions. [2019-11-24 04:47:52,179 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1717 transitions. Word has length 13 [2019-11-24 04:47:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:47:52,179 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1717 transitions. [2019-11-24 04:47:52,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:47:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1717 transitions. [2019-11-24 04:47:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:47:52,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:52,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:47:52,184 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:47:52,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:52,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1227059709, now seen corresponding path program 1 times [2019-11-24 04:47:52,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:52,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099301945] [2019-11-24 04:47:52,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:52,298 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:47:52,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099301945] [2019-11-24 04:47:52,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:52,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:47:52,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056321804] [2019-11-24 04:47:52,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:47:52,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:52,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:47:52,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:52,300 INFO L87 Difference]: Start difference. First operand 900 states and 1717 transitions. Second operand 3 states. [2019-11-24 04:47:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:47:52,560 INFO L93 Difference]: Finished difference Result 1841 states and 3505 transitions. [2019-11-24 04:47:52,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:47:52,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-24 04:47:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:47:52,570 INFO L225 Difference]: With dead ends: 1841 [2019-11-24 04:47:52,570 INFO L226 Difference]: Without dead ends: 1316 [2019-11-24 04:47:52,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-11-24 04:47:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1203. [2019-11-24 04:47:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-24 04:47:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 2289 transitions. [2019-11-24 04:47:52,609 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 2289 transitions. Word has length 14 [2019-11-24 04:47:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:47:52,610 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 2289 transitions. [2019-11-24 04:47:52,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:47:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 2289 transitions. [2019-11-24 04:47:52,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:47:52,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:52,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:47:52,612 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:47:52,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:52,612 INFO L82 PathProgramCache]: Analyzing trace with hash 615872254, now seen corresponding path program 1 times [2019-11-24 04:47:52,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:52,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32769802] [2019-11-24 04:47:52,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:52,705 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:47:52,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32769802] [2019-11-24 04:47:52,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:52,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:47:52,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349522767] [2019-11-24 04:47:52,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:47:52,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:52,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:47:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:52,709 INFO L87 Difference]: Start difference. First operand 1203 states and 2289 transitions. Second operand 3 states. [2019-11-24 04:47:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:47:52,950 INFO L93 Difference]: Finished difference Result 2018 states and 3835 transitions. [2019-11-24 04:47:52,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:47:52,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:47:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:47:52,964 INFO L225 Difference]: With dead ends: 2018 [2019-11-24 04:47:52,964 INFO L226 Difference]: Without dead ends: 1201 [2019-11-24 04:47:52,967 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:47:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-11-24 04:47:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2019-11-24 04:47:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2019-11-24 04:47:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2279 transitions. [2019-11-24 04:47:53,028 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2279 transitions. Word has length 15 [2019-11-24 04:47:53,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:47:53,029 INFO L462 AbstractCegarLoop]: Abstraction has 1201 states and 2279 transitions. [2019-11-24 04:47:53,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:47:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2279 transitions. [2019-11-24 04:47:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:47:53,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:53,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:47:53,032 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:47:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1912188268, now seen corresponding path program 1 times [2019-11-24 04:47:53,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:53,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591086360] [2019-11-24 04:47:53,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:53,157 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:47:53,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591086360] [2019-11-24 04:47:53,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:53,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:47:53,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222808923] [2019-11-24 04:47:53,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:47:53,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:53,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:47:53,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:53,162 INFO L87 Difference]: Start difference. First operand 1201 states and 2279 transitions. Second operand 3 states. [2019-11-24 04:47:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:47:53,517 INFO L93 Difference]: Finished difference Result 2757 states and 5222 transitions. [2019-11-24 04:47:53,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:47:53,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 04:47:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:47:53,529 INFO L225 Difference]: With dead ends: 2757 [2019-11-24 04:47:53,529 INFO L226 Difference]: Without dead ends: 1945 [2019-11-24 04:47:53,532 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:47:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2019-11-24 04:47:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1793. [2019-11-24 04:47:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2019-11-24 04:47:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 3388 transitions. [2019-11-24 04:47:53,612 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 3388 transitions. Word has length 16 [2019-11-24 04:47:53,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:47:53,613 INFO L462 AbstractCegarLoop]: Abstraction has 1793 states and 3388 transitions. [2019-11-24 04:47:53,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:47:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3388 transitions. [2019-11-24 04:47:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:47:53,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:53,615 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:47:53,615 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:47:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -851688249, now seen corresponding path program 1 times [2019-11-24 04:47:53,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:53,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650812914] [2019-11-24 04:47:53,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:53,724 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:47:53,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650812914] [2019-11-24 04:47:53,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:53,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:47:53,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969573679] [2019-11-24 04:47:53,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:47:53,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:47:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:53,726 INFO L87 Difference]: Start difference. First operand 1793 states and 3388 transitions. Second operand 3 states. [2019-11-24 04:47:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:47:53,996 INFO L93 Difference]: Finished difference Result 1793 states and 3388 transitions. [2019-11-24 04:47:53,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:47:53,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:47:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:47:54,008 INFO L225 Difference]: With dead ends: 1793 [2019-11-24 04:47:54,008 INFO L226 Difference]: Without dead ends: 1786 [2019-11-24 04:47:54,010 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:47:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2019-11-24 04:47:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1786. [2019-11-24 04:47:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2019-11-24 04:47:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 3376 transitions. [2019-11-24 04:47:54,081 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 3376 transitions. Word has length 17 [2019-11-24 04:47:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:47:54,082 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 3376 transitions. [2019-11-24 04:47:54,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:47:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 3376 transitions. [2019-11-24 04:47:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 04:47:54,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:54,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:47:54,088 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:47:54,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:54,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1104201631, now seen corresponding path program 1 times [2019-11-24 04:47:54,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:54,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243933148] [2019-11-24 04:47:54,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:54,323 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:47:54,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243933148] [2019-11-24 04:47:54,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:54,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:47:54,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456143051] [2019-11-24 04:47:54,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:47:54,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:54,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:47:54,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:54,325 INFO L87 Difference]: Start difference. First operand 1786 states and 3376 transitions. Second operand 3 states. [2019-11-24 04:47:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:47:55,591 INFO L93 Difference]: Finished difference Result 4554 states and 8566 transitions. [2019-11-24 04:47:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:47:55,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 04:47:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:47:55,611 INFO L225 Difference]: With dead ends: 4554 [2019-11-24 04:47:55,611 INFO L226 Difference]: Without dead ends: 2959 [2019-11-24 04:47:55,618 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:47:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2019-11-24 04:47:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1746. [2019-11-24 04:47:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1746 states. [2019-11-24 04:47:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 3276 transitions. [2019-11-24 04:47:55,745 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 3276 transitions. Word has length 29 [2019-11-24 04:47:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:47:55,745 INFO L462 AbstractCegarLoop]: Abstraction has 1746 states and 3276 transitions. [2019-11-24 04:47:55,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:47:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 3276 transitions. [2019-11-24 04:47:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:47:55,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:55,747 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] [2019-11-24 04:47:55,747 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:47:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash -654709711, now seen corresponding path program 1 times [2019-11-24 04:47:55,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:55,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75954672] [2019-11-24 04:47:55,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:56,135 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:47:56,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75954672] [2019-11-24 04:47:56,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:56,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:47:56,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142149120] [2019-11-24 04:47:56,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:47:56,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:56,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:47:56,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:56,139 INFO L87 Difference]: Start difference. First operand 1746 states and 3276 transitions. Second operand 3 states. [2019-11-24 04:47:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:47:57,110 INFO L93 Difference]: Finished difference Result 4460 states and 8352 transitions. [2019-11-24 04:47:57,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:47:57,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-24 04:47:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:47:57,127 INFO L225 Difference]: With dead ends: 4460 [2019-11-24 04:47:57,127 INFO L226 Difference]: Without dead ends: 2927 [2019-11-24 04:47:57,130 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:47:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2019-11-24 04:47:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1716. [2019-11-24 04:47:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2019-11-24 04:47:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 3186 transitions. [2019-11-24 04:47:57,221 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 3186 transitions. Word has length 30 [2019-11-24 04:47:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:47:57,222 INFO L462 AbstractCegarLoop]: Abstraction has 1716 states and 3186 transitions. [2019-11-24 04:47:57,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:47:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 3186 transitions. [2019-11-24 04:47:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:47:57,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:57,225 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:47:57,225 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:47:57,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1413403766, now seen corresponding path program 1 times [2019-11-24 04:47:57,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:57,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380628361] [2019-11-24 04:47:57,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:57,450 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:47:57,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380628361] [2019-11-24 04:47:57,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:57,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:47:57,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053159211] [2019-11-24 04:47:57,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:47:57,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:57,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:47:57,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:57,454 INFO L87 Difference]: Start difference. First operand 1716 states and 3186 transitions. Second operand 3 states. [2019-11-24 04:47:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:47:58,296 INFO L93 Difference]: Finished difference Result 4381 states and 8153 transitions. [2019-11-24 04:47:58,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:47:58,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 04:47:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:47:58,312 INFO L225 Difference]: With dead ends: 4381 [2019-11-24 04:47:58,312 INFO L226 Difference]: Without dead ends: 2905 [2019-11-24 04:47:58,315 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:47:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2019-11-24 04:47:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1696. [2019-11-24 04:47:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2019-11-24 04:47:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 3106 transitions. [2019-11-24 04:47:58,400 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 3106 transitions. Word has length 32 [2019-11-24 04:47:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:47:58,400 INFO L462 AbstractCegarLoop]: Abstraction has 1696 states and 3106 transitions. [2019-11-24 04:47:58,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:47:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 3106 transitions. [2019-11-24 04:47:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:47:58,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:58,403 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] [2019-11-24 04:47:58,403 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:47:58,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:58,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1774494251, now seen corresponding path program 1 times [2019-11-24 04:47:58,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:58,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468271445] [2019-11-24 04:47:58,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:58,590 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:47:58,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468271445] [2019-11-24 04:47:58,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:58,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:47:58,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960323785] [2019-11-24 04:47:58,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:47:58,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:58,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:47:58,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:58,593 INFO L87 Difference]: Start difference. First operand 1696 states and 3106 transitions. Second operand 3 states. [2019-11-24 04:47:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:47:59,316 INFO L93 Difference]: Finished difference Result 4317 states and 7969 transitions. [2019-11-24 04:47:59,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:47:59,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:47:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:47:59,332 INFO L225 Difference]: With dead ends: 4317 [2019-11-24 04:47:59,332 INFO L226 Difference]: Without dead ends: 2893 [2019-11-24 04:47:59,335 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:47:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2019-11-24 04:47:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1686. [2019-11-24 04:47:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-11-24 04:47:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 3036 transitions. [2019-11-24 04:47:59,429 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 3036 transitions. Word has length 35 [2019-11-24 04:47:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:47:59,430 INFO L462 AbstractCegarLoop]: Abstraction has 1686 states and 3036 transitions. [2019-11-24 04:47:59,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:47:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 3036 transitions. [2019-11-24 04:47:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:47:59,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:47:59,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:47:59,433 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:47:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:47:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1454746207, now seen corresponding path program 1 times [2019-11-24 04:47:59,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:47:59,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096166072] [2019-11-24 04:47:59,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:47:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:47:59,713 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:47:59,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096166072] [2019-11-24 04:47:59,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:47:59,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:47:59,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303769242] [2019-11-24 04:47:59,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:47:59,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:47:59,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:47:59,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:47:59,716 INFO L87 Difference]: Start difference. First operand 1686 states and 3036 transitions. Second operand 3 states. [2019-11-24 04:48:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:00,344 INFO L93 Difference]: Finished difference Result 3210 states and 5820 transitions. [2019-11-24 04:48:00,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:00,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:48:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:00,353 INFO L225 Difference]: With dead ends: 3210 [2019-11-24 04:48:00,354 INFO L226 Difference]: Without dead ends: 1833 [2019-11-24 04:48:00,357 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:48:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2019-11-24 04:48:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1686. [2019-11-24 04:48:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-11-24 04:48:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2976 transitions. [2019-11-24 04:48:00,439 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2976 transitions. Word has length 39 [2019-11-24 04:48:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:00,439 INFO L462 AbstractCegarLoop]: Abstraction has 1686 states and 2976 transitions. [2019-11-24 04:48:00,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2976 transitions. [2019-11-24 04:48:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:48:00,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:00,442 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] [2019-11-24 04:48:00,442 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:48:00,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:00,443 INFO L82 PathProgramCache]: Analyzing trace with hash -949786566, now seen corresponding path program 1 times [2019-11-24 04:48:00,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:00,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616580048] [2019-11-24 04:48:00,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:00,726 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:48:00,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616580048] [2019-11-24 04:48:00,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:00,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:00,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561242986] [2019-11-24 04:48:00,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:00,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:00,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:00,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:00,728 INFO L87 Difference]: Start difference. First operand 1686 states and 2976 transitions. Second operand 5 states. [2019-11-24 04:48:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:02,025 INFO L93 Difference]: Finished difference Result 6647 states and 12106 transitions. [2019-11-24 04:48:02,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:48:02,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-24 04:48:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:02,038 INFO L225 Difference]: With dead ends: 6647 [2019-11-24 04:48:02,038 INFO L226 Difference]: Without dead ends: 4976 [2019-11-24 04:48:02,042 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:48:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2019-11-24 04:48:02,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 2059. [2019-11-24 04:48:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2019-11-24 04:48:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 3532 transitions. [2019-11-24 04:48:02,191 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 3532 transitions. Word has length 43 [2019-11-24 04:48:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:02,191 INFO L462 AbstractCegarLoop]: Abstraction has 2059 states and 3532 transitions. [2019-11-24 04:48:02,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 3532 transitions. [2019-11-24 04:48:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 04:48:02,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:02,193 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] [2019-11-24 04:48:02,194 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:48:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1035921207, now seen corresponding path program 1 times [2019-11-24 04:48:02,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:02,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759831476] [2019-11-24 04:48:02,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:03,118 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:48:03,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759831476] [2019-11-24 04:48:03,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:03,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:48:03,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84346355] [2019-11-24 04:48:03,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:48:03,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:03,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:48:03,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:48:03,128 INFO L87 Difference]: Start difference. First operand 2059 states and 3532 transitions. Second operand 22 states. [2019-11-24 04:48:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:05,150 INFO L93 Difference]: Finished difference Result 6187 states and 10838 transitions. [2019-11-24 04:48:05,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:05,151 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2019-11-24 04:48:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:05,161 INFO L225 Difference]: With dead ends: 6187 [2019-11-24 04:48:05,161 INFO L226 Difference]: Without dead ends: 4282 [2019-11-24 04:48:05,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:48:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2019-11-24 04:48:05,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 2026. [2019-11-24 04:48:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2019-11-24 04:48:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 3428 transitions. [2019-11-24 04:48:05,348 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 3428 transitions. Word has length 44 [2019-11-24 04:48:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:05,349 INFO L462 AbstractCegarLoop]: Abstraction has 2026 states and 3428 transitions. [2019-11-24 04:48:05,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:48:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 3428 transitions. [2019-11-24 04:48:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:48:05,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:05,351 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:48:05,351 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:48:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2048803905, now seen corresponding path program 1 times [2019-11-24 04:48:05,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:05,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810228228] [2019-11-24 04:48:05,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:06,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:48:06,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810228228] [2019-11-24 04:48:06,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:06,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:48:06,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815075118] [2019-11-24 04:48:06,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:48:06,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:06,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:48:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:48:06,045 INFO L87 Difference]: Start difference. First operand 2026 states and 3428 transitions. Second operand 22 states. [2019-11-24 04:48:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:08,898 INFO L93 Difference]: Finished difference Result 6282 states and 10830 transitions. [2019-11-24 04:48:08,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:08,898 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-11-24 04:48:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:08,907 INFO L225 Difference]: With dead ends: 6282 [2019-11-24 04:48:08,907 INFO L226 Difference]: Without dead ends: 4390 [2019-11-24 04:48:08,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:48:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-11-24 04:48:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2162. [2019-11-24 04:48:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2162 states. [2019-11-24 04:48:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 3580 transitions. [2019-11-24 04:48:09,106 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 3580 transitions. Word has length 45 [2019-11-24 04:48:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:09,106 INFO L462 AbstractCegarLoop]: Abstraction has 2162 states and 3580 transitions. [2019-11-24 04:48:09,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:48:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 3580 transitions. [2019-11-24 04:48:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:48:09,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:09,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:09,109 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:48:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1806093354, now seen corresponding path program 1 times [2019-11-24 04:48:09,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:09,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522037356] [2019-11-24 04:48:09,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:09,796 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:48:09,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522037356] [2019-11-24 04:48:09,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:09,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:48:09,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682077316] [2019-11-24 04:48:09,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:48:09,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:09,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:48:09,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:48:09,797 INFO L87 Difference]: Start difference. First operand 2162 states and 3580 transitions. Second operand 22 states. [2019-11-24 04:48:12,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:12,139 INFO L93 Difference]: Finished difference Result 6098 states and 10164 transitions. [2019-11-24 04:48:12,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:12,140 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-11-24 04:48:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:12,160 INFO L225 Difference]: With dead ends: 6098 [2019-11-24 04:48:12,160 INFO L226 Difference]: Without dead ends: 4062 [2019-11-24 04:48:12,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:48:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2019-11-24 04:48:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 2465. [2019-11-24 04:48:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2019-11-24 04:48:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3992 transitions. [2019-11-24 04:48:12,502 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3992 transitions. Word has length 47 [2019-11-24 04:48:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:12,502 INFO L462 AbstractCegarLoop]: Abstraction has 2465 states and 3992 transitions. [2019-11-24 04:48:12,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:48:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3992 transitions. [2019-11-24 04:48:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 04:48:12,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:12,504 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] [2019-11-24 04:48:12,505 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:48:12,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:12,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2104371286, now seen corresponding path program 1 times [2019-11-24 04:48:12,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:12,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219840485] [2019-11-24 04:48:12,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:12,671 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:48:12,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219840485] [2019-11-24 04:48:12,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:12,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:12,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121576178] [2019-11-24 04:48:12,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:12,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:12,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:12,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:12,674 INFO L87 Difference]: Start difference. First operand 2465 states and 3992 transitions. Second operand 5 states. [2019-11-24 04:48:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:13,681 INFO L93 Difference]: Finished difference Result 6362 states and 10666 transitions. [2019-11-24 04:48:13,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:48:13,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-11-24 04:48:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:13,690 INFO L225 Difference]: With dead ends: 6362 [2019-11-24 04:48:13,690 INFO L226 Difference]: Without dead ends: 4111 [2019-11-24 04:48:13,694 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:48:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2019-11-24 04:48:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 2546. [2019-11-24 04:48:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2019-11-24 04:48:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 4073 transitions. [2019-11-24 04:48:13,963 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 4073 transitions. Word has length 55 [2019-11-24 04:48:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:13,964 INFO L462 AbstractCegarLoop]: Abstraction has 2546 states and 4073 transitions. [2019-11-24 04:48:13,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 4073 transitions. [2019-11-24 04:48:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 04:48:13,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:13,966 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] [2019-11-24 04:48:13,966 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:48:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:13,966 INFO L82 PathProgramCache]: Analyzing trace with hash 476575018, now seen corresponding path program 1 times [2019-11-24 04:48:13,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:13,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141114914] [2019-11-24 04:48:13,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:14,123 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:48:14,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141114914] [2019-11-24 04:48:14,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:14,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:14,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816054251] [2019-11-24 04:48:14,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:14,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:14,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:14,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:14,126 INFO L87 Difference]: Start difference. First operand 2546 states and 4073 transitions. Second operand 5 states. [2019-11-24 04:48:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:15,177 INFO L93 Difference]: Finished difference Result 6443 states and 10707 transitions. [2019-11-24 04:48:15,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:48:15,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-24 04:48:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:15,185 INFO L225 Difference]: With dead ends: 6443 [2019-11-24 04:48:15,186 INFO L226 Difference]: Without dead ends: 4111 [2019-11-24 04:48:15,190 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:48:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2019-11-24 04:48:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 2546. [2019-11-24 04:48:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2019-11-24 04:48:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 4033 transitions. [2019-11-24 04:48:15,488 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 4033 transitions. Word has length 56 [2019-11-24 04:48:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:15,488 INFO L462 AbstractCegarLoop]: Abstraction has 2546 states and 4033 transitions. [2019-11-24 04:48:15,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 4033 transitions. [2019-11-24 04:48:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-24 04:48:15,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:15,490 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] [2019-11-24 04:48:15,490 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:48:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash 637038750, now seen corresponding path program 1 times [2019-11-24 04:48:15,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:15,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120367450] [2019-11-24 04:48:15,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:15,691 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:48:15,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120367450] [2019-11-24 04:48:15,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:15,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:15,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320334953] [2019-11-24 04:48:15,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:15,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:15,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:15,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:15,693 INFO L87 Difference]: Start difference. First operand 2546 states and 4033 transitions. Second operand 5 states. [2019-11-24 04:48:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:16,613 INFO L93 Difference]: Finished difference Result 6503 states and 10708 transitions. [2019-11-24 04:48:16,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:48:16,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-24 04:48:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:16,618 INFO L225 Difference]: With dead ends: 6503 [2019-11-24 04:48:16,619 INFO L226 Difference]: Without dead ends: 4171 [2019-11-24 04:48:16,622 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:48:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2019-11-24 04:48:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 2538. [2019-11-24 04:48:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2538 states. [2019-11-24 04:48:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 4022 transitions. [2019-11-24 04:48:16,832 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 4022 transitions. Word has length 58 [2019-11-24 04:48:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:16,833 INFO L462 AbstractCegarLoop]: Abstraction has 2538 states and 4022 transitions. [2019-11-24 04:48:16,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 4022 transitions. [2019-11-24 04:48:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 04:48:16,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:16,835 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] [2019-11-24 04:48:16,835 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:48:16,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:16,835 INFO L82 PathProgramCache]: Analyzing trace with hash 328254757, now seen corresponding path program 1 times [2019-11-24 04:48:16,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:16,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947702074] [2019-11-24 04:48:16,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:17,068 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:48:17,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947702074] [2019-11-24 04:48:17,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:17,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:48:17,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472959155] [2019-11-24 04:48:17,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:48:17,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:17,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:48:17,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:48:17,071 INFO L87 Difference]: Start difference. First operand 2538 states and 4022 transitions. Second operand 6 states. [2019-11-24 04:48:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:18,462 INFO L93 Difference]: Finished difference Result 7628 states and 12088 transitions. [2019-11-24 04:48:18,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:48:18,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-24 04:48:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:18,468 INFO L225 Difference]: With dead ends: 7628 [2019-11-24 04:48:18,468 INFO L226 Difference]: Without dead ends: 5218 [2019-11-24 04:48:18,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:48:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2019-11-24 04:48:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 2562. [2019-11-24 04:48:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2019-11-24 04:48:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 4052 transitions. [2019-11-24 04:48:18,834 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 4052 transitions. Word has length 61 [2019-11-24 04:48:18,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:18,834 INFO L462 AbstractCegarLoop]: Abstraction has 2562 states and 4052 transitions. [2019-11-24 04:48:18,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:48:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 4052 transitions. [2019-11-24 04:48:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:48:18,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:18,836 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:48:18,837 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:48:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1552447752, now seen corresponding path program 1 times [2019-11-24 04:48:18,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:18,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334470616] [2019-11-24 04:48:18,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:19,045 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:48:19,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334470616] [2019-11-24 04:48:19,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:19,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:19,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931569058] [2019-11-24 04:48:19,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:19,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:19,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:19,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:19,048 INFO L87 Difference]: Start difference. First operand 2562 states and 4052 transitions. Second operand 5 states. [2019-11-24 04:48:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:20,888 INFO L93 Difference]: Finished difference Result 8380 states and 13589 transitions. [2019-11-24 04:48:20,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:48:20,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-24 04:48:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:20,895 INFO L225 Difference]: With dead ends: 8380 [2019-11-24 04:48:20,895 INFO L226 Difference]: Without dead ends: 6032 [2019-11-24 04:48:20,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:48:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2019-11-24 04:48:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 2986. [2019-11-24 04:48:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2019-11-24 04:48:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 4777 transitions. [2019-11-24 04:48:21,331 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 4777 transitions. Word has length 64 [2019-11-24 04:48:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:21,331 INFO L462 AbstractCegarLoop]: Abstraction has 2986 states and 4777 transitions. [2019-11-24 04:48:21,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 4777 transitions. [2019-11-24 04:48:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:48:21,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:21,333 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:48:21,333 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:21,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1912887713, now seen corresponding path program 1 times [2019-11-24 04:48:21,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:21,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811008445] [2019-11-24 04:48:21,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:22,007 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:48:22,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811008445] [2019-11-24 04:48:22,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:22,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-24 04:48:22,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772545908] [2019-11-24 04:48:22,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-24 04:48:22,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:22,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-24 04:48:22,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-11-24 04:48:22,011 INFO L87 Difference]: Start difference. First operand 2986 states and 4777 transitions. Second operand 24 states. [2019-11-24 04:48:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:30,564 INFO L93 Difference]: Finished difference Result 10850 states and 17739 transitions. [2019-11-24 04:48:30,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-24 04:48:30,565 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-11-24 04:48:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:30,575 INFO L225 Difference]: With dead ends: 10850 [2019-11-24 04:48:30,576 INFO L226 Difference]: Without dead ends: 8076 [2019-11-24 04:48:30,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=955, Invalid=3077, Unknown=0, NotChecked=0, Total=4032 [2019-11-24 04:48:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8076 states. [2019-11-24 04:48:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8076 to 5031. [2019-11-24 04:48:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5031 states. [2019-11-24 04:48:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5031 states to 5031 states and 8377 transitions. [2019-11-24 04:48:31,314 INFO L78 Accepts]: Start accepts. Automaton has 5031 states and 8377 transitions. Word has length 64 [2019-11-24 04:48:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:31,314 INFO L462 AbstractCegarLoop]: Abstraction has 5031 states and 8377 transitions. [2019-11-24 04:48:31,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-24 04:48:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5031 states and 8377 transitions. [2019-11-24 04:48:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:48:31,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:31,316 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:48:31,316 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1136801645, now seen corresponding path program 1 times [2019-11-24 04:48:31,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:31,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146706055] [2019-11-24 04:48:31,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:31,497 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:48:31,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146706055] [2019-11-24 04:48:31,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:31,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:31,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695900949] [2019-11-24 04:48:31,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:31,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:31,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:31,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:31,499 INFO L87 Difference]: Start difference. First operand 5031 states and 8377 transitions. Second operand 5 states. [2019-11-24 04:48:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:32,866 INFO L93 Difference]: Finished difference Result 11915 states and 20181 transitions. [2019-11-24 04:48:32,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:48:32,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-24 04:48:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:32,876 INFO L225 Difference]: With dead ends: 11915 [2019-11-24 04:48:32,876 INFO L226 Difference]: Without dead ends: 7098 [2019-11-24 04:48:32,881 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:48:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7098 states. [2019-11-24 04:48:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7098 to 5013. [2019-11-24 04:48:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5013 states. [2019-11-24 04:48:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5013 states to 5013 states and 8350 transitions. [2019-11-24 04:48:33,532 INFO L78 Accepts]: Start accepts. Automaton has 5013 states and 8350 transitions. Word has length 64 [2019-11-24 04:48:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:33,532 INFO L462 AbstractCegarLoop]: Abstraction has 5013 states and 8350 transitions. [2019-11-24 04:48:33,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 5013 states and 8350 transitions. [2019-11-24 04:48:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 04:48:33,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:33,535 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] [2019-11-24 04:48:33,535 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash -513892705, now seen corresponding path program 1 times [2019-11-24 04:48:33,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:33,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234519151] [2019-11-24 04:48:33,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:33,728 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:48:33,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234519151] [2019-11-24 04:48:33,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:33,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:33,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439483393] [2019-11-24 04:48:33,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:33,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:33,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:33,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:33,730 INFO L87 Difference]: Start difference. First operand 5013 states and 8350 transitions. Second operand 5 states. [2019-11-24 04:48:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:36,046 INFO L93 Difference]: Finished difference Result 13010 states and 21497 transitions. [2019-11-24 04:48:36,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:48:36,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-24 04:48:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:36,055 INFO L225 Difference]: With dead ends: 13010 [2019-11-24 04:48:36,056 INFO L226 Difference]: Without dead ends: 8116 [2019-11-24 04:48:36,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:48:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8116 states. [2019-11-24 04:48:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8116 to 5270. [2019-11-24 04:48:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5270 states. [2019-11-24 04:48:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5270 states to 5270 states and 8665 transitions. [2019-11-24 04:48:36,796 INFO L78 Accepts]: Start accepts. Automaton has 5270 states and 8665 transitions. Word has length 66 [2019-11-24 04:48:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:36,796 INFO L462 AbstractCegarLoop]: Abstraction has 5270 states and 8665 transitions. [2019-11-24 04:48:36,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5270 states and 8665 transitions. [2019-11-24 04:48:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:48:36,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:36,799 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:48:36,799 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:36,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:36,799 INFO L82 PathProgramCache]: Analyzing trace with hash 882548983, now seen corresponding path program 1 times [2019-11-24 04:48:36,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:36,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733578906] [2019-11-24 04:48:36,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat