/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_spec2_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:43:19,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:43:19,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:43:19,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:43:19,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:43:19,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:43:19,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:43:19,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:43:19,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:43:19,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:43:19,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:43:19,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:43:19,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:43:19,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:43:19,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:43:19,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:43:19,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:43:19,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:43:19,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:43:19,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:43:19,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:43:19,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:43:19,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:43:19,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:43:19,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:43:19,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:43:19,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:43:19,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:43:19,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:43:19,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:43:19,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:43:19,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:43:19,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:43:19,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:43:19,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:43:19,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:43:19,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:43:19,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:43:19,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:43:19,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:43:19,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:43:19,943 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:43:19,961 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:43:19,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:43:19,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:43:19,962 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:43:19,962 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:43:19,963 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:43:19,963 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:43:19,963 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:43:19,963 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:43:19,963 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:43:19,964 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:43:19,965 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:43:19,965 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:43:19,965 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:43:19,966 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:43:19,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:43:19,967 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:43:19,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:43:19,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:43:19,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:43:19,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:43:19,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:43:19,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:43:19,969 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:43:19,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:43:19,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:43:19,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:43:19,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:43:19,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:43:19,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:43:19,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:43:19,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:43:19,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:43:19,972 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:43:19,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:43:19,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:43:19,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:43:19,973 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:43:20,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:43:20,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:43:20,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:43:20,271 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:43:20,272 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:43:20,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c [2019-11-24 04:43:20,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154df05f9/cc300c3d17a84aefb7d8a5c35b75a8fd/FLAGac2f25d98 [2019-11-24 04:43:21,006 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:43:21,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c [2019-11-24 04:43:21,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154df05f9/cc300c3d17a84aefb7d8a5c35b75a8fd/FLAGac2f25d98 [2019-11-24 04:43:21,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154df05f9/cc300c3d17a84aefb7d8a5c35b75a8fd [2019-11-24 04:43:21,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:43:21,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:43:21,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:43:21,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:43:21,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:43:21,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:43:21" (1/1) ... [2019-11-24 04:43:21,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcfe847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:21, skipping insertion in model container [2019-11-24 04:43:21,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:43:21" (1/1) ... [2019-11-24 04:43:21,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:43:21,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:43:21,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:43:21,953 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:43:22,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:43:22,165 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:43:22,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:22 WrapperNode [2019-11-24 04:43:22,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:43:22,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:43:22,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:43:22,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:43:22,176 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:43:22" (1/1) ... [2019-11-24 04:43:22,210 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:43:22" (1/1) ... [2019-11-24 04:43:22,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:43:22,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:43:22,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:43:22,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:43:22,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:22" (1/1) ... [2019-11-24 04:43:22,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:22" (1/1) ... [2019-11-24 04:43:22,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:22" (1/1) ... [2019-11-24 04:43:22,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:22" (1/1) ... [2019-11-24 04:43:22,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:22" (1/1) ... [2019-11-24 04:43:22,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:22" (1/1) ... [2019-11-24 04:43:22,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:22" (1/1) ... [2019-11-24 04:43:22,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:43:22,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:43:22,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:43:22,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:43:22,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:22" (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:43:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:43:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:43:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:43:22,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:44:00,158 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:44:00,158 INFO L284 CfgBuilder]: Removed 893 assume(true) statements. [2019-11-24 04:44:00,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:44:00 BoogieIcfgContainer [2019-11-24 04:44:00,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:44:00,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:44:00,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:44:00,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:44:00,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:43:21" (1/3) ... [2019-11-24 04:44:00,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7da54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:44:00, skipping insertion in model container [2019-11-24 04:44:00,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:22" (2/3) ... [2019-11-24 04:44:00,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7da54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:44:00, skipping insertion in model container [2019-11-24 04:44:00,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:44:00" (3/3) ... [2019-11-24 04:44:00,169 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product31.cil.c [2019-11-24 04:44:00,176 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:44:00,185 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:44:00,194 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:44:00,243 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:44:00,243 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:44:00,243 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:44:00,243 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:44:00,244 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:44:00,244 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:44:00,244 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:44:00,244 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:44:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states. [2019-11-24 04:44:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:44:00,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:00,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:00,311 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:44:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:00,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1413254334, now seen corresponding path program 1 times [2019-11-24 04:44:00,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:00,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980637066] [2019-11-24 04:44:00,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:00,758 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:44:00,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980637066] [2019-11-24 04:44:00,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:00,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:44:00,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434999581] [2019-11-24 04:44:00,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:44:00,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:00,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:44:00,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:44:00,784 INFO L87 Difference]: Start difference. First operand 1241 states. Second operand 2 states. [2019-11-24 04:44:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:00,890 INFO L93 Difference]: Finished difference Result 1258 states and 2415 transitions. [2019-11-24 04:44:00,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:44:00,891 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-24 04:44:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:00,922 INFO L225 Difference]: With dead ends: 1258 [2019-11-24 04:44:00,922 INFO L226 Difference]: Without dead ends: 1239 [2019-11-24 04:44:00,927 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:44:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-11-24 04:44:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2019-11-24 04:44:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-11-24 04:44:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2385 transitions. [2019-11-24 04:44:01,058 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2385 transitions. Word has length 14 [2019-11-24 04:44:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:01,059 INFO L462 AbstractCegarLoop]: Abstraction has 1239 states and 2385 transitions. [2019-11-24 04:44:01,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:44:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2385 transitions. [2019-11-24 04:44:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:44:01,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:01,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:01,067 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:44:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:01,067 INFO L82 PathProgramCache]: Analyzing trace with hash -883103765, now seen corresponding path program 1 times [2019-11-24 04:44:01,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:01,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948682077] [2019-11-24 04:44:01,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:01,202 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:44:01,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948682077] [2019-11-24 04:44:01,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:01,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:01,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4527159] [2019-11-24 04:44:01,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:01,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:01,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:01,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:01,207 INFO L87 Difference]: Start difference. First operand 1239 states and 2385 transitions. Second operand 3 states. [2019-11-24 04:44:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:01,554 INFO L93 Difference]: Finished difference Result 2321 states and 4462 transitions. [2019-11-24 04:44:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:01,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:44:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:01,566 INFO L225 Difference]: With dead ends: 2321 [2019-11-24 04:44:01,566 INFO L226 Difference]: Without dead ends: 1681 [2019-11-24 04:44:01,574 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:44:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-11-24 04:44:01,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1644. [2019-11-24 04:44:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1644 states. [2019-11-24 04:44:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 3163 transitions. [2019-11-24 04:44:01,636 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 3163 transitions. Word has length 15 [2019-11-24 04:44:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:01,636 INFO L462 AbstractCegarLoop]: Abstraction has 1644 states and 3163 transitions. [2019-11-24 04:44:01,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 3163 transitions. [2019-11-24 04:44:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:44:01,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:01,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:01,641 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:44:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:01,642 INFO L82 PathProgramCache]: Analyzing trace with hash 200456255, now seen corresponding path program 1 times [2019-11-24 04:44:01,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:01,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941597693] [2019-11-24 04:44:01,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:01,837 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:44:01,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941597693] [2019-11-24 04:44:01,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:01,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:01,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477245505] [2019-11-24 04:44:01,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:01,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:01,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:01,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:01,844 INFO L87 Difference]: Start difference. First operand 1644 states and 3163 transitions. Second operand 3 states. [2019-11-24 04:44:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:02,214 INFO L93 Difference]: Finished difference Result 3585 states and 6894 transitions. [2019-11-24 04:44:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:02,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 04:44:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:02,235 INFO L225 Difference]: With dead ends: 3585 [2019-11-24 04:44:02,243 INFO L226 Difference]: Without dead ends: 2557 [2019-11-24 04:44:02,247 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:44:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2019-11-24 04:44:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2444. [2019-11-24 04:44:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2019-11-24 04:44:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 4701 transitions. [2019-11-24 04:44:02,354 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 4701 transitions. Word has length 17 [2019-11-24 04:44:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:02,354 INFO L462 AbstractCegarLoop]: Abstraction has 2444 states and 4701 transitions. [2019-11-24 04:44:02,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 4701 transitions. [2019-11-24 04:44:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:44:02,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:02,358 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:44:02,359 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:44:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:02,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1396134617, now seen corresponding path program 1 times [2019-11-24 04:44:02,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:02,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47065908] [2019-11-24 04:44:02,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:02,510 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:44:02,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47065908] [2019-11-24 04:44:02,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:02,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:02,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008782846] [2019-11-24 04:44:02,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:02,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:02,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:02,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:02,515 INFO L87 Difference]: Start difference. First operand 2444 states and 4701 transitions. Second operand 3 states. [2019-11-24 04:44:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:03,078 INFO L93 Difference]: Finished difference Result 4259 states and 8187 transitions. [2019-11-24 04:44:03,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:03,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:44:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:03,093 INFO L225 Difference]: With dead ends: 4259 [2019-11-24 04:44:03,094 INFO L226 Difference]: Without dead ends: 2434 [2019-11-24 04:44:03,098 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:44:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2019-11-24 04:44:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2019-11-24 04:44:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-11-24 04:44:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 4675 transitions. [2019-11-24 04:44:03,190 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 4675 transitions. Word has length 19 [2019-11-24 04:44:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:03,191 INFO L462 AbstractCegarLoop]: Abstraction has 2434 states and 4675 transitions. [2019-11-24 04:44:03,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:03,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 4675 transitions. [2019-11-24 04:44:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:44:03,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:03,194 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] [2019-11-24 04:44:03,194 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:44:03,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:03,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1629707108, now seen corresponding path program 1 times [2019-11-24 04:44:03,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:03,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617012022] [2019-11-24 04:44:03,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:03,321 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:44:03,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617012022] [2019-11-24 04:44:03,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:03,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:03,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975553171] [2019-11-24 04:44:03,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:03,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:03,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:03,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:03,324 INFO L87 Difference]: Start difference. First operand 2434 states and 4675 transitions. Second operand 3 states. [2019-11-24 04:44:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:03,705 INFO L93 Difference]: Finished difference Result 5956 states and 11437 transitions. [2019-11-24 04:44:03,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:03,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 04:44:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:03,729 INFO L225 Difference]: With dead ends: 5956 [2019-11-24 04:44:03,729 INFO L226 Difference]: Without dead ends: 4158 [2019-11-24 04:44:03,733 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:44:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2019-11-24 04:44:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 4006. [2019-11-24 04:44:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4006 states. [2019-11-24 04:44:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4006 states to 4006 states and 7688 transitions. [2019-11-24 04:44:03,911 INFO L78 Accepts]: Start accepts. Automaton has 4006 states and 7688 transitions. Word has length 20 [2019-11-24 04:44:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:03,912 INFO L462 AbstractCegarLoop]: Abstraction has 4006 states and 7688 transitions. [2019-11-24 04:44:03,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 4006 states and 7688 transitions. [2019-11-24 04:44:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:44:03,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:03,915 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:44:03,915 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:44:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1018710753, now seen corresponding path program 1 times [2019-11-24 04:44:03,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:03,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015438828] [2019-11-24 04:44:03,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:04,110 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:44:04,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015438828] [2019-11-24 04:44:04,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:04,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:04,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596498737] [2019-11-24 04:44:04,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:04,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:04,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:04,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:04,114 INFO L87 Difference]: Start difference. First operand 4006 states and 7688 transitions. Second operand 3 states. [2019-11-24 04:44:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:04,487 INFO L93 Difference]: Finished difference Result 4006 states and 7688 transitions. [2019-11-24 04:44:04,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:04,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:44:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:04,513 INFO L225 Difference]: With dead ends: 4006 [2019-11-24 04:44:04,513 INFO L226 Difference]: Without dead ends: 3999 [2019-11-24 04:44:04,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:44:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2019-11-24 04:44:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3999. [2019-11-24 04:44:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3999 states. [2019-11-24 04:44:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 7676 transitions. [2019-11-24 04:44:04,734 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 7676 transitions. Word has length 21 [2019-11-24 04:44:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:04,735 INFO L462 AbstractCegarLoop]: Abstraction has 3999 states and 7676 transitions. [2019-11-24 04:44:04,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 7676 transitions. [2019-11-24 04:44:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 04:44:04,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:04,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:04,748 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:44:04,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:04,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1216613175, now seen corresponding path program 1 times [2019-11-24 04:44:04,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:04,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904760118] [2019-11-24 04:44:04,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:05,076 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:44:05,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904760118] [2019-11-24 04:44:05,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:05,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:05,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132150043] [2019-11-24 04:44:05,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:05,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:05,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:05,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:05,080 INFO L87 Difference]: Start difference. First operand 3999 states and 7676 transitions. Second operand 3 states. [2019-11-24 04:44:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:06,359 INFO L93 Difference]: Finished difference Result 10705 states and 20518 transitions. [2019-11-24 04:44:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:06,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 04:44:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:06,416 INFO L225 Difference]: With dead ends: 10705 [2019-11-24 04:44:06,416 INFO L226 Difference]: Without dead ends: 7141 [2019-11-24 04:44:06,424 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:44:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7141 states. [2019-11-24 04:44:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7141 to 3959. [2019-11-24 04:44:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3959 states. [2019-11-24 04:44:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 7576 transitions. [2019-11-24 04:44:06,641 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 7576 transitions. Word has length 31 [2019-11-24 04:44:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:06,641 INFO L462 AbstractCegarLoop]: Abstraction has 3959 states and 7576 transitions. [2019-11-24 04:44:06,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 7576 transitions. [2019-11-24 04:44:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 04:44:06,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:06,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:06,645 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:44:06,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:06,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1618507493, now seen corresponding path program 1 times [2019-11-24 04:44:06,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:06,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063405506] [2019-11-24 04:44:06,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:06,905 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:44:06,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063405506] [2019-11-24 04:44:06,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:06,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:06,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890354909] [2019-11-24 04:44:06,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:06,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:06,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:06,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:06,908 INFO L87 Difference]: Start difference. First operand 3959 states and 7576 transitions. Second operand 3 states. [2019-11-24 04:44:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:08,177 INFO L93 Difference]: Finished difference Result 10611 states and 20304 transitions. [2019-11-24 04:44:08,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:08,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 04:44:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:08,198 INFO L225 Difference]: With dead ends: 10611 [2019-11-24 04:44:08,198 INFO L226 Difference]: Without dead ends: 7109 [2019-11-24 04:44:08,206 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:44:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7109 states. [2019-11-24 04:44:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7109 to 3929. [2019-11-24 04:44:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2019-11-24 04:44:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 7486 transitions. [2019-11-24 04:44:08,396 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 7486 transitions. Word has length 32 [2019-11-24 04:44:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:08,396 INFO L462 AbstractCegarLoop]: Abstraction has 3929 states and 7486 transitions. [2019-11-24 04:44:08,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 7486 transitions. [2019-11-24 04:44:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:44:08,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:08,400 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:44:08,400 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:44:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2056997078, now seen corresponding path program 1 times [2019-11-24 04:44:08,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:08,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363039227] [2019-11-24 04:44:08,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:08,641 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:44:08,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363039227] [2019-11-24 04:44:08,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:08,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:08,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498161599] [2019-11-24 04:44:08,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:08,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:08,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:08,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:08,643 INFO L87 Difference]: Start difference. First operand 3929 states and 7486 transitions. Second operand 3 states. [2019-11-24 04:44:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:09,756 INFO L93 Difference]: Finished difference Result 10532 states and 20105 transitions. [2019-11-24 04:44:09,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:09,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:44:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:09,774 INFO L225 Difference]: With dead ends: 10532 [2019-11-24 04:44:09,774 INFO L226 Difference]: Without dead ends: 7087 [2019-11-24 04:44:09,781 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:44:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7087 states. [2019-11-24 04:44:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7087 to 3909. [2019-11-24 04:44:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3909 states. [2019-11-24 04:44:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 7406 transitions. [2019-11-24 04:44:09,993 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 7406 transitions. Word has length 34 [2019-11-24 04:44:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:09,994 INFO L462 AbstractCegarLoop]: Abstraction has 3909 states and 7406 transitions. [2019-11-24 04:44:09,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 7406 transitions. [2019-11-24 04:44:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:44:09,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:09,998 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:44:09,999 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:44:09,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:09,999 INFO L82 PathProgramCache]: Analyzing trace with hash -735371843, now seen corresponding path program 1 times [2019-11-24 04:44:09,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:09,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999545162] [2019-11-24 04:44:10,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:10,279 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:44:10,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999545162] [2019-11-24 04:44:10,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:10,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:10,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924328303] [2019-11-24 04:44:10,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:10,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:10,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:10,283 INFO L87 Difference]: Start difference. First operand 3909 states and 7406 transitions. Second operand 3 states. [2019-11-24 04:44:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:12,622 INFO L93 Difference]: Finished difference Result 10468 states and 19921 transitions. [2019-11-24 04:44:12,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:12,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:44:12,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:12,638 INFO L225 Difference]: With dead ends: 10468 [2019-11-24 04:44:12,638 INFO L226 Difference]: Without dead ends: 7075 [2019-11-24 04:44:12,645 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:44:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2019-11-24 04:44:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 3899. [2019-11-24 04:44:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3899 states. [2019-11-24 04:44:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 7336 transitions. [2019-11-24 04:44:12,840 INFO L78 Accepts]: Start accepts. Automaton has 3899 states and 7336 transitions. Word has length 37 [2019-11-24 04:44:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:12,841 INFO L462 AbstractCegarLoop]: Abstraction has 3899 states and 7336 transitions. [2019-11-24 04:44:12,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3899 states and 7336 transitions. [2019-11-24 04:44:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:44:12,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:12,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:12,846 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:44:12,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash 148549703, now seen corresponding path program 1 times [2019-11-24 04:44:12,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:12,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066739198] [2019-11-24 04:44:12,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:13,122 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:44:13,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066739198] [2019-11-24 04:44:13,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:13,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:13,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622076071] [2019-11-24 04:44:13,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:13,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:13,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:13,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:13,126 INFO L87 Difference]: Start difference. First operand 3899 states and 7336 transitions. Second operand 3 states. [2019-11-24 04:44:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:13,961 INFO L93 Difference]: Finished difference Result 7636 states and 14420 transitions. [2019-11-24 04:44:13,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:13,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:44:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:13,971 INFO L225 Difference]: With dead ends: 7636 [2019-11-24 04:44:13,971 INFO L226 Difference]: Without dead ends: 4290 [2019-11-24 04:44:13,977 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:44:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4290 states. [2019-11-24 04:44:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4290 to 3899. [2019-11-24 04:44:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3899 states. [2019-11-24 04:44:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 7276 transitions. [2019-11-24 04:44:14,190 INFO L78 Accepts]: Start accepts. Automaton has 3899 states and 7276 transitions. Word has length 41 [2019-11-24 04:44:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:14,192 INFO L462 AbstractCegarLoop]: Abstraction has 3899 states and 7276 transitions. [2019-11-24 04:44:14,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3899 states and 7276 transitions. [2019-11-24 04:44:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 04:44:14,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:14,196 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:14,196 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:44:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1053605534, now seen corresponding path program 1 times [2019-11-24 04:44:14,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:14,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854647298] [2019-11-24 04:44:14,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:14,511 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:44:14,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854647298] [2019-11-24 04:44:14,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:14,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:44:14,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838362381] [2019-11-24 04:44:14,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:44:14,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:14,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:44:14,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:44:14,514 INFO L87 Difference]: Start difference. First operand 3899 states and 7276 transitions. Second operand 5 states. [2019-11-24 04:44:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:16,898 INFO L93 Difference]: Finished difference Result 16804 states and 31740 transitions. [2019-11-24 04:44:16,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:44:16,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-24 04:44:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:16,939 INFO L225 Difference]: With dead ends: 16804 [2019-11-24 04:44:16,939 INFO L226 Difference]: Without dead ends: 12930 [2019-11-24 04:44:16,948 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:44:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12930 states. [2019-11-24 04:44:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12930 to 5021. [2019-11-24 04:44:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5021 states. [2019-11-24 04:44:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5021 states to 5021 states and 8934 transitions. [2019-11-24 04:44:17,266 INFO L78 Accepts]: Start accepts. Automaton has 5021 states and 8934 transitions. Word has length 45 [2019-11-24 04:44:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:17,266 INFO L462 AbstractCegarLoop]: Abstraction has 5021 states and 8934 transitions. [2019-11-24 04:44:17,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:44:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5021 states and 8934 transitions. [2019-11-24 04:44:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:44:17,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:17,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:17,270 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:44:17,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:17,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1861870487, now seen corresponding path program 1 times [2019-11-24 04:44:17,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:17,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977662044] [2019-11-24 04:44:17,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:18,098 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:44:18,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977662044] [2019-11-24 04:44:18,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:18,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:44:18,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156890038] [2019-11-24 04:44:18,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:44:18,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:44:18,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:44:18,105 INFO L87 Difference]: Start difference. First operand 5021 states and 8934 transitions. Second operand 22 states. [2019-11-24 04:44:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:20,293 INFO L93 Difference]: Finished difference Result 15587 states and 28184 transitions. [2019-11-24 04:44:20,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:44:20,293 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-11-24 04:44:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:20,314 INFO L225 Difference]: With dead ends: 15587 [2019-11-24 04:44:20,314 INFO L226 Difference]: Without dead ends: 10818 [2019-11-24 04:44:20,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:44:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10818 states. [2019-11-24 04:44:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10818 to 4740. [2019-11-24 04:44:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4740 states. [2019-11-24 04:44:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 8444 transitions. [2019-11-24 04:44:20,717 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 8444 transitions. Word has length 46 [2019-11-24 04:44:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:20,717 INFO L462 AbstractCegarLoop]: Abstraction has 4740 states and 8444 transitions. [2019-11-24 04:44:20,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:44:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 8444 transitions. [2019-11-24 04:44:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:44:20,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:20,720 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:44:20,720 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:44:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1891265649, now seen corresponding path program 1 times [2019-11-24 04:44:20,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:20,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973036087] [2019-11-24 04:44:20,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:20,985 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:44:20,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973036087] [2019-11-24 04:44:20,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:20,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:20,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324014324] [2019-11-24 04:44:20,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:44:20,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:44:20,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:44:20,988 INFO L87 Difference]: Start difference. First operand 4740 states and 8444 transitions. Second operand 4 states. [2019-11-24 04:44:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:22,818 INFO L93 Difference]: Finished difference Result 13295 states and 23879 transitions. [2019-11-24 04:44:22,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:44:22,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-24 04:44:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:22,830 INFO L225 Difference]: With dead ends: 13295 [2019-11-24 04:44:22,830 INFO L226 Difference]: Without dead ends: 8785 [2019-11-24 04:44:22,837 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:44:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8785 states. [2019-11-24 04:44:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8785 to 4565. [2019-11-24 04:44:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-11-24 04:44:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 8140 transitions. [2019-11-24 04:44:23,418 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 8140 transitions. Word has length 47 [2019-11-24 04:44:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:23,420 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 8140 transitions. [2019-11-24 04:44:23,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:44:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 8140 transitions. [2019-11-24 04:44:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:44:23,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:23,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:23,424 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:44:23,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:23,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1743071424, now seen corresponding path program 1 times [2019-11-24 04:44:23,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:23,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461962005] [2019-11-24 04:44:23,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:24,177 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:44:24,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461962005] [2019-11-24 04:44:24,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:24,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-24 04:44:24,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692071059] [2019-11-24 04:44:24,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-24 04:44:24,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:24,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-24 04:44:24,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:44:24,180 INFO L87 Difference]: Start difference. First operand 4565 states and 8140 transitions. Second operand 22 states. [2019-11-24 04:44:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:26,961 INFO L93 Difference]: Finished difference Result 12718 states and 22945 transitions. [2019-11-24 04:44:26,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:44:26,962 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-11-24 04:44:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:26,970 INFO L225 Difference]: With dead ends: 12718 [2019-11-24 04:44:26,971 INFO L226 Difference]: Without dead ends: 8629 [2019-11-24 04:44:26,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2019-11-24 04:44:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8629 states. [2019-11-24 04:44:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8629 to 4747. [2019-11-24 04:44:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4747 states. [2019-11-24 04:44:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 8389 transitions. [2019-11-24 04:44:27,498 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 8389 transitions. Word has length 48 [2019-11-24 04:44:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:27,498 INFO L462 AbstractCegarLoop]: Abstraction has 4747 states and 8389 transitions. [2019-11-24 04:44:27,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-24 04:44:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 8389 transitions. [2019-11-24 04:44:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:44:27,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:27,501 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:44:27,501 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:44:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash 335912376, now seen corresponding path program 1 times [2019-11-24 04:44:27,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:27,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875099901] [2019-11-24 04:44:27,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:27,731 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:44:27,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875099901] [2019-11-24 04:44:27,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:27,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:44:27,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395068767] [2019-11-24 04:44:27,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:44:27,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:27,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:44:27,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:44:27,733 INFO L87 Difference]: Start difference. First operand 4747 states and 8389 transitions. Second operand 4 states. [2019-11-24 04:44:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:28,456 INFO L93 Difference]: Finished difference Result 11733 states and 20723 transitions. [2019-11-24 04:44:28,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:44:28,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-24 04:44:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:28,465 INFO L225 Difference]: With dead ends: 11733 [2019-11-24 04:44:28,465 INFO L226 Difference]: Without dead ends: 7230 [2019-11-24 04:44:28,471 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:44:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-11-24 04:44:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 4664. [2019-11-24 04:44:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-11-24 04:44:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 8257 transitions. [2019-11-24 04:44:29,017 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 8257 transitions. Word has length 49 [2019-11-24 04:44:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:29,017 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 8257 transitions. [2019-11-24 04:44:29,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:44:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 8257 transitions. [2019-11-24 04:44:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 04:44:29,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:29,019 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:29,020 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:44:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:29,020 INFO L82 PathProgramCache]: Analyzing trace with hash -138720569, now seen corresponding path program 1 times [2019-11-24 04:44:29,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:29,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513309709] [2019-11-24 04:44:29,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:44:29,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513309709] [2019-11-24 04:44:29,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:29,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:44:29,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371546959] [2019-11-24 04:44:29,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:44:29,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:44:29,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:44:29,202 INFO L87 Difference]: Start difference. First operand 4664 states and 8257 transitions. Second operand 5 states.