/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec0_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:50:01,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:50:01,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:50:01,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:50:01,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:50:01,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:50:01,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:50:01,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:50:01,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:50:01,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:50:01,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:50:01,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:50:01,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:50:01,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:50:01,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:50:01,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:50:01,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:50:01,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:50:01,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:50:01,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:50:01,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:50:01,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:50:01,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:50:01,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:50:01,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:50:01,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:50:01,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:50:01,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:50:01,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:50:01,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:50:01,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:50:01,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:50:01,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:50:01,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:50:01,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:50:01,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:50:01,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:50:01,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:50:01,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:50:01,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:50:01,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:50:01,883 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:50:01,907 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:50:01,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:50:01,908 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:50:01,908 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:50:01,908 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:50:01,909 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:50:01,909 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:50:01,909 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:50:01,909 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:50:01,909 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:50:01,910 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:50:01,911 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:50:01,911 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:50:01,911 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:50:01,911 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:50:01,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:50:01,913 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:50:01,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:50:01,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:50:01,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:50:01,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:50:01,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:50:01,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:50:01,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:50:01,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:50:01,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:50:01,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:50:01,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:50:01,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:50:01,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:50:01,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:50:01,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:50:01,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:50:01,917 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:50:01,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:50:01,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:50:01,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:50:01,918 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:50:02,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:50:02,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:50:02,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:50:02,197 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:50:02,197 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:50:02,198 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product34.cil.c [2019-11-24 04:50:02,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1944f140/5258af8eb011473b8a198c6047c8e245/FLAG04c07e0a9 [2019-11-24 04:50:02,918 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:50:02,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product34.cil.c [2019-11-24 04:50:02,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1944f140/5258af8eb011473b8a198c6047c8e245/FLAG04c07e0a9 [2019-11-24 04:50:03,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1944f140/5258af8eb011473b8a198c6047c8e245 [2019-11-24 04:50:03,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:50:03,128 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:50:03,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:50:03,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:50:03,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:50:03,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:50:03" (1/1) ... [2019-11-24 04:50:03,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f66df1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:03, skipping insertion in model container [2019-11-24 04:50:03,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:50:03" (1/1) ... [2019-11-24 04:50:03,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:50:03,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:50:03,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:50:03,958 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:50:04,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:50:04,236 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:50:04,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04 WrapperNode [2019-11-24 04:50:04,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:50:04,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:50:04,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:50:04,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:50:04,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (1/1) ... [2019-11-24 04:50:04,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (1/1) ... [2019-11-24 04:50:04,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:50:04,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:50:04,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:50:04,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:50:04,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (1/1) ... [2019-11-24 04:50:04,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (1/1) ... [2019-11-24 04:50:04,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (1/1) ... [2019-11-24 04:50:04,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (1/1) ... [2019-11-24 04:50:04,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (1/1) ... [2019-11-24 04:50:04,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (1/1) ... [2019-11-24 04:50:04,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (1/1) ... [2019-11-24 04:50:04,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:50:04,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:50:04,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:50:04,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:50:04,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:50:04,776 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 04:50:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:50:04,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:50:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:50:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:50:23,242 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:50:23,243 INFO L284 CfgBuilder]: Removed 861 assume(true) statements. [2019-11-24 04:50:23,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:50:23 BoogieIcfgContainer [2019-11-24 04:50:23,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:50:23,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:50:23,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:50:23,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:50:23,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:50:03" (1/3) ... [2019-11-24 04:50:23,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c16c3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:50:23, skipping insertion in model container [2019-11-24 04:50:23,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:50:04" (2/3) ... [2019-11-24 04:50:23,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c16c3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:50:23, skipping insertion in model container [2019-11-24 04:50:23,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:50:23" (3/3) ... [2019-11-24 04:50:23,254 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product34.cil.c [2019-11-24 04:50:23,262 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:50:23,269 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 04:50:23,279 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 04:50:23,302 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:50:23,303 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:50:23,303 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:50:23,303 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:50:23,303 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:50:23,303 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:50:23,303 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:50:23,303 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:50:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-11-24 04:50:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:50:23,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:23,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:23,325 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1111484734, now seen corresponding path program 1 times [2019-11-24 04:50:23,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:23,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774226176] [2019-11-24 04:50:23,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:23,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774226176] [2019-11-24 04:50:23,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:23,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:50:23,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166898434] [2019-11-24 04:50:23,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:50:23,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:23,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:50:23,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:50:23,732 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2019-11-24 04:50:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:23,755 INFO L93 Difference]: Finished difference Result 104 states and 157 transitions. [2019-11-24 04:50:23,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:50:23,757 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 04:50:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:23,769 INFO L225 Difference]: With dead ends: 104 [2019-11-24 04:50:23,769 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 04:50:23,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:50:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 04:50:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 04:50:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 04:50:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 04:50:23,839 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 8 [2019-11-24 04:50:23,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:23,840 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 04:50:23,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:50:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 04:50:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:50:23,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:23,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:23,842 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:23,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:23,842 INFO L82 PathProgramCache]: Analyzing trace with hash 921132818, now seen corresponding path program 1 times [2019-11-24 04:50:23,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:23,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425950231] [2019-11-24 04:50:23,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:24,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425950231] [2019-11-24 04:50:24,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:24,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:24,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836977823] [2019-11-24 04:50:24,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:24,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:24,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:24,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:24,019 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 04:50:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:24,044 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2019-11-24 04:50:24,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:24,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 04:50:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:24,047 INFO L225 Difference]: With dead ends: 98 [2019-11-24 04:50:24,047 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 04:50:24,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 04:50:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-24 04:50:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-24 04:50:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2019-11-24 04:50:24,066 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 9 [2019-11-24 04:50:24,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:24,066 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2019-11-24 04:50:24,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2019-11-24 04:50:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:50:24,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:24,070 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:24,070 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1588411802, now seen corresponding path program 1 times [2019-11-24 04:50:24,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:24,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279001082] [2019-11-24 04:50:24,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:50:24,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279001082] [2019-11-24 04:50:24,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:24,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:50:24,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585168487] [2019-11-24 04:50:24,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:50:24,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:24,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:50:24,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:50:24,613 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 6 states. [2019-11-24 04:50:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:25,225 INFO L93 Difference]: Finished difference Result 151 states and 207 transitions. [2019-11-24 04:50:25,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:50:25,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-24 04:50:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:25,229 INFO L225 Difference]: With dead ends: 151 [2019-11-24 04:50:25,229 INFO L226 Difference]: Without dead ends: 130 [2019-11-24 04:50:25,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:50:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-24 04:50:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 90. [2019-11-24 04:50:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-24 04:50:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2019-11-24 04:50:25,242 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 13 [2019-11-24 04:50:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:25,243 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2019-11-24 04:50:25,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:50:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2019-11-24 04:50:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:50:25,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:25,244 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:25,245 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:25,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1588050360, now seen corresponding path program 1 times [2019-11-24 04:50:25,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:25,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363783560] [2019-11-24 04:50:25,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:50:25,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363783560] [2019-11-24 04:50:25,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:25,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:50:25,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565063580] [2019-11-24 04:50:25,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:50:25,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:25,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:50:25,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:50:25,386 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand 5 states. [2019-11-24 04:50:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:25,646 INFO L93 Difference]: Finished difference Result 195 states and 297 transitions. [2019-11-24 04:50:25,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:50:25,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 04:50:25,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:25,649 INFO L225 Difference]: With dead ends: 195 [2019-11-24 04:50:25,649 INFO L226 Difference]: Without dead ends: 167 [2019-11-24 04:50:25,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:50:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-24 04:50:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 142. [2019-11-24 04:50:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-24 04:50:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 239 transitions. [2019-11-24 04:50:25,680 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 239 transitions. Word has length 13 [2019-11-24 04:50:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:25,680 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 239 transitions. [2019-11-24 04:50:25,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:50:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 239 transitions. [2019-11-24 04:50:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:50:25,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:25,682 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:25,682 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:25,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1324801155, now seen corresponding path program 1 times [2019-11-24 04:50:25,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:25,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031949483] [2019-11-24 04:50:25,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:50:25,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031949483] [2019-11-24 04:50:25,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:25,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:25,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913076127] [2019-11-24 04:50:25,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:50:25,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:25,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:50:25,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:50:25,836 INFO L87 Difference]: Start difference. First operand 142 states and 239 transitions. Second operand 4 states. [2019-11-24 04:50:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:25,887 INFO L93 Difference]: Finished difference Result 165 states and 263 transitions. [2019-11-24 04:50:25,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:50:25,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 04:50:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:25,889 INFO L225 Difference]: With dead ends: 165 [2019-11-24 04:50:25,890 INFO L226 Difference]: Without dead ends: 145 [2019-11-24 04:50:25,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:50:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-24 04:50:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2019-11-24 04:50:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-24 04:50:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 231 transitions. [2019-11-24 04:50:25,905 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 231 transitions. Word has length 17 [2019-11-24 04:50:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:25,905 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 231 transitions. [2019-11-24 04:50:25,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:50:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 231 transitions. [2019-11-24 04:50:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:50:25,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:25,906 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:25,907 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:25,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1367837399, now seen corresponding path program 1 times [2019-11-24 04:50:25,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:25,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128374670] [2019-11-24 04:50:25,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:25,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128374670] [2019-11-24 04:50:25,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:25,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:25,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573138323] [2019-11-24 04:50:25,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:25,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:25,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:25,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:25,961 INFO L87 Difference]: Start difference. First operand 139 states and 231 transitions. Second operand 3 states. [2019-11-24 04:50:25,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:25,986 INFO L93 Difference]: Finished difference Result 409 states and 681 transitions. [2019-11-24 04:50:25,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:25,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 04:50:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:25,989 INFO L225 Difference]: With dead ends: 409 [2019-11-24 04:50:25,989 INFO L226 Difference]: Without dead ends: 272 [2019-11-24 04:50:25,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-24 04:50:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 231. [2019-11-24 04:50:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-24 04:50:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 404 transitions. [2019-11-24 04:50:26,007 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 404 transitions. Word has length 18 [2019-11-24 04:50:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:26,007 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 404 transitions. [2019-11-24 04:50:26,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 404 transitions. [2019-11-24 04:50:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:50:26,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:26,009 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:26,009 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:26,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:26,009 INFO L82 PathProgramCache]: Analyzing trace with hash 103290108, now seen corresponding path program 1 times [2019-11-24 04:50:26,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:26,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073786438] [2019-11-24 04:50:26,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:26,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073786438] [2019-11-24 04:50:26,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:26,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:26,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867375896] [2019-11-24 04:50:26,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:26,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:26,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:26,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:26,061 INFO L87 Difference]: Start difference. First operand 231 states and 404 transitions. Second operand 3 states. [2019-11-24 04:50:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:26,089 INFO L93 Difference]: Finished difference Result 681 states and 1192 transitions. [2019-11-24 04:50:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:26,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:50:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:26,093 INFO L225 Difference]: With dead ends: 681 [2019-11-24 04:50:26,093 INFO L226 Difference]: Without dead ends: 452 [2019-11-24 04:50:26,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-24 04:50:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 411. [2019-11-24 04:50:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-24 04:50:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 738 transitions. [2019-11-24 04:50:26,122 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 738 transitions. Word has length 19 [2019-11-24 04:50:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:26,123 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 738 transitions. [2019-11-24 04:50:26,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 738 transitions. [2019-11-24 04:50:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:50:26,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:26,125 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:26,125 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:26,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:26,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1403989573, now seen corresponding path program 1 times [2019-11-24 04:50:26,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:26,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164645587] [2019-11-24 04:50:26,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:26,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164645587] [2019-11-24 04:50:26,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:26,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:26,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546339067] [2019-11-24 04:50:26,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:26,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:26,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:26,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:26,189 INFO L87 Difference]: Start difference. First operand 411 states and 738 transitions. Second operand 3 states. [2019-11-24 04:50:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:26,242 INFO L93 Difference]: Finished difference Result 1213 states and 2178 transitions. [2019-11-24 04:50:26,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:26,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:50:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:26,247 INFO L225 Difference]: With dead ends: 1213 [2019-11-24 04:50:26,248 INFO L226 Difference]: Without dead ends: 804 [2019-11-24 04:50:26,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-11-24 04:50:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 763. [2019-11-24 04:50:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-11-24 04:50:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1382 transitions. [2019-11-24 04:50:26,299 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1382 transitions. Word has length 20 [2019-11-24 04:50:26,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:26,299 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1382 transitions. [2019-11-24 04:50:26,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1382 transitions. [2019-11-24 04:50:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:50:26,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:26,300 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:26,301 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:26,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:26,301 INFO L82 PathProgramCache]: Analyzing trace with hash 880396414, now seen corresponding path program 1 times [2019-11-24 04:50:26,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:26,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754367841] [2019-11-24 04:50:26,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:26,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754367841] [2019-11-24 04:50:26,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:26,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:26,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142431194] [2019-11-24 04:50:26,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:26,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:26,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:26,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:26,356 INFO L87 Difference]: Start difference. First operand 763 states and 1382 transitions. Second operand 3 states. [2019-11-24 04:50:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:26,457 INFO L93 Difference]: Finished difference Result 2253 states and 4078 transitions. [2019-11-24 04:50:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:26,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:50:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:26,466 INFO L225 Difference]: With dead ends: 2253 [2019-11-24 04:50:26,467 INFO L226 Difference]: Without dead ends: 1492 [2019-11-24 04:50:26,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2019-11-24 04:50:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1451. [2019-11-24 04:50:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-11-24 04:50:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2622 transitions. [2019-11-24 04:50:26,562 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2622 transitions. Word has length 21 [2019-11-24 04:50:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:26,562 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2622 transitions. [2019-11-24 04:50:26,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2622 transitions. [2019-11-24 04:50:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:50:26,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:26,564 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:26,564 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:26,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:26,565 INFO L82 PathProgramCache]: Analyzing trace with hash 201429590, now seen corresponding path program 1 times [2019-11-24 04:50:26,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:26,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804545732] [2019-11-24 04:50:26,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:50:26,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804545732] [2019-11-24 04:50:26,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:26,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:50:26,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905282195] [2019-11-24 04:50:26,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:50:26,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:26,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:50:26,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:50:26,626 INFO L87 Difference]: Start difference. First operand 1451 states and 2622 transitions. Second operand 3 states. [2019-11-24 04:50:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:26,804 INFO L93 Difference]: Finished difference Result 4285 states and 7734 transitions. [2019-11-24 04:50:26,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:50:26,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:50:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:26,821 INFO L225 Difference]: With dead ends: 4285 [2019-11-24 04:50:26,821 INFO L226 Difference]: Without dead ends: 2836 [2019-11-24 04:50:26,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 04:50:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2836 states. [2019-11-24 04:50:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2836 to 2795. [2019-11-24 04:50:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2795 states. [2019-11-24 04:50:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 5006 transitions. [2019-11-24 04:50:27,020 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 5006 transitions. Word has length 22 [2019-11-24 04:50:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:27,020 INFO L462 AbstractCegarLoop]: Abstraction has 2795 states and 5006 transitions. [2019-11-24 04:50:27,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:50:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 5006 transitions. [2019-11-24 04:50:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:50:27,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:27,022 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:27,022 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:27,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash -201103057, now seen corresponding path program 1 times [2019-11-24 04:50:27,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:27,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427605906] [2019-11-24 04:50:27,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:50:27,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427605906] [2019-11-24 04:50:27,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:50:27,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:50:27,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784329321] [2019-11-24 04:50:27,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 04:50:27,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:50:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 04:50:27,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:50:27,339 INFO L87 Difference]: Start difference. First operand 2795 states and 5006 transitions. Second operand 7 states. [2019-11-24 04:50:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:50:28,585 INFO L93 Difference]: Finished difference Result 3194 states and 5686 transitions. [2019-11-24 04:50:28,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:50:28,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-24 04:50:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:50:28,603 INFO L225 Difference]: With dead ends: 3194 [2019-11-24 04:50:28,603 INFO L226 Difference]: Without dead ends: 3188 [2019-11-24 04:50:28,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:50:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2019-11-24 04:50:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3171. [2019-11-24 04:50:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3171 states. [2019-11-24 04:50:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 5661 transitions. [2019-11-24 04:50:28,795 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 5661 transitions. Word has length 23 [2019-11-24 04:50:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:50:28,795 INFO L462 AbstractCegarLoop]: Abstraction has 3171 states and 5661 transitions. [2019-11-24 04:50:28,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 04:50:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 5661 transitions. [2019-11-24 04:50:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:50:28,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:50:28,797 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:50:28,797 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:50:28,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:50:28,798 INFO L82 PathProgramCache]: Analyzing trace with hash -236839242, now seen corresponding path program 1 times [2019-11-24 04:50:28,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:50:28,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143542820] [2019-11-24 04:50:28,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:50:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:28,978 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 04:50:28,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143542820] [2019-11-24 04:50:28,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032098903] [2019-11-24 04:50:28,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:50:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:50:29,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 04:50:29,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:50:29,582 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 04:50:29,582 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:50:29,621 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 04:50:29,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1847652666] [2019-11-24 04:50:29,648 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-24 04:50:29,649 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:50:29,655 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:50:29,661 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:50:29,662 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:51:37,188 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 709