/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_spec9_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:14:34,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:14:34,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:14:34,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:14:34,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:14:34,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:14:34,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:14:34,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:14:34,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:14:34,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:14:34,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:14:34,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:14:34,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:14:34,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:14:34,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:14:34,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:14:34,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:14:34,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:14:34,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:14:34,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:14:34,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:14:34,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:14:34,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:14:34,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:14:34,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:14:34,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:14:34,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:14:34,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:14:34,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:14:34,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:14:34,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:14:34,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:14:34,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:14:34,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:14:34,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:14:34,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:14:34,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:14:34,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:14:34,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:14:34,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:14:34,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:14:34,627 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:14:34,662 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:14:34,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:14:34,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:14:34,665 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:14:34,665 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:14:34,665 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:14:34,665 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:14:34,665 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:14:34,666 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:14:34,666 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:14:34,666 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:14:34,666 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:14:34,666 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:14:34,667 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:14:34,667 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:14:34,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:14:34,668 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:14:34,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:14:34,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:14:34,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:14:34,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:14:34,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:14:34,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:14:34,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:14:34,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:14:34,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:14:34,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:14:34,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:14:34,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:14:34,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:14:34,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:14:34,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:14:34,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:14:34,674 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:14:34,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:14:34,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:14:34,676 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:14:34,676 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:14:34,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:14:34,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:14:34,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:14:34,996 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:14:34,996 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:14:34,997 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product21.cil.c [2019-11-24 05:14:35,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49152537f/72310d7650f44a488ed4779905987eb3/FLAGb1dfee5bb [2019-11-24 05:14:35,712 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:14:35,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product21.cil.c [2019-11-24 05:14:35,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49152537f/72310d7650f44a488ed4779905987eb3/FLAGb1dfee5bb [2019-11-24 05:14:35,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49152537f/72310d7650f44a488ed4779905987eb3 [2019-11-24 05:14:35,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:14:35,995 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:14:35,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:14:35,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:14:35,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:14:36,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:14:35" (1/1) ... [2019-11-24 05:14:36,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51de3a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:36, skipping insertion in model container [2019-11-24 05:14:36,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:14:35" (1/1) ... [2019-11-24 05:14:36,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:14:36,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:14:36,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:14:36,850 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:14:37,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:14:37,089 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:14:37,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:37 WrapperNode [2019-11-24 05:14:37,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:14:37,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:14:37,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:14:37,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:14:37,099 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:14:37" (1/1) ... [2019-11-24 05:14:37,131 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:14:37" (1/1) ... [2019-11-24 05:14:37,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:14:37,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:14:37,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:14:37,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:14:37,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:37" (1/1) ... [2019-11-24 05:14:37,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:37" (1/1) ... [2019-11-24 05:14:37,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:37" (1/1) ... [2019-11-24 05:14:37,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:37" (1/1) ... [2019-11-24 05:14:37,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:37" (1/1) ... [2019-11-24 05:14:37,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:37" (1/1) ... [2019-11-24 05:14:37,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:37" (1/1) ... [2019-11-24 05:14:37,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:14:37,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:14:37,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:14:37,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:14:37,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:37" (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:14:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 05:14:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 05:14:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 05:14:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:14:37,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:14:50,825 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:14:50,825 INFO L284 CfgBuilder]: Removed 649 assume(true) statements. [2019-11-24 05:14:50,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:14:50 BoogieIcfgContainer [2019-11-24 05:14:50,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:14:50,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:14:50,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:14:50,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:14:50,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:14:35" (1/3) ... [2019-11-24 05:14:50,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd09943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:14:50, skipping insertion in model container [2019-11-24 05:14:50,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:14:37" (2/3) ... [2019-11-24 05:14:50,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd09943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:14:50, skipping insertion in model container [2019-11-24 05:14:50,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:14:50" (3/3) ... [2019-11-24 05:14:50,836 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product21.cil.c [2019-11-24 05:14:50,845 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:14:50,851 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:14:50,862 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:14:50,888 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:14:50,888 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:14:50,889 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:14:50,889 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:14:50,889 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:14:50,889 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:14:50,889 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:14:50,889 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:14:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-24 05:14:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 05:14:50,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:50,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:14:50,915 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 05:14:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash 876475956, now seen corresponding path program 1 times [2019-11-24 05:14:50,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:50,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829192802] [2019-11-24 05:14:50,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:51,292 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:14:51,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829192802] [2019-11-24 05:14:51,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:51,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:14:51,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931834879] [2019-11-24 05:14:51,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 05:14:51,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 05:14:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:14:51,318 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2019-11-24 05:14:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:51,353 INFO L93 Difference]: Finished difference Result 100 states and 153 transitions. [2019-11-24 05:14:51,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 05:14:51,355 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 05:14:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:51,367 INFO L225 Difference]: With dead ends: 100 [2019-11-24 05:14:51,368 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 05:14:51,371 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 05:14:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 05:14:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-24 05:14:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 05:14:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2019-11-24 05:14:51,430 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 8 [2019-11-24 05:14:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:51,430 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2019-11-24 05:14:51,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 05:14:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2019-11-24 05:14:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 05:14:51,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:51,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:14:51,433 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 05:14:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1737065838, now seen corresponding path program 1 times [2019-11-24 05:14:51,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:51,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182237108] [2019-11-24 05:14:51,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:51,722 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:14:51,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182237108] [2019-11-24 05:14:51,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:51,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:51,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168947052] [2019-11-24 05:14:51,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:51,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:51,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:51,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:51,726 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand 3 states. [2019-11-24 05:14:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:51,756 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-24 05:14:51,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:51,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 05:14:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:51,758 INFO L225 Difference]: With dead ends: 94 [2019-11-24 05:14:51,758 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 05:14:51,759 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:14:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 05:14:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 05:14:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 05:14:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 05:14:51,768 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 9 [2019-11-24 05:14:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:51,769 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 05:14:51,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 05:14:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 05:14:51,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:51,770 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:14:51,771 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 05:14:51,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:51,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1848067781, now seen corresponding path program 1 times [2019-11-24 05:14:51,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:51,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198182495] [2019-11-24 05:14:51,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:51,885 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 05:14:51,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198182495] [2019-11-24 05:14:51,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:51,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:14:51,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701240097] [2019-11-24 05:14:51,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:51,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:51,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:51,889 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 05:14:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:52,010 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2019-11-24 05:14:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:52,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 05:14:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:52,015 INFO L225 Difference]: With dead ends: 86 [2019-11-24 05:14:52,016 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 05:14:52,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 05:14:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-24 05:14:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 05:14:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-24 05:14:52,031 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2019-11-24 05:14:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:52,031 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-24 05:14:52,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-24 05:14:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:14:52,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:52,033 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:14:52,033 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 05:14:52,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:52,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1386063818, now seen corresponding path program 1 times [2019-11-24 05:14:52,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:52,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449732866] [2019-11-24 05:14:52,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:52,548 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 05:14:52,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449732866] [2019-11-24 05:14:52,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:52,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:14:52,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359506307] [2019-11-24 05:14:52,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:14:52,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:52,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:14:52,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:14:52,554 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 8 states. [2019-11-24 05:14:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:53,398 INFO L93 Difference]: Finished difference Result 94 states and 145 transitions. [2019-11-24 05:14:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:14:53,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-24 05:14:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:53,401 INFO L225 Difference]: With dead ends: 94 [2019-11-24 05:14:53,401 INFO L226 Difference]: Without dead ends: 92 [2019-11-24 05:14:53,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:14:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-24 05:14:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2019-11-24 05:14:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-24 05:14:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2019-11-24 05:14:53,415 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 15 [2019-11-24 05:14:53,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:53,415 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2019-11-24 05:14:53,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:14:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2019-11-24 05:14:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:14:53,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:53,417 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 05:14:53,417 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 05:14:53,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash 84376337, now seen corresponding path program 1 times [2019-11-24 05:14:53,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:53,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345807933] [2019-11-24 05:14:53,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:53,653 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 05:14:53,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345807933] [2019-11-24 05:14:53,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:53,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:14:53,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827827594] [2019-11-24 05:14:53,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:14:53,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:53,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:14:53,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:14:53,656 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand 8 states. [2019-11-24 05:14:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:54,274 INFO L93 Difference]: Finished difference Result 159 states and 257 transitions. [2019-11-24 05:14:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:14:54,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-24 05:14:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:54,277 INFO L225 Difference]: With dead ends: 159 [2019-11-24 05:14:54,277 INFO L226 Difference]: Without dead ends: 141 [2019-11-24 05:14:54,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:14:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-24 05:14:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2019-11-24 05:14:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-24 05:14:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 233 transitions. [2019-11-24 05:14:54,306 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 233 transitions. Word has length 18 [2019-11-24 05:14:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:54,306 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 233 transitions. [2019-11-24 05:14:54,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:14:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 233 transitions. [2019-11-24 05:14:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 05:14:54,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:54,308 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 05:14:54,309 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 05:14:54,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:54,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1032158886, now seen corresponding path program 1 times [2019-11-24 05:14:54,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:54,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660513196] [2019-11-24 05:14:54,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:54,742 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 05:14:54,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660513196] [2019-11-24 05:14:54,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:54,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 05:14:54,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436614009] [2019-11-24 05:14:54,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:14:54,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:54,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:14:54,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:14:54,745 INFO L87 Difference]: Start difference. First operand 137 states and 233 transitions. Second operand 10 states. [2019-11-24 05:14:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:55,842 INFO L93 Difference]: Finished difference Result 253 states and 397 transitions. [2019-11-24 05:14:55,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-24 05:14:55,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-24 05:14:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:55,854 INFO L225 Difference]: With dead ends: 253 [2019-11-24 05:14:55,854 INFO L226 Difference]: Without dead ends: 241 [2019-11-24 05:14:55,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2019-11-24 05:14:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-24 05:14:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 197. [2019-11-24 05:14:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-24 05:14:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 341 transitions. [2019-11-24 05:14:55,885 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 341 transitions. Word has length 20 [2019-11-24 05:14:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:55,885 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 341 transitions. [2019-11-24 05:14:55,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:14:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 341 transitions. [2019-11-24 05:14:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 05:14:55,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:55,888 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 05:14:55,888 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 05:14:55,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1976266252, now seen corresponding path program 1 times [2019-11-24 05:14:55,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:55,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406573266] [2019-11-24 05:14:55,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:56,669 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 05:14:56,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406573266] [2019-11-24 05:14:56,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:56,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-24 05:14:56,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040693141] [2019-11-24 05:14:56,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-24 05:14:56,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:56,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-24 05:14:56,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-11-24 05:14:56,673 INFO L87 Difference]: Start difference. First operand 197 states and 341 transitions. Second operand 15 states. [2019-11-24 05:14:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:59,598 INFO L93 Difference]: Finished difference Result 214 states and 359 transitions. [2019-11-24 05:14:59,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-24 05:14:59,599 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-11-24 05:14:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:59,600 INFO L225 Difference]: With dead ends: 214 [2019-11-24 05:14:59,601 INFO L226 Difference]: Without dead ends: 208 [2019-11-24 05:14:59,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-11-24 05:14:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-24 05:14:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2019-11-24 05:14:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-24 05:14:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 349 transitions. [2019-11-24 05:14:59,643 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 349 transitions. Word has length 21 [2019-11-24 05:14:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:59,643 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 349 transitions. [2019-11-24 05:14:59,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-24 05:14:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 349 transitions. [2019-11-24 05:14:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 05:14:59,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:59,647 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 05:14:59,648 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 05:14:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash -333211084, now seen corresponding path program 1 times [2019-11-24 05:14:59,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:59,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642137928] [2019-11-24 05:14:59,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:14:59,741 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 05:14:59,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642137928] [2019-11-24 05:14:59,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:14:59,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:14:59,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500238414] [2019-11-24 05:14:59,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:14:59,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:14:59,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:14:59,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:59,743 INFO L87 Difference]: Start difference. First operand 204 states and 349 transitions. Second operand 3 states. [2019-11-24 05:14:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:14:59,786 INFO L93 Difference]: Finished difference Result 598 states and 1027 transitions. [2019-11-24 05:14:59,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:14:59,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 05:14:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:14:59,790 INFO L225 Difference]: With dead ends: 598 [2019-11-24 05:14:59,790 INFO L226 Difference]: Without dead ends: 398 [2019-11-24 05:14:59,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:14:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-11-24 05:14:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 342. [2019-11-24 05:14:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-24 05:14:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 613 transitions. [2019-11-24 05:14:59,828 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 613 transitions. Word has length 21 [2019-11-24 05:14:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:14:59,829 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 613 transitions. [2019-11-24 05:14:59,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:14:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 613 transitions. [2019-11-24 05:14:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 05:14:59,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:14:59,833 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 05:14:59,833 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 05:14:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:14:59,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1127855238, now seen corresponding path program 1 times [2019-11-24 05:14:59,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:14:59,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554644505] [2019-11-24 05:14:59,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:14:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:00,091 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 05:15:00,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554644505] [2019-11-24 05:15:00,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:00,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:00,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826896786] [2019-11-24 05:15:00,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:15:00,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:00,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:15:00,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:15:00,093 INFO L87 Difference]: Start difference. First operand 342 states and 613 transitions. Second operand 4 states. [2019-11-24 05:15:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:00,206 INFO L93 Difference]: Finished difference Result 370 states and 641 transitions. [2019-11-24 05:15:00,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:15:00,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-24 05:15:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:00,210 INFO L225 Difference]: With dead ends: 370 [2019-11-24 05:15:00,210 INFO L226 Difference]: Without dead ends: 330 [2019-11-24 05:15:00,210 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 05:15:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-24 05:15:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 226. [2019-11-24 05:15:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-24 05:15:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 398 transitions. [2019-11-24 05:15:00,235 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 398 transitions. Word has length 22 [2019-11-24 05:15:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:00,236 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 398 transitions. [2019-11-24 05:15:00,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:15:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 398 transitions. [2019-11-24 05:15:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 05:15:00,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:00,237 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 05:15:00,238 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 05:15:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1247945512, now seen corresponding path program 1 times [2019-11-24 05:15:00,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:00,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072987459] [2019-11-24 05:15:00,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:00,329 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 05:15:00,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072987459] [2019-11-24 05:15:00,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:00,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:00,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804431130] [2019-11-24 05:15:00,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:00,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:00,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:00,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:00,331 INFO L87 Difference]: Start difference. First operand 226 states and 398 transitions. Second operand 3 states. [2019-11-24 05:15:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:00,425 INFO L93 Difference]: Finished difference Result 666 states and 1174 transitions. [2019-11-24 05:15:00,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:00,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 05:15:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:00,434 INFO L225 Difference]: With dead ends: 666 [2019-11-24 05:15:00,435 INFO L226 Difference]: Without dead ends: 442 [2019-11-24 05:15:00,436 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:15:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-24 05:15:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 406. [2019-11-24 05:15:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-11-24 05:15:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 732 transitions. [2019-11-24 05:15:00,474 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 732 transitions. Word has length 23 [2019-11-24 05:15:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:00,475 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 732 transitions. [2019-11-24 05:15:00,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 732 transitions. [2019-11-24 05:15:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:15:00,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:00,476 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:00,477 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 05:15:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1238483523, now seen corresponding path program 1 times [2019-11-24 05:15:00,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:00,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346987390] [2019-11-24 05:15:00,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:00,522 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 05:15:00,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346987390] [2019-11-24 05:15:00,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:00,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:00,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985449860] [2019-11-24 05:15:00,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:00,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:00,524 INFO L87 Difference]: Start difference. First operand 406 states and 732 transitions. Second operand 3 states. [2019-11-24 05:15:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:00,605 INFO L93 Difference]: Finished difference Result 1198 states and 2160 transitions. [2019-11-24 05:15:00,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:00,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 05:15:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:00,612 INFO L225 Difference]: With dead ends: 1198 [2019-11-24 05:15:00,612 INFO L226 Difference]: Without dead ends: 794 [2019-11-24 05:15:00,614 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:15:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-11-24 05:15:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 758. [2019-11-24 05:15:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-11-24 05:15:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1376 transitions. [2019-11-24 05:15:00,694 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1376 transitions. Word has length 24 [2019-11-24 05:15:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:00,694 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1376 transitions. [2019-11-24 05:15:00,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1376 transitions. [2019-11-24 05:15:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 05:15:00,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:00,696 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:00,696 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 05:15:00,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:00,696 INFO L82 PathProgramCache]: Analyzing trace with hash -321613846, now seen corresponding path program 1 times [2019-11-24 05:15:00,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:00,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083374771] [2019-11-24 05:15:00,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:00,747 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 05:15:00,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083374771] [2019-11-24 05:15:00,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:00,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:00,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87574699] [2019-11-24 05:15:00,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:00,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:00,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:00,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:00,750 INFO L87 Difference]: Start difference. First operand 758 states and 1376 transitions. Second operand 3 states. [2019-11-24 05:15:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:00,891 INFO L93 Difference]: Finished difference Result 2238 states and 4060 transitions. [2019-11-24 05:15:00,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:00,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 05:15:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:00,901 INFO L225 Difference]: With dead ends: 2238 [2019-11-24 05:15:00,901 INFO L226 Difference]: Without dead ends: 1482 [2019-11-24 05:15:00,903 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:15:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2019-11-24 05:15:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1446. [2019-11-24 05:15:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2019-11-24 05:15:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2616 transitions. [2019-11-24 05:15:01,032 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2616 transitions. Word has length 25 [2019-11-24 05:15:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:01,032 INFO L462 AbstractCegarLoop]: Abstraction has 1446 states and 2616 transitions. [2019-11-24 05:15:01,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2616 transitions. [2019-11-24 05:15:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 05:15:01,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:01,034 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:01,034 INFO L410 AbstractCegarLoop]: === Iteration 13 === [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 05:15:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:01,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1233171348, now seen corresponding path program 1 times [2019-11-24 05:15:01,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:01,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483897585] [2019-11-24 05:15:01,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:01,080 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 05:15:01,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483897585] [2019-11-24 05:15:01,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:01,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:01,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875495132] [2019-11-24 05:15:01,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:01,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:01,082 INFO L87 Difference]: Start difference. First operand 1446 states and 2616 transitions. Second operand 3 states. [2019-11-24 05:15:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:01,331 INFO L93 Difference]: Finished difference Result 4270 states and 7716 transitions. [2019-11-24 05:15:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:01,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 05:15:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:01,351 INFO L225 Difference]: With dead ends: 4270 [2019-11-24 05:15:01,351 INFO L226 Difference]: Without dead ends: 2826 [2019-11-24 05:15:01,356 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:15:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2019-11-24 05:15:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2790. [2019-11-24 05:15:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-11-24 05:15:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 5000 transitions. [2019-11-24 05:15:01,663 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 5000 transitions. Word has length 26 [2019-11-24 05:15:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:01,664 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 5000 transitions. [2019-11-24 05:15:01,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 5000 transitions. [2019-11-24 05:15:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 05:15:01,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:01,666 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:01,666 INFO L410 AbstractCegarLoop]: === Iteration 14 === [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 05:15:01,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:01,666 INFO L82 PathProgramCache]: Analyzing trace with hash 569191003, now seen corresponding path program 1 times [2019-11-24 05:15:01,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:01,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53667082] [2019-11-24 05:15:01,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:01,749 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 05:15:01,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53667082] [2019-11-24 05:15:01,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:01,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:01,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376388074] [2019-11-24 05:15:01,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:01,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:01,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:01,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:01,751 INFO L87 Difference]: Start difference. First operand 2790 states and 5000 transitions. Second operand 3 states. [2019-11-24 05:15:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:02,142 INFO L93 Difference]: Finished difference Result 6924 states and 12434 transitions. [2019-11-24 05:15:02,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:02,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 05:15:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:02,171 INFO L225 Difference]: With dead ends: 6924 [2019-11-24 05:15:02,171 INFO L226 Difference]: Without dead ends: 4136 [2019-11-24 05:15:02,179 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:15:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2019-11-24 05:15:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 4102. [2019-11-24 05:15:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-11-24 05:15:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 7272 transitions. [2019-11-24 05:15:02,567 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 7272 transitions. Word has length 27 [2019-11-24 05:15:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:02,567 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 7272 transitions. [2019-11-24 05:15:02,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 7272 transitions. [2019-11-24 05:15:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 05:15:02,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:02,569 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:02,569 INFO L410 AbstractCegarLoop]: === Iteration 15 === [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 05:15:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1824095523, now seen corresponding path program 1 times [2019-11-24 05:15:02,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:02,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88142195] [2019-11-24 05:15:02,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:02,644 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 05:15:02,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88142195] [2019-11-24 05:15:02,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:02,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:02,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450514954] [2019-11-24 05:15:02,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:02,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:02,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:02,647 INFO L87 Difference]: Start difference. First operand 4102 states and 7272 transitions. Second operand 3 states. [2019-11-24 05:15:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:03,326 INFO L93 Difference]: Finished difference Result 12110 states and 21428 transitions. [2019-11-24 05:15:03,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:03,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 05:15:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:03,372 INFO L225 Difference]: With dead ends: 12110 [2019-11-24 05:15:03,372 INFO L226 Difference]: Without dead ends: 8010 [2019-11-24 05:15:03,381 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:15:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8010 states. [2019-11-24 05:15:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8010 to 7974. [2019-11-24 05:15:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-11-24 05:15:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 13928 transitions. [2019-11-24 05:15:04,062 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 13928 transitions. Word has length 28 [2019-11-24 05:15:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:04,065 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 13928 transitions. [2019-11-24 05:15:04,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 13928 transitions. [2019-11-24 05:15:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 05:15:04,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:04,067 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:04,067 INFO L410 AbstractCegarLoop]: === Iteration 16 === [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 05:15:04,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:04,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1105009430, now seen corresponding path program 1 times [2019-11-24 05:15:04,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:04,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481659419] [2019-11-24 05:15:04,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:04,275 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 05:15:04,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481659419] [2019-11-24 05:15:04,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:04,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:15:04,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325231461] [2019-11-24 05:15:04,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:15:04,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:04,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:15:04,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:15:04,277 INFO L87 Difference]: Start difference. First operand 7974 states and 13928 transitions. Second operand 7 states. [2019-11-24 05:15:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:05,632 INFO L93 Difference]: Finished difference Result 9069 states and 15768 transitions. [2019-11-24 05:15:05,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:15:05,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-24 05:15:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:05,669 INFO L225 Difference]: With dead ends: 9069 [2019-11-24 05:15:05,670 INFO L226 Difference]: Without dead ends: 9050 [2019-11-24 05:15:05,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:15:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9050 states. [2019-11-24 05:15:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9050 to 9014. [2019-11-24 05:15:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9014 states. [2019-11-24 05:15:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9014 states to 9014 states and 15649 transitions. [2019-11-24 05:15:07,151 INFO L78 Accepts]: Start accepts. Automaton has 9014 states and 15649 transitions. Word has length 28 [2019-11-24 05:15:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:07,151 INFO L462 AbstractCegarLoop]: Abstraction has 9014 states and 15649 transitions. [2019-11-24 05:15:07,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:15:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 9014 states and 15649 transitions. [2019-11-24 05:15:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:15:07,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:07,153 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:07,153 INFO L410 AbstractCegarLoop]: === Iteration 17 === [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 05:15:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:07,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1134820214, now seen corresponding path program 1 times [2019-11-24 05:15:07,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:07,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274967485] [2019-11-24 05:15:07,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:07,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274967485] [2019-11-24 05:15:07,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413236489] [2019-11-24 05:15:07,304 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:15:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:07,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 05:15:07,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:15:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:07,739 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:15:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:07,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [735004945] [2019-11-24 05:15:07,810 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-11-24 05:15:07,810 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:15:07,820 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:15:07,830 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:15:07,830 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs