/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:47:48,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:47:48,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:47:48,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:47:48,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:47:48,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:47:48,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:47:48,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:47:48,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:47:48,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:47:48,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:47:48,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:47:48,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:47:48,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:47:48,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:47:48,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:47:48,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:47:48,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:47:48,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:47:48,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:47:48,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:47:48,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:47:48,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:47:48,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:47:48,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:47:48,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:47:48,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:47:48,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:47:48,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:47:48,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:47:48,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:47:48,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:47:48,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:47:48,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:47:48,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:47:48,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:47:48,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:47:48,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:47:48,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:47:48,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:47:48,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:47:48,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:47:48,927 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:47:48,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:47:48,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:47:48,929 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:47:48,929 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:47:48,929 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:47:48,929 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:47:48,929 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:47:48,930 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:47:48,930 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:47:48,930 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:47:48,930 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:47:48,930 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:47:48,931 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:47:48,931 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:47:48,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:47:48,932 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:47:48,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:47:48,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:47:48,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:47:48,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:47:48,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:47:48,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:47:48,933 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:47:48,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:47:48,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:47:48,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:47:48,934 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:47:48,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:47:48,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:47:48,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:47:48,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:47:48,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:47:48,935 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:47:48,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:47:48,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:47:48,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:47:48,936 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:47:49,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:47:49,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:47:49,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:47:49,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:47:49,234 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:47:49,235 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c [2019-11-24 04:47:49,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ccf0364d/4c0ede2fece64962af1d994673d26252/FLAG6d3f02732 [2019-11-24 04:47:49,919 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:47:49,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c [2019-11-24 04:47:49,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ccf0364d/4c0ede2fece64962af1d994673d26252/FLAG6d3f02732 [2019-11-24 04:47:50,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ccf0364d/4c0ede2fece64962af1d994673d26252 [2019-11-24 04:47:50,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:47:50,172 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:47:50,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:47:50,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:47:50,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:47:50,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:47:50" (1/1) ... [2019-11-24 04:47:50,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db77631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:50, skipping insertion in model container [2019-11-24 04:47:50,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:47:50" (1/1) ... [2019-11-24 04:47:50,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:47:50,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:47:50,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:47:50,978 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:47:51,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:47:51,220 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:47:51,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51 WrapperNode [2019-11-24 04:47:51,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:47:51,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:47:51,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:47:51,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:47:51,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (1/1) ... [2019-11-24 04:47:51,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (1/1) ... [2019-11-24 04:47:51,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:47:51,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:47:51,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:47:51,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:47:51,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (1/1) ... [2019-11-24 04:47:51,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (1/1) ... [2019-11-24 04:47:51,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (1/1) ... [2019-11-24 04:47:51,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (1/1) ... [2019-11-24 04:47:51,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (1/1) ... [2019-11-24 04:47:51,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (1/1) ... [2019-11-24 04:47:51,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (1/1) ... [2019-11-24 04:47:51,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:47:51,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:47:51,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:47:51,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:47:51,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:47:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:47:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:47:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:47:51,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:48:25,847 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:48:25,847 INFO L284 CfgBuilder]: Removed 809 assume(true) statements. [2019-11-24 04:48:25,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:48:25 BoogieIcfgContainer [2019-11-24 04:48:25,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:48:25,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:48:25,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:48:25,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:48:25,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:47:50" (1/3) ... [2019-11-24 04:48:25,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d298f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:48:25, skipping insertion in model container [2019-11-24 04:48:25,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:47:51" (2/3) ... [2019-11-24 04:48:25,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d298f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:48:25, skipping insertion in model container [2019-11-24 04:48:25,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:48:25" (3/3) ... [2019-11-24 04:48:25,858 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2019-11-24 04:48:25,867 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:48:25,876 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:48:25,888 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:48:25,919 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:48:25,919 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:48:25,919 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:48:25,920 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:48:25,920 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:48:25,920 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:48:25,920 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:48:25,920 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:48:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states. [2019-11-24 04:48:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:48:25,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:25,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:25,972 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:25,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash 502200172, now seen corresponding path program 1 times [2019-11-24 04:48:25,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:25,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68473463] [2019-11-24 04:48:25,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:26,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68473463] [2019-11-24 04:48:26,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:26,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:48:26,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851894171] [2019-11-24 04:48:26,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:48:26,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:26,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:48:26,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:48:26,487 INFO L87 Difference]: Start difference. First operand 1229 states. Second operand 2 states. [2019-11-24 04:48:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:26,596 INFO L93 Difference]: Finished difference Result 1246 states and 2395 transitions. [2019-11-24 04:48:26,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:48:26,597 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-24 04:48:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:26,626 INFO L225 Difference]: With dead ends: 1246 [2019-11-24 04:48:26,627 INFO L226 Difference]: Without dead ends: 1227 [2019-11-24 04:48:26,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:48:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-11-24 04:48:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1227. [2019-11-24 04:48:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-11-24 04:48:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 2365 transitions. [2019-11-24 04:48:26,761 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 2365 transitions. Word has length 15 [2019-11-24 04:48:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:26,762 INFO L462 AbstractCegarLoop]: Abstraction has 1227 states and 2365 transitions. [2019-11-24 04:48:26,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:48:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 2365 transitions. [2019-11-24 04:48:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:48:26,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:26,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:26,775 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1673954212, now seen corresponding path program 1 times [2019-11-24 04:48:26,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:26,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137653833] [2019-11-24 04:48:26,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:26,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137653833] [2019-11-24 04:48:26,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:26,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:26,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160812141] [2019-11-24 04:48:26,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:26,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:26,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:26,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:26,977 INFO L87 Difference]: Start difference. First operand 1227 states and 2365 transitions. Second operand 5 states. [2019-11-24 04:48:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:27,586 INFO L93 Difference]: Finished difference Result 2231 states and 4224 transitions. [2019-11-24 04:48:27,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:48:27,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-24 04:48:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:27,597 INFO L225 Difference]: With dead ends: 2231 [2019-11-24 04:48:27,598 INFO L226 Difference]: Without dead ends: 1596 [2019-11-24 04:48:27,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:48:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2019-11-24 04:48:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1237. [2019-11-24 04:48:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-11-24 04:48:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2375 transitions. [2019-11-24 04:48:27,650 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2375 transitions. Word has length 16 [2019-11-24 04:48:27,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:27,651 INFO L462 AbstractCegarLoop]: Abstraction has 1237 states and 2375 transitions. [2019-11-24 04:48:27,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2375 transitions. [2019-11-24 04:48:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:48:27,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:27,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:27,654 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:27,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1898215540, now seen corresponding path program 1 times [2019-11-24 04:48:27,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:27,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562917704] [2019-11-24 04:48:27,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:27,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562917704] [2019-11-24 04:48:27,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:27,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:48:27,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646667023] [2019-11-24 04:48:27,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:27,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:27,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:27,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:27,764 INFO L87 Difference]: Start difference. First operand 1237 states and 2375 transitions. Second operand 3 states. [2019-11-24 04:48:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:28,757 INFO L93 Difference]: Finished difference Result 2486 states and 4745 transitions. [2019-11-24 04:48:28,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:28,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:48:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:28,770 INFO L225 Difference]: With dead ends: 2486 [2019-11-24 04:48:28,777 INFO L226 Difference]: Without dead ends: 1493 [2019-11-24 04:48:28,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:28,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-11-24 04:48:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1465. [2019-11-24 04:48:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-11-24 04:48:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2686 transitions. [2019-11-24 04:48:28,851 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2686 transitions. Word has length 19 [2019-11-24 04:48:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:28,852 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 2686 transitions. [2019-11-24 04:48:28,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2686 transitions. [2019-11-24 04:48:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:48:28,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:28,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:28,859 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:28,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:28,859 INFO L82 PathProgramCache]: Analyzing trace with hash 86152284, now seen corresponding path program 1 times [2019-11-24 04:48:28,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:28,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823597566] [2019-11-24 04:48:28,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:29,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823597566] [2019-11-24 04:48:29,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:29,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:29,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380165028] [2019-11-24 04:48:29,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:29,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:29,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:29,034 INFO L87 Difference]: Start difference. First operand 1465 states and 2686 transitions. Second operand 3 states. [2019-11-24 04:48:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:29,304 INFO L93 Difference]: Finished difference Result 2825 states and 5203 transitions. [2019-11-24 04:48:29,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:29,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:48:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:29,316 INFO L225 Difference]: With dead ends: 2825 [2019-11-24 04:48:29,317 INFO L226 Difference]: Without dead ends: 2118 [2019-11-24 04:48:29,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-24 04:48:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2044. [2019-11-24 04:48:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-11-24 04:48:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3735 transitions. [2019-11-24 04:48:29,385 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3735 transitions. Word has length 21 [2019-11-24 04:48:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:29,385 INFO L462 AbstractCegarLoop]: Abstraction has 2044 states and 3735 transitions. [2019-11-24 04:48:29,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3735 transitions. [2019-11-24 04:48:29,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:48:29,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:29,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:29,388 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:29,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:29,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1624223402, now seen corresponding path program 1 times [2019-11-24 04:48:29,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:29,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758808851] [2019-11-24 04:48:29,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:29,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758808851] [2019-11-24 04:48:29,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:29,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:29,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823673866] [2019-11-24 04:48:29,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:29,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:29,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:29,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:29,556 INFO L87 Difference]: Start difference. First operand 2044 states and 3735 transitions. Second operand 3 states. [2019-11-24 04:48:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:29,983 INFO L93 Difference]: Finished difference Result 4596 states and 8451 transitions. [2019-11-24 04:48:29,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:29,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:48:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:30,005 INFO L225 Difference]: With dead ends: 4596 [2019-11-24 04:48:30,005 INFO L226 Difference]: Without dead ends: 3419 [2019-11-24 04:48:30,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2019-11-24 04:48:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3195. [2019-11-24 04:48:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-11-24 04:48:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 5819 transitions. [2019-11-24 04:48:30,118 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 5819 transitions. Word has length 22 [2019-11-24 04:48:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:30,118 INFO L462 AbstractCegarLoop]: Abstraction has 3195 states and 5819 transitions. [2019-11-24 04:48:30,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 5819 transitions. [2019-11-24 04:48:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:48:30,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:30,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:30,121 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1188705189, now seen corresponding path program 1 times [2019-11-24 04:48:30,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:30,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186080512] [2019-11-24 04:48:30,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:30,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186080512] [2019-11-24 04:48:30,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:30,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:30,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833858801] [2019-11-24 04:48:30,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:30,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:30,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:30,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:30,246 INFO L87 Difference]: Start difference. First operand 3195 states and 5819 transitions. Second operand 3 states. [2019-11-24 04:48:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:30,523 INFO L93 Difference]: Finished difference Result 5942 states and 10847 transitions. [2019-11-24 04:48:30,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:30,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:48:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:30,543 INFO L225 Difference]: With dead ends: 5942 [2019-11-24 04:48:30,544 INFO L226 Difference]: Without dead ends: 3193 [2019-11-24 04:48:30,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-11-24 04:48:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3193. [2019-11-24 04:48:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3193 states. [2019-11-24 04:48:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 5804 transitions. [2019-11-24 04:48:30,661 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 5804 transitions. Word has length 23 [2019-11-24 04:48:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:30,661 INFO L462 AbstractCegarLoop]: Abstraction has 3193 states and 5804 transitions. [2019-11-24 04:48:30,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 5804 transitions. [2019-11-24 04:48:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:48:30,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:30,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:30,664 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1804821697, now seen corresponding path program 1 times [2019-11-24 04:48:30,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:30,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919460362] [2019-11-24 04:48:30,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:30,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919460362] [2019-11-24 04:48:30,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:30,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:30,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362543120] [2019-11-24 04:48:30,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:30,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:30,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:30,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:30,764 INFO L87 Difference]: Start difference. First operand 3193 states and 5804 transitions. Second operand 3 states. [2019-11-24 04:48:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:31,137 INFO L93 Difference]: Finished difference Result 7881 states and 14428 transitions. [2019-11-24 04:48:31,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:31,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:48:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:31,168 INFO L225 Difference]: With dead ends: 7881 [2019-11-24 04:48:31,168 INFO L226 Difference]: Without dead ends: 5765 [2019-11-24 04:48:31,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2019-11-24 04:48:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5465. [2019-11-24 04:48:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5465 states. [2019-11-24 04:48:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 9906 transitions. [2019-11-24 04:48:31,354 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 9906 transitions. Word has length 24 [2019-11-24 04:48:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:31,355 INFO L462 AbstractCegarLoop]: Abstraction has 5465 states and 9906 transitions. [2019-11-24 04:48:31,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 9906 transitions. [2019-11-24 04:48:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:48:31,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:31,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:31,357 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:31,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:31,357 INFO L82 PathProgramCache]: Analyzing trace with hash -114874642, now seen corresponding path program 1 times [2019-11-24 04:48:31,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:31,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438675641] [2019-11-24 04:48:31,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:31,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438675641] [2019-11-24 04:48:31,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:31,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:31,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525692333] [2019-11-24 04:48:31,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:31,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:31,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:31,444 INFO L87 Difference]: Start difference. First operand 5465 states and 9906 transitions. Second operand 3 states. [2019-11-24 04:48:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:31,739 INFO L93 Difference]: Finished difference Result 5465 states and 9906 transitions. [2019-11-24 04:48:31,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:31,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:48:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:31,767 INFO L225 Difference]: With dead ends: 5465 [2019-11-24 04:48:31,768 INFO L226 Difference]: Without dead ends: 5458 [2019-11-24 04:48:31,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5458 states. [2019-11-24 04:48:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5458 to 5458. [2019-11-24 04:48:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5458 states. [2019-11-24 04:48:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5458 states to 5458 states and 9891 transitions. [2019-11-24 04:48:33,260 INFO L78 Accepts]: Start accepts. Automaton has 5458 states and 9891 transitions. Word has length 25 [2019-11-24 04:48:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:33,262 INFO L462 AbstractCegarLoop]: Abstraction has 5458 states and 9891 transitions. [2019-11-24 04:48:33,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5458 states and 9891 transitions. [2019-11-24 04:48:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 04:48:33,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:33,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:33,268 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash -231893769, now seen corresponding path program 1 times [2019-11-24 04:48:33,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:33,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664416256] [2019-11-24 04:48:33,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:33,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664416256] [2019-11-24 04:48:33,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:33,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:33,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914213246] [2019-11-24 04:48:33,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:48:33,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:33,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:48:33,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:48:33,564 INFO L87 Difference]: Start difference. First operand 5458 states and 9891 transitions. Second operand 4 states. [2019-11-24 04:48:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:34,752 INFO L93 Difference]: Finished difference Result 11122 states and 20208 transitions. [2019-11-24 04:48:34,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:48:34,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-24 04:48:34,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:34,766 INFO L225 Difference]: With dead ends: 11122 [2019-11-24 04:48:34,766 INFO L226 Difference]: Without dead ends: 5933 [2019-11-24 04:48:34,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5933 states. [2019-11-24 04:48:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5933 to 5458. [2019-11-24 04:48:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5458 states. [2019-11-24 04:48:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5458 states to 5458 states and 9816 transitions. [2019-11-24 04:48:34,956 INFO L78 Accepts]: Start accepts. Automaton has 5458 states and 9816 transitions. Word has length 29 [2019-11-24 04:48:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:34,957 INFO L462 AbstractCegarLoop]: Abstraction has 5458 states and 9816 transitions. [2019-11-24 04:48:34,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:48:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5458 states and 9816 transitions. [2019-11-24 04:48:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:48:34,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:34,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:34,961 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:34,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:34,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1578313556, now seen corresponding path program 1 times [2019-11-24 04:48:34,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:34,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587082007] [2019-11-24 04:48:34,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:35,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587082007] [2019-11-24 04:48:35,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:35,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:35,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399137246] [2019-11-24 04:48:35,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:35,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:35,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:35,197 INFO L87 Difference]: Start difference. First operand 5458 states and 9816 transitions. Second operand 3 states. [2019-11-24 04:48:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:36,268 INFO L93 Difference]: Finished difference Result 15192 states and 27370 transitions. [2019-11-24 04:48:36,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:36,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:48:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:36,290 INFO L225 Difference]: With dead ends: 15192 [2019-11-24 04:48:36,291 INFO L226 Difference]: Without dead ends: 10024 [2019-11-24 04:48:36,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:36,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10024 states. [2019-11-24 04:48:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10024 to 5413. [2019-11-24 04:48:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5413 states. [2019-11-24 04:48:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 9696 transitions. [2019-11-24 04:48:36,627 INFO L78 Accepts]: Start accepts. Automaton has 5413 states and 9696 transitions. Word has length 34 [2019-11-24 04:48:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:36,628 INFO L462 AbstractCegarLoop]: Abstraction has 5413 states and 9696 transitions. [2019-11-24 04:48:36,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5413 states and 9696 transitions. [2019-11-24 04:48:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:48:36,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:36,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:36,633 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:36,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:36,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1009489662, now seen corresponding path program 1 times [2019-11-24 04:48:36,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:36,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781552677] [2019-11-24 04:48:36,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:36,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781552677] [2019-11-24 04:48:36,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:36,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:36,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565582744] [2019-11-24 04:48:36,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:36,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:36,914 INFO L87 Difference]: Start difference. First operand 5413 states and 9696 transitions. Second operand 3 states. [2019-11-24 04:48:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:38,061 INFO L93 Difference]: Finished difference Result 15087 states and 27120 transitions. [2019-11-24 04:48:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:38,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:48:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:38,086 INFO L225 Difference]: With dead ends: 15087 [2019-11-24 04:48:38,086 INFO L226 Difference]: Without dead ends: 9991 [2019-11-24 04:48:38,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9991 states. [2019-11-24 04:48:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9991 to 5383. [2019-11-24 04:48:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5383 states. [2019-11-24 04:48:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 9591 transitions. [2019-11-24 04:48:38,330 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 9591 transitions. Word has length 35 [2019-11-24 04:48:38,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:38,330 INFO L462 AbstractCegarLoop]: Abstraction has 5383 states and 9591 transitions. [2019-11-24 04:48:38,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 9591 transitions. [2019-11-24 04:48:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:48:38,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:38,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:38,333 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1692641571, now seen corresponding path program 1 times [2019-11-24 04:48:38,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:38,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159353652] [2019-11-24 04:48:38,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:38,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159353652] [2019-11-24 04:48:38,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:38,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:38,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184849778] [2019-11-24 04:48:38,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:38,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:38,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:38,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:38,551 INFO L87 Difference]: Start difference. First operand 5383 states and 9591 transitions. Second operand 3 states. [2019-11-24 04:48:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:39,577 INFO L93 Difference]: Finished difference Result 15007 states and 26895 transitions. [2019-11-24 04:48:39,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:39,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:48:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:39,594 INFO L225 Difference]: With dead ends: 15007 [2019-11-24 04:48:39,594 INFO L226 Difference]: Without dead ends: 9973 [2019-11-24 04:48:39,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9973 states. [2019-11-24 04:48:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9973 to 5368. [2019-11-24 04:48:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5368 states. [2019-11-24 04:48:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 9501 transitions. [2019-11-24 04:48:39,877 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 9501 transitions. Word has length 37 [2019-11-24 04:48:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:39,877 INFO L462 AbstractCegarLoop]: Abstraction has 5368 states and 9501 transitions. [2019-11-24 04:48:39,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 9501 transitions. [2019-11-24 04:48:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 04:48:39,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:39,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:39,880 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:39,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1818081198, now seen corresponding path program 1 times [2019-11-24 04:48:39,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:39,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615902461] [2019-11-24 04:48:39,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:40,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615902461] [2019-11-24 04:48:40,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:40,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:40,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074769325] [2019-11-24 04:48:40,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:48:40,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:48:40,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:40,095 INFO L87 Difference]: Start difference. First operand 5368 states and 9501 transitions. Second operand 3 states. [2019-11-24 04:48:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:41,004 INFO L93 Difference]: Finished difference Result 10825 states and 19271 transitions. [2019-11-24 04:48:41,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:48:41,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 04:48:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:41,015 INFO L225 Difference]: With dead ends: 10825 [2019-11-24 04:48:41,015 INFO L226 Difference]: Without dead ends: 5843 [2019-11-24 04:48:41,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:48:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5843 states. [2019-11-24 04:48:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5843 to 5368. [2019-11-24 04:48:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5368 states. [2019-11-24 04:48:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 9426 transitions. [2019-11-24 04:48:41,271 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 9426 transitions. Word has length 40 [2019-11-24 04:48:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:41,271 INFO L462 AbstractCegarLoop]: Abstraction has 5368 states and 9426 transitions. [2019-11-24 04:48:41,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:48:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 9426 transitions. [2019-11-24 04:48:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:48:41,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:41,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:41,274 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash 212178452, now seen corresponding path program 1 times [2019-11-24 04:48:41,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:41,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190398517] [2019-11-24 04:48:41,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:41,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190398517] [2019-11-24 04:48:41,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:41,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:48:41,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579674727] [2019-11-24 04:48:41,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:41,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:41,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:41,574 INFO L87 Difference]: Start difference. First operand 5368 states and 9426 transitions. Second operand 5 states. [2019-11-24 04:48:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:43,684 INFO L93 Difference]: Finished difference Result 18115 states and 32561 transitions. [2019-11-24 04:48:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:48:43,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-24 04:48:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:43,701 INFO L225 Difference]: With dead ends: 18115 [2019-11-24 04:48:43,701 INFO L226 Difference]: Without dead ends: 12950 [2019-11-24 04:48:43,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:48:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12950 states. [2019-11-24 04:48:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12950 to 5072. [2019-11-24 04:48:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5072 states. [2019-11-24 04:48:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 8982 transitions. [2019-11-24 04:48:44,018 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 8982 transitions. Word has length 43 [2019-11-24 04:48:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:44,018 INFO L462 AbstractCegarLoop]: Abstraction has 5072 states and 8982 transitions. [2019-11-24 04:48:44,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 8982 transitions. [2019-11-24 04:48:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 04:48:44,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:44,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:44,021 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1866112924, now seen corresponding path program 1 times [2019-11-24 04:48:44,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:44,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641625361] [2019-11-24 04:48:44,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:44,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641625361] [2019-11-24 04:48:44,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:44,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:48:44,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181116125] [2019-11-24 04:48:44,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:48:44,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:44,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:48:44,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:44,251 INFO L87 Difference]: Start difference. First operand 5072 states and 8982 transitions. Second operand 5 states. [2019-11-24 04:48:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:44,958 INFO L93 Difference]: Finished difference Result 13985 states and 25023 transitions. [2019-11-24 04:48:44,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:48:44,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-24 04:48:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:44,969 INFO L225 Difference]: With dead ends: 13985 [2019-11-24 04:48:44,969 INFO L226 Difference]: Without dead ends: 9193 [2019-11-24 04:48:44,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:48:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9193 states. [2019-11-24 04:48:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9193 to 5075. [2019-11-24 04:48:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5075 states. [2019-11-24 04:48:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 8984 transitions. [2019-11-24 04:48:45,430 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 8984 transitions. Word has length 44 [2019-11-24 04:48:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:45,430 INFO L462 AbstractCegarLoop]: Abstraction has 5075 states and 8984 transitions. [2019-11-24 04:48:45,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:48:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 8984 transitions. [2019-11-24 04:48:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:48:45,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:45,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:45,432 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:45,432 INFO L82 PathProgramCache]: Analyzing trace with hash 950067987, now seen corresponding path program 1 times [2019-11-24 04:48:45,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:45,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368681310] [2019-11-24 04:48:45,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:46,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368681310] [2019-11-24 04:48:46,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:46,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:48:46,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859777335] [2019-11-24 04:48:46,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:48:46,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:46,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:48:46,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:48:46,283 INFO L87 Difference]: Start difference. First operand 5075 states and 8984 transitions. Second operand 21 states. [2019-11-24 04:48:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:49,512 INFO L93 Difference]: Finished difference Result 15724 states and 28314 transitions. [2019-11-24 04:48:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:49,513 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2019-11-24 04:48:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:49,526 INFO L225 Difference]: With dead ends: 15724 [2019-11-24 04:48:49,526 INFO L226 Difference]: Without dead ends: 10924 [2019-11-24 04:48:49,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:48:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10924 states. [2019-11-24 04:48:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10924 to 4824. [2019-11-24 04:48:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4824 states. [2019-11-24 04:48:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 8573 transitions. [2019-11-24 04:48:50,057 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 8573 transitions. Word has length 47 [2019-11-24 04:48:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:50,058 INFO L462 AbstractCegarLoop]: Abstraction has 4824 states and 8573 transitions. [2019-11-24 04:48:50,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:48:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 8573 transitions. [2019-11-24 04:48:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:48:50,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:50,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:50,060 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:50,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1811959364, now seen corresponding path program 1 times [2019-11-24 04:48:50,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:50,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039519192] [2019-11-24 04:48:50,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:50,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039519192] [2019-11-24 04:48:50,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:50,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:48:50,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3202994] [2019-11-24 04:48:50,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:48:50,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:50,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:48:50,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:48:50,759 INFO L87 Difference]: Start difference. First operand 4824 states and 8573 transitions. Second operand 21 states. [2019-11-24 04:48:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:53,742 INFO L93 Difference]: Finished difference Result 15400 states and 27756 transitions. [2019-11-24 04:48:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:48:53,742 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2019-11-24 04:48:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:53,756 INFO L225 Difference]: With dead ends: 15400 [2019-11-24 04:48:53,756 INFO L226 Difference]: Without dead ends: 10838 [2019-11-24 04:48:53,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:48:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10838 states. [2019-11-24 04:48:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10838 to 4876. [2019-11-24 04:48:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4876 states. [2019-11-24 04:48:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 8585 transitions. [2019-11-24 04:48:54,234 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 8585 transitions. Word has length 49 [2019-11-24 04:48:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:54,234 INFO L462 AbstractCegarLoop]: Abstraction has 4876 states and 8585 transitions. [2019-11-24 04:48:54,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-24 04:48:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 8585 transitions. [2019-11-24 04:48:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 04:48:54,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:54,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:54,236 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:54,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1957501218, now seen corresponding path program 1 times [2019-11-24 04:48:54,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:54,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492777454] [2019-11-24 04:48:54,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:54,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492777454] [2019-11-24 04:48:54,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:54,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:48:54,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52099413] [2019-11-24 04:48:54,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:48:54,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:54,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:48:54,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:48:54,448 INFO L87 Difference]: Start difference. First operand 4876 states and 8585 transitions. Second operand 4 states. [2019-11-24 04:48:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:48:56,202 INFO L93 Difference]: Finished difference Result 12109 states and 21286 transitions. [2019-11-24 04:48:56,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:48:56,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-24 04:48:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:48:56,210 INFO L225 Difference]: With dead ends: 12109 [2019-11-24 04:48:56,210 INFO L226 Difference]: Without dead ends: 7471 [2019-11-24 04:48:56,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:48:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2019-11-24 04:48:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 4883. [2019-11-24 04:48:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4883 states. [2019-11-24 04:48:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4883 states to 4883 states and 8582 transitions. [2019-11-24 04:48:56,715 INFO L78 Accepts]: Start accepts. Automaton has 4883 states and 8582 transitions. Word has length 52 [2019-11-24 04:48:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:48:56,716 INFO L462 AbstractCegarLoop]: Abstraction has 4883 states and 8582 transitions. [2019-11-24 04:48:56,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:48:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4883 states and 8582 transitions. [2019-11-24 04:48:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 04:48:56,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:48:56,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:48:56,717 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:48:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:48:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1044729739, now seen corresponding path program 1 times [2019-11-24 04:48:56,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:48:56,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915331329] [2019-11-24 04:48:56,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:48:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:48:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:48:57,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915331329] [2019-11-24 04:48:57,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:48:57,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-11-24 04:48:57,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752482811] [2019-11-24 04:48:57,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-24 04:48:57,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:48:57,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-24 04:48:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=259, Unknown=0, NotChecked=0, Total=420 [2019-11-24 04:48:57,502 INFO L87 Difference]: Start difference. First operand 4883 states and 8582 transitions. Second operand 21 states. [2019-11-24 04:49:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:49:00,568 INFO L93 Difference]: Finished difference Result 13695 states and 24303 transitions. [2019-11-24 04:49:00,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:49:00,569 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2019-11-24 04:49:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:49:00,579 INFO L225 Difference]: With dead ends: 13695 [2019-11-24 04:49:00,579 INFO L226 Difference]: Without dead ends: 9303 [2019-11-24 04:49:00,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=508, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:49:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9303 states.