/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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:47:24,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:47:24,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:47:24,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:47:24,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:47:24,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:47:24,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:47:24,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:47:24,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:47:24,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:47:24,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:47:24,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:47:24,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:47:24,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:47:24,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:47:24,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:47:24,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:47:24,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:47:24,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:47:24,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:47:24,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:47:24,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:47:24,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:47:24,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:47:24,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:47:24,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:47:24,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:47:24,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:47:24,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:47:24,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:47:24,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:47:24,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:47:24,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:47:24,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:47:24,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:47:24,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:47:24,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:47:24,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:47:24,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:47:24,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:47:24,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:47:24,856 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 05:47:24,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:47:24,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:47:24,873 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:47:24,873 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:47:24,873 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:47:24,873 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:47:24,873 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:47:24,874 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:47:24,874 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:47:24,874 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:47:24,874 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:47:24,874 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:47:24,875 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:47:24,875 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:47:24,875 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:47:24,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:47:24,876 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:47:24,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:47:24,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:47:24,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:47:24,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:47:24,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:47:24,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:47:24,877 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:47:24,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:47:24,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:47:24,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:47:24,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:47:24,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:47:24,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:47:24,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:47:24,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:47:24,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:47:24,879 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:47:24,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:47:24,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:47:24,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:47:24,880 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:47:25,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:47:25,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:47:25,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:47:25,186 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:47:25,186 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:47:25,186 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-24 05:47:25,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822bc7c34/f97ecf461390486281bf5d41c72e604a/FLAGa5728b769 [2019-11-24 05:47:25,778 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:47:25,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-24 05:47:25,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822bc7c34/f97ecf461390486281bf5d41c72e604a/FLAGa5728b769 [2019-11-24 05:47:26,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822bc7c34/f97ecf461390486281bf5d41c72e604a [2019-11-24 05:47:26,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:47:26,099 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:47:26,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:47:26,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:47:26,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:47:26,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1172b7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26, skipping insertion in model container [2019-11-24 05:47:26,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:47:26,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:47:26,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:47:26,572 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:47:26,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:47:26,681 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:47:26,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26 WrapperNode [2019-11-24 05:47:26,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:47:26,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:47:26,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:47:26,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:47:26,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:47:26,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:47:26,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:47:26,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:47:26,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (1/1) ... [2019-11-24 05:47:26,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:47:26,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:47:26,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:47:26,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:47:26,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (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 05:47:26,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:47:26,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:47:28,180 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:47:28,181 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:47:28,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:47:28 BoogieIcfgContainer [2019-11-24 05:47:28,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:47:28,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:47:28,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:47:28,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:47:28,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:47:26" (1/3) ... [2019-11-24 05:47:28,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37528ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:47:28, skipping insertion in model container [2019-11-24 05:47:28,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:47:26" (2/3) ... [2019-11-24 05:47:28,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37528ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:47:28, skipping insertion in model container [2019-11-24 05:47:28,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:47:28" (3/3) ... [2019-11-24 05:47:28,192 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-24 05:47:28,202 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:47:28,211 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 05:47:28,223 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 05:47:28,262 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:47:28,262 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:47:28,263 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:47:28,263 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:47:28,264 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:47:28,264 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:47:28,264 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:47:28,264 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:47:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2019-11-24 05:47:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 05:47:28,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:28,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:28,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:28,302 INFO L82 PathProgramCache]: Analyzing trace with hash 747651305, now seen corresponding path program 1 times [2019-11-24 05:47:28,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:28,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504677572] [2019-11-24 05:47:28,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:28,772 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 05:47:28,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504677572] [2019-11-24 05:47:28,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:28,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:47:28,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191610283] [2019-11-24 05:47:28,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:28,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:28,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:28,800 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 5 states. [2019-11-24 05:47:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:29,035 INFO L93 Difference]: Finished difference Result 278 states and 446 transitions. [2019-11-24 05:47:29,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:29,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-24 05:47:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:29,051 INFO L225 Difference]: With dead ends: 278 [2019-11-24 05:47:29,051 INFO L226 Difference]: Without dead ends: 208 [2019-11-24 05:47:29,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:29,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-24 05:47:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2019-11-24 05:47:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-24 05:47:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 272 transitions. [2019-11-24 05:47:29,120 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 272 transitions. Word has length 41 [2019-11-24 05:47:29,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:29,121 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 272 transitions. [2019-11-24 05:47:29,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 272 transitions. [2019-11-24 05:47:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 05:47:29,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:29,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:29,125 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:29,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash 534462386, now seen corresponding path program 1 times [2019-11-24 05:47:29,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:29,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265794474] [2019-11-24 05:47:29,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:29,215 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 05:47:29,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265794474] [2019-11-24 05:47:29,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:29,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:47:29,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954421591] [2019-11-24 05:47:29,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:29,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:29,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:29,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:29,219 INFO L87 Difference]: Start difference. First operand 204 states and 272 transitions. Second operand 5 states. [2019-11-24 05:47:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:29,520 INFO L93 Difference]: Finished difference Result 456 states and 622 transitions. [2019-11-24 05:47:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:29,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-24 05:47:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:29,523 INFO L225 Difference]: With dead ends: 456 [2019-11-24 05:47:29,523 INFO L226 Difference]: Without dead ends: 292 [2019-11-24 05:47:29,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-24 05:47:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2019-11-24 05:47:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-11-24 05:47:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 391 transitions. [2019-11-24 05:47:29,560 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 391 transitions. Word has length 42 [2019-11-24 05:47:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:29,561 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 391 transitions. [2019-11-24 05:47:29,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 391 transitions. [2019-11-24 05:47:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 05:47:29,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:29,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:29,563 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:29,564 INFO L82 PathProgramCache]: Analyzing trace with hash 490863489, now seen corresponding path program 1 times [2019-11-24 05:47:29,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:29,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170574608] [2019-11-24 05:47:29,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:29,688 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 05:47:29,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170574608] [2019-11-24 05:47:29,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:29,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:47:29,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952142663] [2019-11-24 05:47:29,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:29,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:29,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:29,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:29,692 INFO L87 Difference]: Start difference. First operand 290 states and 391 transitions. Second operand 5 states. [2019-11-24 05:47:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:29,916 INFO L93 Difference]: Finished difference Result 689 states and 953 transitions. [2019-11-24 05:47:29,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:29,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-24 05:47:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:29,925 INFO L225 Difference]: With dead ends: 689 [2019-11-24 05:47:29,925 INFO L226 Difference]: Without dead ends: 464 [2019-11-24 05:47:29,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-24 05:47:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 462. [2019-11-24 05:47:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-24 05:47:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 626 transitions. [2019-11-24 05:47:29,998 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 626 transitions. Word has length 42 [2019-11-24 05:47:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:29,999 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 626 transitions. [2019-11-24 05:47:29,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 626 transitions. [2019-11-24 05:47:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 05:47:30,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:30,011 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 05:47:30,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:30,012 INFO L82 PathProgramCache]: Analyzing trace with hash 895798333, now seen corresponding path program 1 times [2019-11-24 05:47:30,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:30,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170281309] [2019-11-24 05:47:30,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:30,112 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 05:47:30,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170281309] [2019-11-24 05:47:30,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:30,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:47:30,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765195974] [2019-11-24 05:47:30,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:47:30,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:30,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:47:30,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:47:30,115 INFO L87 Difference]: Start difference. First operand 462 states and 626 transitions. Second operand 5 states. [2019-11-24 05:47:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:30,320 INFO L93 Difference]: Finished difference Result 848 states and 1166 transitions. [2019-11-24 05:47:30,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:47:30,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-24 05:47:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:30,324 INFO L225 Difference]: With dead ends: 848 [2019-11-24 05:47:30,324 INFO L226 Difference]: Without dead ends: 462 [2019-11-24 05:47:30,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-11-24 05:47:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2019-11-24 05:47:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-24 05:47:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 625 transitions. [2019-11-24 05:47:30,370 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 625 transitions. Word has length 43 [2019-11-24 05:47:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:30,372 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 625 transitions. [2019-11-24 05:47:30,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:47:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 625 transitions. [2019-11-24 05:47:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 05:47:30,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:30,379 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 05:47:30,380 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:30,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1477179683, now seen corresponding path program 1 times [2019-11-24 05:47:30,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:30,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208191711] [2019-11-24 05:47:30,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:30,642 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 05:47:30,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208191711] [2019-11-24 05:47:30,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:30,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:47:30,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989992182] [2019-11-24 05:47:30,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:47:30,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:30,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:47:30,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:47:30,646 INFO L87 Difference]: Start difference. First operand 462 states and 625 transitions. Second operand 10 states. [2019-11-24 05:47:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:31,172 INFO L93 Difference]: Finished difference Result 961 states and 1304 transitions. [2019-11-24 05:47:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:47:31,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-11-24 05:47:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:31,177 INFO L225 Difference]: With dead ends: 961 [2019-11-24 05:47:31,177 INFO L226 Difference]: Without dead ends: 805 [2019-11-24 05:47:31,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:47:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-24 05:47:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 572. [2019-11-24 05:47:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-11-24 05:47:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 770 transitions. [2019-11-24 05:47:31,225 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 770 transitions. Word has length 43 [2019-11-24 05:47:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:31,226 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 770 transitions. [2019-11-24 05:47:31,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:47:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 770 transitions. [2019-11-24 05:47:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 05:47:31,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:31,227 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 05:47:31,227 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:31,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:31,228 INFO L82 PathProgramCache]: Analyzing trace with hash 63638205, now seen corresponding path program 1 times [2019-11-24 05:47:31,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:31,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772133428] [2019-11-24 05:47:31,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:31,409 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 05:47:31,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772133428] [2019-11-24 05:47:31,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:31,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:47:31,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483592970] [2019-11-24 05:47:31,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:47:31,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:31,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:47:31,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:47:31,412 INFO L87 Difference]: Start difference. First operand 572 states and 770 transitions. Second operand 10 states. [2019-11-24 05:47:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:31,982 INFO L93 Difference]: Finished difference Result 1066 states and 1431 transitions. [2019-11-24 05:47:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 05:47:31,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-11-24 05:47:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:31,987 INFO L225 Difference]: With dead ends: 1066 [2019-11-24 05:47:31,987 INFO L226 Difference]: Without dead ends: 1018 [2019-11-24 05:47:31,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-11-24 05:47:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2019-11-24 05:47:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 710. [2019-11-24 05:47:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2019-11-24 05:47:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 950 transitions. [2019-11-24 05:47:32,045 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 950 transitions. Word has length 43 [2019-11-24 05:47:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:32,045 INFO L462 AbstractCegarLoop]: Abstraction has 710 states and 950 transitions. [2019-11-24 05:47:32,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:47:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 950 transitions. [2019-11-24 05:47:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 05:47:32,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:32,047 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 05:47:32,047 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:32,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1807632419, now seen corresponding path program 1 times [2019-11-24 05:47:32,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:32,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143332786] [2019-11-24 05:47:32,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:32,215 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 05:47:32,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143332786] [2019-11-24 05:47:32,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:32,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:47:32,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358184505] [2019-11-24 05:47:32,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:47:32,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:32,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:47:32,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:47:32,217 INFO L87 Difference]: Start difference. First operand 710 states and 950 transitions. Second operand 10 states. [2019-11-24 05:47:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:33,177 INFO L93 Difference]: Finished difference Result 2670 states and 3739 transitions. [2019-11-24 05:47:33,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 05:47:33,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-24 05:47:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:33,193 INFO L225 Difference]: With dead ends: 2670 [2019-11-24 05:47:33,194 INFO L226 Difference]: Without dead ends: 2324 [2019-11-24 05:47:33,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:47:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-11-24 05:47:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 1547. [2019-11-24 05:47:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-11-24 05:47:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2110 transitions. [2019-11-24 05:47:33,367 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2110 transitions. Word has length 44 [2019-11-24 05:47:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:33,368 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 2110 transitions. [2019-11-24 05:47:33,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:47:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2110 transitions. [2019-11-24 05:47:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 05:47:33,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:33,369 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 05:47:33,369 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash 894772145, now seen corresponding path program 1 times [2019-11-24 05:47:33,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:33,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22001190] [2019-11-24 05:47:33,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:33,605 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 05:47:33,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22001190] [2019-11-24 05:47:33,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:33,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:47:33,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801067672] [2019-11-24 05:47:33,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:47:33,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:33,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:47:33,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:47:33,608 INFO L87 Difference]: Start difference. First operand 1547 states and 2110 transitions. Second operand 12 states. [2019-11-24 05:47:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:34,722 INFO L93 Difference]: Finished difference Result 3472 states and 4758 transitions. [2019-11-24 05:47:34,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:47:34,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-24 05:47:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:34,738 INFO L225 Difference]: With dead ends: 3472 [2019-11-24 05:47:34,739 INFO L226 Difference]: Without dead ends: 3324 [2019-11-24 05:47:34,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=302, Unknown=0, NotChecked=0, Total=462 [2019-11-24 05:47:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2019-11-24 05:47:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 1556. [2019-11-24 05:47:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-11-24 05:47:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2118 transitions. [2019-11-24 05:47:34,903 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2118 transitions. Word has length 45 [2019-11-24 05:47:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:34,904 INFO L462 AbstractCegarLoop]: Abstraction has 1556 states and 2118 transitions. [2019-11-24 05:47:34,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:47:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2118 transitions. [2019-11-24 05:47:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 05:47:34,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:34,905 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:34,905 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:34,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash -742578281, now seen corresponding path program 1 times [2019-11-24 05:47:34,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:34,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543090143] [2019-11-24 05:47:34,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:35,096 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 05:47:35,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543090143] [2019-11-24 05:47:35,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:35,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:47:35,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476873064] [2019-11-24 05:47:35,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:47:35,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:35,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:47:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:47:35,100 INFO L87 Difference]: Start difference. First operand 1556 states and 2118 transitions. Second operand 12 states. [2019-11-24 05:47:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:36,103 INFO L93 Difference]: Finished difference Result 4828 states and 6700 transitions. [2019-11-24 05:47:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:47:36,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-11-24 05:47:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:36,120 INFO L225 Difference]: With dead ends: 4828 [2019-11-24 05:47:36,120 INFO L226 Difference]: Without dead ends: 3650 [2019-11-24 05:47:36,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-11-24 05:47:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states. [2019-11-24 05:47:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 2509. [2019-11-24 05:47:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2509 states. [2019-11-24 05:47:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3455 transitions. [2019-11-24 05:47:36,421 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3455 transitions. Word has length 46 [2019-11-24 05:47:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:36,422 INFO L462 AbstractCegarLoop]: Abstraction has 2509 states and 3455 transitions. [2019-11-24 05:47:36,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:47:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3455 transitions. [2019-11-24 05:47:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 05:47:36,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:36,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:36,423 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:36,424 INFO L82 PathProgramCache]: Analyzing trace with hash 798239607, now seen corresponding path program 1 times [2019-11-24 05:47:36,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:36,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368692914] [2019-11-24 05:47:36,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:36,679 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 05:47:36,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368692914] [2019-11-24 05:47:36,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:36,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-24 05:47:36,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632570653] [2019-11-24 05:47:36,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:47:36,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:36,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:47:36,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:47:36,683 INFO L87 Difference]: Start difference. First operand 2509 states and 3455 transitions. Second operand 12 states. [2019-11-24 05:47:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:38,000 INFO L93 Difference]: Finished difference Result 3645 states and 5019 transitions. [2019-11-24 05:47:38,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-24 05:47:38,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-11-24 05:47:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:38,020 INFO L225 Difference]: With dead ends: 3645 [2019-11-24 05:47:38,020 INFO L226 Difference]: Without dead ends: 3299 [2019-11-24 05:47:38,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-11-24 05:47:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2019-11-24 05:47:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 2524. [2019-11-24 05:47:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2019-11-24 05:47:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3470 transitions. [2019-11-24 05:47:38,400 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 3470 transitions. Word has length 46 [2019-11-24 05:47:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:38,400 INFO L462 AbstractCegarLoop]: Abstraction has 2524 states and 3470 transitions. [2019-11-24 05:47:38,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:47:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3470 transitions. [2019-11-24 05:47:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 05:47:38,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:38,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:38,402 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash -383027878, now seen corresponding path program 1 times [2019-11-24 05:47:38,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:38,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538752612] [2019-11-24 05:47:38,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:38,441 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 05:47:38,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538752612] [2019-11-24 05:47:38,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:38,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:38,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105090961] [2019-11-24 05:47:38,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:38,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:38,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:38,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:38,443 INFO L87 Difference]: Start difference. First operand 2524 states and 3470 transitions. Second operand 3 states. [2019-11-24 05:47:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:38,803 INFO L93 Difference]: Finished difference Result 4429 states and 6136 transitions. [2019-11-24 05:47:38,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:38,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-24 05:47:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:38,817 INFO L225 Difference]: With dead ends: 4429 [2019-11-24 05:47:38,818 INFO L226 Difference]: Without dead ends: 2449 [2019-11-24 05:47:38,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2019-11-24 05:47:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2396. [2019-11-24 05:47:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2396 states. [2019-11-24 05:47:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3287 transitions. [2019-11-24 05:47:39,216 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3287 transitions. Word has length 46 [2019-11-24 05:47:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:39,217 INFO L462 AbstractCegarLoop]: Abstraction has 2396 states and 3287 transitions. [2019-11-24 05:47:39,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3287 transitions. [2019-11-24 05:47:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 05:47:39,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:39,219 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 05:47:39,219 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1494234551, now seen corresponding path program 1 times [2019-11-24 05:47:39,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:39,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300635445] [2019-11-24 05:47:39,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:39,259 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 05:47:39,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300635445] [2019-11-24 05:47:39,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:39,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:39,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995976967] [2019-11-24 05:47:39,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:39,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:39,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:39,264 INFO L87 Difference]: Start difference. First operand 2396 states and 3287 transitions. Second operand 3 states. [2019-11-24 05:47:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:39,539 INFO L93 Difference]: Finished difference Result 4113 states and 5694 transitions. [2019-11-24 05:47:39,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:39,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-24 05:47:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:39,549 INFO L225 Difference]: With dead ends: 4113 [2019-11-24 05:47:39,549 INFO L226 Difference]: Without dead ends: 2167 [2019-11-24 05:47:39,553 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 05:47:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2019-11-24 05:47:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2163. [2019-11-24 05:47:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-11-24 05:47:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2969 transitions. [2019-11-24 05:47:40,017 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2969 transitions. Word has length 47 [2019-11-24 05:47:40,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:40,017 INFO L462 AbstractCegarLoop]: Abstraction has 2163 states and 2969 transitions. [2019-11-24 05:47:40,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2969 transitions. [2019-11-24 05:47:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 05:47:40,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:40,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:40,019 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:40,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1822884373, now seen corresponding path program 1 times [2019-11-24 05:47:40,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:40,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528251796] [2019-11-24 05:47:40,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:41,273 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-11-24 05:47:41,574 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2019-11-24 05:47:42,023 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 05:47:42,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528251796] [2019-11-24 05:47:42,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:42,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-24 05:47:42,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112852500] [2019-11-24 05:47:42,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-24 05:47:42,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-24 05:47:42,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-11-24 05:47:42,026 INFO L87 Difference]: Start difference. First operand 2163 states and 2969 transitions. Second operand 24 states. [2019-11-24 05:47:42,914 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-11-24 05:47:43,092 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-24 05:47:43,364 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-11-24 05:47:43,665 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-11-24 05:47:43,996 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-11-24 05:47:44,403 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-11-24 05:47:44,800 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2019-11-24 05:47:45,242 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 96 [2019-11-24 05:47:45,582 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-11-24 05:47:46,071 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-11-24 05:47:47,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:47,595 INFO L93 Difference]: Finished difference Result 3995 states and 5524 transitions. [2019-11-24 05:47:47,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-24 05:47:47,595 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-11-24 05:47:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:47,608 INFO L225 Difference]: With dead ends: 3995 [2019-11-24 05:47:47,608 INFO L226 Difference]: Without dead ends: 3681 [2019-11-24 05:47:47,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=508, Invalid=1384, Unknown=0, NotChecked=0, Total=1892 [2019-11-24 05:47:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2019-11-24 05:47:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 2151. [2019-11-24 05:47:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2151 states. [2019-11-24 05:47:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 2956 transitions. [2019-11-24 05:47:47,841 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 2956 transitions. Word has length 48 [2019-11-24 05:47:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:47,842 INFO L462 AbstractCegarLoop]: Abstraction has 2151 states and 2956 transitions. [2019-11-24 05:47:47,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-24 05:47:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2956 transitions. [2019-11-24 05:47:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:47,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:47,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:47,843 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:47,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:47,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1188779576, now seen corresponding path program 1 times [2019-11-24 05:47:47,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:47,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46626688] [2019-11-24 05:47:47,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:47,895 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 05:47:47,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46626688] [2019-11-24 05:47:47,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:47,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:47,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744643438] [2019-11-24 05:47:47,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:47,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:47,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:47,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:47,897 INFO L87 Difference]: Start difference. First operand 2151 states and 2956 transitions. Second operand 3 states. [2019-11-24 05:47:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:48,089 INFO L93 Difference]: Finished difference Result 3803 states and 5243 transitions. [2019-11-24 05:47:48,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:48,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-24 05:47:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:48,101 INFO L225 Difference]: With dead ends: 3803 [2019-11-24 05:47:48,101 INFO L226 Difference]: Without dead ends: 2622 [2019-11-24 05:47:48,104 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 05:47:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2019-11-24 05:47:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2412. [2019-11-24 05:47:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2019-11-24 05:47:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3290 transitions. [2019-11-24 05:47:48,435 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3290 transitions. Word has length 51 [2019-11-24 05:47:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:48,436 INFO L462 AbstractCegarLoop]: Abstraction has 2412 states and 3290 transitions. [2019-11-24 05:47:48,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3290 transitions. [2019-11-24 05:47:48,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:47:48,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:48,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:48,437 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:48,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:48,438 INFO L82 PathProgramCache]: Analyzing trace with hash 966936498, now seen corresponding path program 1 times [2019-11-24 05:47:48,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:48,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940842431] [2019-11-24 05:47:48,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:48,494 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 05:47:48,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940842431] [2019-11-24 05:47:48,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:48,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:48,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044411110] [2019-11-24 05:47:48,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:48,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:48,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:48,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:48,497 INFO L87 Difference]: Start difference. First operand 2412 states and 3290 transitions. Second operand 3 states. [2019-11-24 05:47:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:48,794 INFO L93 Difference]: Finished difference Result 4954 states and 6849 transitions. [2019-11-24 05:47:48,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:48,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:47:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:48,802 INFO L225 Difference]: With dead ends: 4954 [2019-11-24 05:47:48,802 INFO L226 Difference]: Without dead ends: 2966 [2019-11-24 05:47:48,806 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 05:47:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-24 05:47:49,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2964. [2019-11-24 05:47:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2964 states. [2019-11-24 05:47:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 4055 transitions. [2019-11-24 05:47:49,059 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 4055 transitions. Word has length 54 [2019-11-24 05:47:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:49,060 INFO L462 AbstractCegarLoop]: Abstraction has 2964 states and 4055 transitions. [2019-11-24 05:47:49,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 4055 transitions. [2019-11-24 05:47:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:47:49,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:49,061 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:49,061 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1312024622, now seen corresponding path program 1 times [2019-11-24 05:47:49,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:49,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159865500] [2019-11-24 05:47:49,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:49,104 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 05:47:49,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159865500] [2019-11-24 05:47:49,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:49,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:49,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767554805] [2019-11-24 05:47:49,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:49,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:49,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:49,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:49,108 INFO L87 Difference]: Start difference. First operand 2964 states and 4055 transitions. Second operand 3 states. [2019-11-24 05:47:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:49,458 INFO L93 Difference]: Finished difference Result 5714 states and 7838 transitions. [2019-11-24 05:47:49,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:49,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 05:47:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:49,465 INFO L225 Difference]: With dead ends: 5714 [2019-11-24 05:47:49,465 INFO L226 Difference]: Without dead ends: 4021 [2019-11-24 05:47:49,468 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 05:47:49,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4021 states. [2019-11-24 05:47:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4021 to 3805. [2019-11-24 05:47:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3805 states. [2019-11-24 05:47:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 5165 transitions. [2019-11-24 05:47:49,817 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 5165 transitions. Word has length 54 [2019-11-24 05:47:49,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:49,817 INFO L462 AbstractCegarLoop]: Abstraction has 3805 states and 5165 transitions. [2019-11-24 05:47:49,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 5165 transitions. [2019-11-24 05:47:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 05:47:49,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:49,819 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:49,819 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:49,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:49,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2074865080, now seen corresponding path program 1 times [2019-11-24 05:47:49,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:49,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834338851] [2019-11-24 05:47:49,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:49,943 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 05:47:49,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834338851] [2019-11-24 05:47:49,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:49,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:47:49,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732083315] [2019-11-24 05:47:49,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:47:49,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:49,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:47:49,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:47:49,945 INFO L87 Difference]: Start difference. First operand 3805 states and 5165 transitions. Second operand 10 states. [2019-11-24 05:47:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:52,128 INFO L93 Difference]: Finished difference Result 9866 states and 13382 transitions. [2019-11-24 05:47:52,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-24 05:47:52,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-11-24 05:47:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:52,150 INFO L225 Difference]: With dead ends: 9866 [2019-11-24 05:47:52,150 INFO L226 Difference]: Without dead ends: 8120 [2019-11-24 05:47:52,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2019-11-24 05:47:52,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8120 states. [2019-11-24 05:47:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8120 to 4471. [2019-11-24 05:47:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-24 05:47:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 5966 transitions. [2019-11-24 05:47:52,755 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 5966 transitions. Word has length 56 [2019-11-24 05:47:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:52,756 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 5966 transitions. [2019-11-24 05:47:52,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:47:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 5966 transitions. [2019-11-24 05:47:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 05:47:52,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:52,758 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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 05:47:52,758 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:52,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:52,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1962567405, now seen corresponding path program 1 times [2019-11-24 05:47:52,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:52,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301283849] [2019-11-24 05:47:52,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:52,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301283849] [2019-11-24 05:47:52,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:52,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:47:52,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896929024] [2019-11-24 05:47:52,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:47:52,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:52,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:47:52,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:47:52,821 INFO L87 Difference]: Start difference. First operand 4471 states and 5966 transitions. Second operand 3 states. [2019-11-24 05:47:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:53,895 INFO L93 Difference]: Finished difference Result 8935 states and 11985 transitions. [2019-11-24 05:47:53,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:47:53,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-24 05:47:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:53,907 INFO L225 Difference]: With dead ends: 8935 [2019-11-24 05:47:53,907 INFO L226 Difference]: Without dead ends: 5157 [2019-11-24 05:47:53,914 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 05:47:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5157 states. [2019-11-24 05:47:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5157 to 4596. [2019-11-24 05:47:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4596 states. [2019-11-24 05:47:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 6052 transitions. [2019-11-24 05:47:54,613 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 6052 transitions. Word has length 64 [2019-11-24 05:47:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:54,614 INFO L462 AbstractCegarLoop]: Abstraction has 4596 states and 6052 transitions. [2019-11-24 05:47:54,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:47:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 6052 transitions. [2019-11-24 05:47:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 05:47:54,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:54,615 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:54,616 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1734915112, now seen corresponding path program 1 times [2019-11-24 05:47:54,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:54,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586068228] [2019-11-24 05:47:54,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:55,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586068228] [2019-11-24 05:47:55,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467531559] [2019-11-24 05:47:55,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:47:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:55,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-24 05:47:55,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:47:55,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:07,991 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-24 05:48:07,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:07,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:07,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:08,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:18,332 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:48:18,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,764 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-11-24 05:48:20,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 05:48:20,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:48:20,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 05:48:20,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:20,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:21,299 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-11-24 05:48:23,720 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-11-24 05:48:23,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-24 05:48:23,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:24,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1311647106] [2019-11-24 05:48:24,131 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2019-11-24 05:48:24,131 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:48:24,136 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:48:24,142 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:48:24,142 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs