/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:46:27,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:46:27,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:46:27,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:46:27,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:46:27,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:46:27,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:46:27,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:46:27,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:46:27,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:46:27,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:46:27,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:46:27,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:46:27,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:46:27,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:46:27,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:46:27,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:46:27,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:46:27,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:46:27,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:46:27,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:46:27,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:46:27,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:46:27,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:46:27,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:46:27,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:46:27,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:46:27,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:46:27,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:46:27,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:46:27,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:46:27,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:46:27,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:46:27,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:46:27,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:46:27,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:46:27,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:46:27,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:46:27,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:46:27,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:46:27,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:46:27,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 05:46:27,146 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:46:27,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:46:27,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:46:27,148 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:46:27,148 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:46:27,148 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:46:27,148 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:46:27,149 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:46:27,149 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:46:27,149 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:46:27,149 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:46:27,149 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:46:27,150 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:46:27,150 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:46:27,150 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:46:27,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:46:27,151 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:46:27,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:46:27,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:46:27,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:46:27,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:46:27,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:46:27,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:46:27,152 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:46:27,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:46:27,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:46:27,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:46:27,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:46:27,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:46:27,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:46:27,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:46:27,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:46:27,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:46:27,154 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:46:27,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:46:27,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:46:27,157 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:46:27,157 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:46:27,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:46:27,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:46:27,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:46:27,469 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:46:27,469 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:46:27,470 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-24 05:46:27,538 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7da65c96/fcb9b1dd75a046e3b22d9377ac4d6fb6/FLAG42e156f8c [2019-11-24 05:46:28,185 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:46:28,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-24 05:46:28,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7da65c96/fcb9b1dd75a046e3b22d9377ac4d6fb6/FLAG42e156f8c [2019-11-24 05:46:28,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7da65c96/fcb9b1dd75a046e3b22d9377ac4d6fb6 [2019-11-24 05:46:28,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:46:28,405 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:46:28,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:46:28,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:46:28,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:46:28,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:46:28" (1/1) ... [2019-11-24 05:46:28,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ea6bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:28, skipping insertion in model container [2019-11-24 05:46:28,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:46:28" (1/1) ... [2019-11-24 05:46:28,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:46:28,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:46:29,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:46:29,319 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:46:29,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:46:29,620 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:46:29,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29 WrapperNode [2019-11-24 05:46:29,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:46:29,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:46:29,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:46:29,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:46:29,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:46:29,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:46:29,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:46:29,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:46:29,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... [2019-11-24 05:46:29,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:46:29,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:46:29,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:46:29,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:46:29,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:46:29,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:46:29,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:46:32,120 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:46:32,120 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:46:32,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:46:32 BoogieIcfgContainer [2019-11-24 05:46:32,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:46:32,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:46:32,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:46:32,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:46:32,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:46:28" (1/3) ... [2019-11-24 05:46:32,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58991e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:46:32, skipping insertion in model container [2019-11-24 05:46:32,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:46:29" (2/3) ... [2019-11-24 05:46:32,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58991e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:46:32, skipping insertion in model container [2019-11-24 05:46:32,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:46:32" (3/3) ... [2019-11-24 05:46:32,132 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-24 05:46:32,144 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:46:32,153 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-24 05:46:32,167 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-24 05:46:32,201 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:46:32,201 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:46:32,201 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:46:32,202 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:46:32,202 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:46:32,202 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:46:32,202 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:46:32,202 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:46:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states. [2019-11-24 05:46:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:46:32,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:32,245 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 05:46:32,246 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:32,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1301084090, now seen corresponding path program 1 times [2019-11-24 05:46:32,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:32,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431776885] [2019-11-24 05:46:32,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:32,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431776885] [2019-11-24 05:46:32,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:32,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:32,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013141663] [2019-11-24 05:46:32,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:32,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:32,615 INFO L87 Difference]: Start difference. First operand 416 states. Second operand 3 states. [2019-11-24 05:46:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:32,763 INFO L93 Difference]: Finished difference Result 616 states and 1086 transitions. [2019-11-24 05:46:32,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:32,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-24 05:46:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:32,793 INFO L225 Difference]: With dead ends: 616 [2019-11-24 05:46:32,794 INFO L226 Difference]: Without dead ends: 499 [2019-11-24 05:46:32,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-24 05:46:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 493. [2019-11-24 05:46:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-24 05:46:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 633 transitions. [2019-11-24 05:46:32,905 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 633 transitions. Word has length 49 [2019-11-24 05:46:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:32,905 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 633 transitions. [2019-11-24 05:46:32,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 633 transitions. [2019-11-24 05:46:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:46:32,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:32,910 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 05:46:32,911 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:32,911 INFO L82 PathProgramCache]: Analyzing trace with hash 330742932, now seen corresponding path program 1 times [2019-11-24 05:46:32,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:32,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133796650] [2019-11-24 05:46:32,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:33,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133796650] [2019-11-24 05:46:33,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:33,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:33,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234537640] [2019-11-24 05:46:33,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:33,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:33,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:33,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:33,036 INFO L87 Difference]: Start difference. First operand 493 states and 633 transitions. Second operand 3 states. [2019-11-24 05:46:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:33,086 INFO L93 Difference]: Finished difference Result 824 states and 1089 transitions. [2019-11-24 05:46:33,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:33,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-24 05:46:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:33,090 INFO L225 Difference]: With dead ends: 824 [2019-11-24 05:46:33,090 INFO L226 Difference]: Without dead ends: 629 [2019-11-24 05:46:33,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-11-24 05:46:33,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 623. [2019-11-24 05:46:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-11-24 05:46:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 810 transitions. [2019-11-24 05:46:33,129 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 810 transitions. Word has length 49 [2019-11-24 05:46:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:33,129 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 810 transitions. [2019-11-24 05:46:33,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 810 transitions. [2019-11-24 05:46:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:46:33,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:33,132 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 05:46:33,132 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:33,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:33,133 INFO L82 PathProgramCache]: Analyzing trace with hash 720921363, now seen corresponding path program 1 times [2019-11-24 05:46:33,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:33,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915327392] [2019-11-24 05:46:33,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:33,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915327392] [2019-11-24 05:46:33,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:33,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:46:33,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448253745] [2019-11-24 05:46:33,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:46:33,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:46:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:33,233 INFO L87 Difference]: Start difference. First operand 623 states and 810 transitions. Second operand 3 states. [2019-11-24 05:46:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:33,329 INFO L93 Difference]: Finished difference Result 1119 states and 1477 transitions. [2019-11-24 05:46:33,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:46:33,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-24 05:46:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:33,334 INFO L225 Difference]: With dead ends: 1119 [2019-11-24 05:46:33,335 INFO L226 Difference]: Without dead ends: 874 [2019-11-24 05:46:33,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:46:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-24 05:46:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 867. [2019-11-24 05:46:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-11-24 05:46:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1132 transitions. [2019-11-24 05:46:33,366 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1132 transitions. Word has length 49 [2019-11-24 05:46:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:33,367 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 1132 transitions. [2019-11-24 05:46:33,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:46:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1132 transitions. [2019-11-24 05:46:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:46:33,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:33,370 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 05:46:33,370 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:33,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash 576637481, now seen corresponding path program 1 times [2019-11-24 05:46:33,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:33,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028003960] [2019-11-24 05:46:33,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:33,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028003960] [2019-11-24 05:46:33,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:33,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:46:33,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901347794] [2019-11-24 05:46:33,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:46:33,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:33,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:46:33,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:46:33,591 INFO L87 Difference]: Start difference. First operand 867 states and 1132 transitions. Second operand 11 states. [2019-11-24 05:46:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:36,065 INFO L93 Difference]: Finished difference Result 2687 states and 3575 transitions. [2019-11-24 05:46:36,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-24 05:46:36,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-11-24 05:46:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:36,079 INFO L225 Difference]: With dead ends: 2687 [2019-11-24 05:46:36,079 INFO L226 Difference]: Without dead ends: 2536 [2019-11-24 05:46:36,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-11-24 05:46:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2019-11-24 05:46:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 878. [2019-11-24 05:46:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-11-24 05:46:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1146 transitions. [2019-11-24 05:46:36,199 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1146 transitions. Word has length 49 [2019-11-24 05:46:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:36,200 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1146 transitions. [2019-11-24 05:46:36,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:46:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1146 transitions. [2019-11-24 05:46:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:46:36,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:36,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:46:36,203 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:36,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1587514867, now seen corresponding path program 1 times [2019-11-24 05:46:36,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:36,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284566304] [2019-11-24 05:46:36,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:36,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284566304] [2019-11-24 05:46:36,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:36,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:46:36,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164648231] [2019-11-24 05:46:36,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:46:36,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:36,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:46:36,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:46:36,370 INFO L87 Difference]: Start difference. First operand 878 states and 1146 transitions. Second operand 11 states. [2019-11-24 05:46:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:38,854 INFO L93 Difference]: Finished difference Result 2692 states and 3611 transitions. [2019-11-24 05:46:38,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-24 05:46:38,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-11-24 05:46:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:38,872 INFO L225 Difference]: With dead ends: 2692 [2019-11-24 05:46:38,873 INFO L226 Difference]: Without dead ends: 2559 [2019-11-24 05:46:38,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2019-11-24 05:46:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2019-11-24 05:46:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 894. [2019-11-24 05:46:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-11-24 05:46:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1169 transitions. [2019-11-24 05:46:38,985 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1169 transitions. Word has length 50 [2019-11-24 05:46:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:38,986 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1169 transitions. [2019-11-24 05:46:38,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:46:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1169 transitions. [2019-11-24 05:46:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:46:38,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:38,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:46:38,989 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:38,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:38,990 INFO L82 PathProgramCache]: Analyzing trace with hash 720952053, now seen corresponding path program 1 times [2019-11-24 05:46:38,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:38,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107811206] [2019-11-24 05:46:38,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:39,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107811206] [2019-11-24 05:46:39,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:39,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-24 05:46:39,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503518358] [2019-11-24 05:46:39,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-24 05:46:39,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:39,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-24 05:46:39,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:46:39,217 INFO L87 Difference]: Start difference. First operand 894 states and 1169 transitions. Second operand 12 states. [2019-11-24 05:46:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:44,108 INFO L93 Difference]: Finished difference Result 4576 states and 6172 transitions. [2019-11-24 05:46:44,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-24 05:46:44,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-24 05:46:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:44,130 INFO L225 Difference]: With dead ends: 4576 [2019-11-24 05:46:44,130 INFO L226 Difference]: Without dead ends: 4371 [2019-11-24 05:46:44,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=537, Invalid=1443, Unknown=0, NotChecked=0, Total=1980 [2019-11-24 05:46:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2019-11-24 05:46:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 915. [2019-11-24 05:46:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-11-24 05:46:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1196 transitions. [2019-11-24 05:46:44,258 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1196 transitions. Word has length 50 [2019-11-24 05:46:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:44,259 INFO L462 AbstractCegarLoop]: Abstraction has 915 states and 1196 transitions. [2019-11-24 05:46:44,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-24 05:46:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1196 transitions. [2019-11-24 05:46:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:46:44,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:44,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:46:44,261 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:44,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1197336436, now seen corresponding path program 1 times [2019-11-24 05:46:44,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:44,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208457969] [2019-11-24 05:46:44,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:44,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208457969] [2019-11-24 05:46:44,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:44,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-24 05:46:44,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326203831] [2019-11-24 05:46:44,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-24 05:46:44,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:44,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-24 05:46:44,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:46:44,386 INFO L87 Difference]: Start difference. First operand 915 states and 1196 transitions. Second operand 11 states. [2019-11-24 05:46:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:50,689 INFO L93 Difference]: Finished difference Result 12223 states and 16851 transitions. [2019-11-24 05:46:50,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-24 05:46:50,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-11-24 05:46:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:50,736 INFO L225 Difference]: With dead ends: 12223 [2019-11-24 05:46:50,737 INFO L226 Difference]: Without dead ends: 11650 [2019-11-24 05:46:50,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=983, Invalid=3307, Unknown=0, NotChecked=0, Total=4290 [2019-11-24 05:46:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11650 states. [2019-11-24 05:46:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11650 to 3402. [2019-11-24 05:46:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3402 states. [2019-11-24 05:46:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4608 transitions. [2019-11-24 05:46:51,451 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4608 transitions. Word has length 50 [2019-11-24 05:46:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:51,452 INFO L462 AbstractCegarLoop]: Abstraction has 3402 states and 4608 transitions. [2019-11-24 05:46:51,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-24 05:46:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4608 transitions. [2019-11-24 05:46:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:46:51,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:51,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:46:51,456 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash -931023793, now seen corresponding path program 1 times [2019-11-24 05:46:51,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:51,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371854087] [2019-11-24 05:46:51,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:51,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371854087] [2019-11-24 05:46:51,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:51,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 05:46:51,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235707619] [2019-11-24 05:46:51,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 05:46:51,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:51,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 05:46:51,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:46:51,553 INFO L87 Difference]: Start difference. First operand 3402 states and 4608 transitions. Second operand 9 states. [2019-11-24 05:46:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:54,102 INFO L93 Difference]: Finished difference Result 6830 states and 9281 transitions. [2019-11-24 05:46:54,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-24 05:46:54,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-11-24 05:46:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:54,126 INFO L225 Difference]: With dead ends: 6830 [2019-11-24 05:46:54,126 INFO L226 Difference]: Without dead ends: 6671 [2019-11-24 05:46:54,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2019-11-24 05:46:54,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2019-11-24 05:46:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 3413. [2019-11-24 05:46:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3413 states. [2019-11-24 05:46:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 4622 transitions. [2019-11-24 05:46:54,645 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 4622 transitions. Word has length 50 [2019-11-24 05:46:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:54,646 INFO L462 AbstractCegarLoop]: Abstraction has 3413 states and 4622 transitions. [2019-11-24 05:46:54,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 05:46:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 4622 transitions. [2019-11-24 05:46:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:46:54,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:54,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:46:54,651 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:54,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:54,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1791927347, now seen corresponding path program 1 times [2019-11-24 05:46:54,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:54,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138294456] [2019-11-24 05:46:54,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:54,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138294456] [2019-11-24 05:46:54,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:54,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 05:46:54,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110407232] [2019-11-24 05:46:54,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 05:46:54,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:54,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 05:46:54,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:46:54,743 INFO L87 Difference]: Start difference. First operand 3413 states and 4622 transitions. Second operand 9 states. [2019-11-24 05:46:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:46:56,475 INFO L93 Difference]: Finished difference Result 4507 states and 6084 transitions. [2019-11-24 05:46:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 05:46:56,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-11-24 05:46:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:46:56,483 INFO L225 Difference]: With dead ends: 4507 [2019-11-24 05:46:56,484 INFO L226 Difference]: Without dead ends: 4356 [2019-11-24 05:46:56,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:46:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4356 states. [2019-11-24 05:46:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4356 to 3413. [2019-11-24 05:46:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3413 states. [2019-11-24 05:46:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 4622 transitions. [2019-11-24 05:46:57,038 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 4622 transitions. Word has length 50 [2019-11-24 05:46:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:46:57,038 INFO L462 AbstractCegarLoop]: Abstraction has 3413 states and 4622 transitions. [2019-11-24 05:46:57,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 05:46:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 4622 transitions. [2019-11-24 05:46:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:46:57,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:46:57,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:46:57,043 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:46:57,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:46:57,043 INFO L82 PathProgramCache]: Analyzing trace with hash 73547785, now seen corresponding path program 1 times [2019-11-24 05:46:57,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:46:57,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196018192] [2019-11-24 05:46:57,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:46:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:46:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:46:57,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196018192] [2019-11-24 05:46:57,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:46:57,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 05:46:57,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305139390] [2019-11-24 05:46:57,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:46:57,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:46:57,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:46:57,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:46:57,136 INFO L87 Difference]: Start difference. First operand 3413 states and 4622 transitions. Second operand 10 states. [2019-11-24 05:47:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:01,652 INFO L93 Difference]: Finished difference Result 12350 states and 16902 transitions. [2019-11-24 05:47:01,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-24 05:47:01,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-11-24 05:47:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:01,674 INFO L225 Difference]: With dead ends: 12350 [2019-11-24 05:47:01,674 INFO L226 Difference]: Without dead ends: 11565 [2019-11-24 05:47:01,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-11-24 05:47:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11565 states. [2019-11-24 05:47:02,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11565 to 3413. [2019-11-24 05:47:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3413 states. [2019-11-24 05:47:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 4622 transitions. [2019-11-24 05:47:02,467 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 4622 transitions. Word has length 51 [2019-11-24 05:47:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:02,467 INFO L462 AbstractCegarLoop]: Abstraction has 3413 states and 4622 transitions. [2019-11-24 05:47:02,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:47:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 4622 transitions. [2019-11-24 05:47:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:02,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:02,471 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:02,471 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:02,472 INFO L82 PathProgramCache]: Analyzing trace with hash -277404319, now seen corresponding path program 1 times [2019-11-24 05:47:02,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:02,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43774709] [2019-11-24 05:47:02,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:02,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43774709] [2019-11-24 05:47:02,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:02,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:02,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151601019] [2019-11-24 05:47:02,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:02,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:02,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:02,558 INFO L87 Difference]: Start difference. First operand 3413 states and 4622 transitions. Second operand 8 states. [2019-11-24 05:47:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:04,921 INFO L93 Difference]: Finished difference Result 8703 states and 11930 transitions. [2019-11-24 05:47:04,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:47:04,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-24 05:47:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:04,931 INFO L225 Difference]: With dead ends: 8703 [2019-11-24 05:47:04,931 INFO L226 Difference]: Without dead ends: 6357 [2019-11-24 05:47:04,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:47:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6357 states. [2019-11-24 05:47:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6357 to 2218. [2019-11-24 05:47:05,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2019-11-24 05:47:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 2986 transitions. [2019-11-24 05:47:05,485 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 2986 transitions. Word has length 51 [2019-11-24 05:47:05,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:05,485 INFO L462 AbstractCegarLoop]: Abstraction has 2218 states and 2986 transitions. [2019-11-24 05:47:05,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 2986 transitions. [2019-11-24 05:47:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:05,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:05,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:05,488 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash 779980616, now seen corresponding path program 1 times [2019-11-24 05:47:05,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:05,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492924706] [2019-11-24 05:47:05,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:05,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492924706] [2019-11-24 05:47:05,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:05,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 05:47:05,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874972395] [2019-11-24 05:47:05,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 05:47:05,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:05,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 05:47:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:47:05,573 INFO L87 Difference]: Start difference. First operand 2218 states and 2986 transitions. Second operand 9 states. [2019-11-24 05:47:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:09,158 INFO L93 Difference]: Finished difference Result 7579 states and 10216 transitions. [2019-11-24 05:47:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-24 05:47:09,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-24 05:47:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:09,173 INFO L225 Difference]: With dead ends: 7579 [2019-11-24 05:47:09,173 INFO L226 Difference]: Without dead ends: 6922 [2019-11-24 05:47:09,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-11-24 05:47:09,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2019-11-24 05:47:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 2232. [2019-11-24 05:47:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-11-24 05:47:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3004 transitions. [2019-11-24 05:47:09,647 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3004 transitions. Word has length 51 [2019-11-24 05:47:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:09,648 INFO L462 AbstractCegarLoop]: Abstraction has 2232 states and 3004 transitions. [2019-11-24 05:47:09,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 05:47:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3004 transitions. [2019-11-24 05:47:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:09,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:09,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:09,650 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:09,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1138307873, now seen corresponding path program 1 times [2019-11-24 05:47:09,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:09,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269355312] [2019-11-24 05:47:09,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:09,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269355312] [2019-11-24 05:47:09,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:09,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:09,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673999670] [2019-11-24 05:47:09,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:09,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:09,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:09,744 INFO L87 Difference]: Start difference. First operand 2232 states and 3004 transitions. Second operand 8 states. [2019-11-24 05:47:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:13,418 INFO L93 Difference]: Finished difference Result 10352 states and 14166 transitions. [2019-11-24 05:47:13,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:47:13,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-24 05:47:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:13,427 INFO L225 Difference]: With dead ends: 10352 [2019-11-24 05:47:13,427 INFO L226 Difference]: Without dead ends: 8645 [2019-11-24 05:47:13,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:47:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8645 states. [2019-11-24 05:47:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8645 to 4866. [2019-11-24 05:47:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4866 states. [2019-11-24 05:47:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4866 states to 4866 states and 6592 transitions. [2019-11-24 05:47:14,685 INFO L78 Accepts]: Start accepts. Automaton has 4866 states and 6592 transitions. Word has length 51 [2019-11-24 05:47:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:14,686 INFO L462 AbstractCegarLoop]: Abstraction has 4866 states and 6592 transitions. [2019-11-24 05:47:14,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4866 states and 6592 transitions. [2019-11-24 05:47:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:14,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:14,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:14,689 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1799354087, now seen corresponding path program 1 times [2019-11-24 05:47:14,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:14,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169533845] [2019-11-24 05:47:14,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:14,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169533845] [2019-11-24 05:47:14,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:14,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:14,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028798993] [2019-11-24 05:47:14,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:14,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:14,770 INFO L87 Difference]: Start difference. First operand 4866 states and 6592 transitions. Second operand 8 states. [2019-11-24 05:47:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:20,822 INFO L93 Difference]: Finished difference Result 20099 states and 27735 transitions. [2019-11-24 05:47:20,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-24 05:47:20,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-24 05:47:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:20,836 INFO L225 Difference]: With dead ends: 20099 [2019-11-24 05:47:20,836 INFO L226 Difference]: Without dead ends: 16568 [2019-11-24 05:47:20,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-11-24 05:47:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16568 states. [2019-11-24 05:47:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16568 to 10631. [2019-11-24 05:47:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10631 states. [2019-11-24 05:47:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10631 states to 10631 states and 14563 transitions. [2019-11-24 05:47:23,839 INFO L78 Accepts]: Start accepts. Automaton has 10631 states and 14563 transitions. Word has length 51 [2019-11-24 05:47:23,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:23,839 INFO L462 AbstractCegarLoop]: Abstraction has 10631 states and 14563 transitions. [2019-11-24 05:47:23,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 10631 states and 14563 transitions. [2019-11-24 05:47:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:23,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:23,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:23,844 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:23,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:23,844 INFO L82 PathProgramCache]: Analyzing trace with hash 118934402, now seen corresponding path program 1 times [2019-11-24 05:47:23,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:23,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883410352] [2019-11-24 05:47:23,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:23,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883410352] [2019-11-24 05:47:23,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:23,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-24 05:47:23,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202226421] [2019-11-24 05:47:23,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 05:47:23,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:23,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 05:47:23,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:47:23,948 INFO L87 Difference]: Start difference. First operand 10631 states and 14563 transitions. Second operand 10 states. [2019-11-24 05:47:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:36,331 INFO L93 Difference]: Finished difference Result 34087 states and 46559 transitions. [2019-11-24 05:47:36,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-24 05:47:36,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-11-24 05:47:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:36,359 INFO L225 Difference]: With dead ends: 34087 [2019-11-24 05:47:36,359 INFO L226 Difference]: Without dead ends: 29110 [2019-11-24 05:47:36,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=554, Unknown=0, NotChecked=0, Total=812 [2019-11-24 05:47:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29110 states. [2019-11-24 05:47:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29110 to 10645. [2019-11-24 05:47:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10645 states. [2019-11-24 05:47:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10645 states to 10645 states and 14581 transitions. [2019-11-24 05:47:39,637 INFO L78 Accepts]: Start accepts. Automaton has 10645 states and 14581 transitions. Word has length 51 [2019-11-24 05:47:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:39,637 INFO L462 AbstractCegarLoop]: Abstraction has 10645 states and 14581 transitions. [2019-11-24 05:47:39,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 05:47:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 10645 states and 14581 transitions. [2019-11-24 05:47:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:39,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:39,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:39,640 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:39,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1098735379, now seen corresponding path program 1 times [2019-11-24 05:47:39,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:39,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406356415] [2019-11-24 05:47:39,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:39,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406356415] [2019-11-24 05:47:39,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:39,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:47:39,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881782024] [2019-11-24 05:47:39,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 05:47:39,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:39,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 05:47:39,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:47:39,729 INFO L87 Difference]: Start difference. First operand 10645 states and 14581 transitions. Second operand 8 states. [2019-11-24 05:47:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:47:47,400 INFO L93 Difference]: Finished difference Result 23064 states and 31695 transitions. [2019-11-24 05:47:47,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:47:47,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-24 05:47:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:47:47,415 INFO L225 Difference]: With dead ends: 23064 [2019-11-24 05:47:47,415 INFO L226 Difference]: Without dead ends: 18747 [2019-11-24 05:47:47,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-24 05:47:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18747 states. [2019-11-24 05:47:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18747 to 10667. [2019-11-24 05:47:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10667 states. [2019-11-24 05:47:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 14612 transitions. [2019-11-24 05:47:51,355 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 14612 transitions. Word has length 51 [2019-11-24 05:47:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:47:51,356 INFO L462 AbstractCegarLoop]: Abstraction has 10667 states and 14612 transitions. [2019-11-24 05:47:51,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 05:47:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 14612 transitions. [2019-11-24 05:47:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:47:51,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:47:51,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:47:51,360 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:47:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:47:51,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1949776378, now seen corresponding path program 1 times [2019-11-24 05:47:51,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:47:51,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783686135] [2019-11-24 05:47:51,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:47:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:47:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:47:51,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783686135] [2019-11-24 05:47:51,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:47:51,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 05:47:51,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84624850] [2019-11-24 05:47:51,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:47:51,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:47:51,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:47:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:47:51,421 INFO L87 Difference]: Start difference. First operand 10667 states and 14612 transitions. Second operand 7 states. [2019-11-24 05:48:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:02,477 INFO L93 Difference]: Finished difference Result 31526 states and 43365 transitions. [2019-11-24 05:48:02,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 05:48:02,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-24 05:48:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:02,507 INFO L225 Difference]: With dead ends: 31526 [2019-11-24 05:48:02,508 INFO L226 Difference]: Without dead ends: 30845 [2019-11-24 05:48:02,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-24 05:48:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30845 states.