java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:28,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:28,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:28,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:28,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:28,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:28,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:28,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:28,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:28,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:28,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:28,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:28,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:28,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:28,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:28,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:28,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:28,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:28,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:28,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:28,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:28,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:28,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:28,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:28,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:28,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:28,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:28,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:28,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:28,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:28,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:28,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:28,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:28,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:28,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:28,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:28,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:28,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:28,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:28,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:28,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:28,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:26:28,306 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:28,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:28,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:28,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:28,308 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:28,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:28,308 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:28,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:28,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:28,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:28,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:28,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:28,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:28,310 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:28,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:28,310 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:28,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:28,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:28,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:28,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:28,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:28,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:28,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:28,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:28,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:28,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:28,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:28,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:28,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:26:28,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:28,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:28,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:28,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:28,592 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:28,593 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.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 03:26:28,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c290ea02/9489933022dd4f3aa5e6d816617b53dd/FLAGc6d8046d8 [2019-10-15 03:26:29,182 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:29,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 03:26:29,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c290ea02/9489933022dd4f3aa5e6d816617b53dd/FLAGc6d8046d8 [2019-10-15 03:26:29,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c290ea02/9489933022dd4f3aa5e6d816617b53dd [2019-10-15 03:26:29,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:29,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:29,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:29,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:29,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:29,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:29" (1/1) ... [2019-10-15 03:26:29,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b26da54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:29, skipping insertion in model container [2019-10-15 03:26:29,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:29" (1/1) ... [2019-10-15 03:26:29,561 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:29,622 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:29,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:29,954 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:30,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:30,169 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:30,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:30 WrapperNode [2019-10-15 03:26:30,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:30,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:30,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:30,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:30,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:30" (1/1) ... [2019-10-15 03:26:30,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:30" (1/1) ... [2019-10-15 03:26:30,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:30" (1/1) ... [2019-10-15 03:26:30,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:30" (1/1) ... [2019-10-15 03:26:30,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:30" (1/1) ... [2019-10-15 03:26:30,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:30" (1/1) ... [2019-10-15 03:26:30,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:30" (1/1) ... [2019-10-15 03:26:30,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:30,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:30,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:30,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:30,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:30" (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-10-15 03:26:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:30,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:30,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 03:26:30,294 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:31,625 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:31,625 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:31,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:31 BoogieIcfgContainer [2019-10-15 03:26:31,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:31,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:31,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:31,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:31,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:29" (1/3) ... [2019-10-15 03:26:31,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a03aaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:31, skipping insertion in model container [2019-10-15 03:26:31,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:30" (2/3) ... [2019-10-15 03:26:31,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a03aaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:31, skipping insertion in model container [2019-10-15 03:26:31,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:31" (3/3) ... [2019-10-15 03:26:31,652 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 03:26:31,669 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:31,680 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:26:31,696 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:26:31,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:31,739 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:31,739 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:31,740 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:31,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:31,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:31,741 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:31,741 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-10-15 03:26:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 03:26:31,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:31,790 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:31,793 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash -787153264, now seen corresponding path program 1 times [2019-10-15 03:26:31,809 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:31,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903189149] [2019-10-15 03:26:31,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:31,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:31,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:32,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903189149] [2019-10-15 03:26:32,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:32,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:32,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020990146] [2019-10-15 03:26:32,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:32,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:32,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:32,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:32,420 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 5 states. [2019-10-15 03:26:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:32,722 INFO L93 Difference]: Finished difference Result 292 states and 460 transitions. [2019-10-15 03:26:32,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:32,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-15 03:26:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:32,738 INFO L225 Difference]: With dead ends: 292 [2019-10-15 03:26:32,738 INFO L226 Difference]: Without dead ends: 212 [2019-10-15 03:26:32,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-15 03:26:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2019-10-15 03:26:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-15 03:26:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 276 transitions. [2019-10-15 03:26:32,841 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 276 transitions. Word has length 45 [2019-10-15 03:26:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:32,842 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 276 transitions. [2019-10-15 03:26:32,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 276 transitions. [2019-10-15 03:26:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 03:26:32,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:32,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:32,847 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:32,848 INFO L82 PathProgramCache]: Analyzing trace with hash 422949447, now seen corresponding path program 1 times [2019-10-15 03:26:32,848 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:32,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983390580] [2019-10-15 03:26:32,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:33,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983390580] [2019-10-15 03:26:33,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:33,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:33,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850044624] [2019-10-15 03:26:33,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:33,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:33,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:33,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:33,017 INFO L87 Difference]: Start difference. First operand 208 states and 276 transitions. Second operand 6 states. [2019-10-15 03:26:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:33,230 INFO L93 Difference]: Finished difference Result 347 states and 464 transitions. [2019-10-15 03:26:33,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:33,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-15 03:26:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:33,233 INFO L225 Difference]: With dead ends: 347 [2019-10-15 03:26:33,233 INFO L226 Difference]: Without dead ends: 208 [2019-10-15 03:26:33,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-15 03:26:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-10-15 03:26:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-15 03:26:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2019-10-15 03:26:33,260 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 266 transitions. Word has length 46 [2019-10-15 03:26:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:33,261 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 266 transitions. [2019-10-15 03:26:33,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 266 transitions. [2019-10-15 03:26:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 03:26:33,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:33,266 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:33,266 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:33,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:33,266 INFO L82 PathProgramCache]: Analyzing trace with hash -752893704, now seen corresponding path program 1 times [2019-10-15 03:26:33,267 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:33,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212646151] [2019-10-15 03:26:33,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:33,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:33,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:33,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212646151] [2019-10-15 03:26:33,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:33,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:33,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193367295] [2019-10-15 03:26:33,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:33,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:33,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:33,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:33,396 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. Second operand 6 states. [2019-10-15 03:26:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:33,526 INFO L93 Difference]: Finished difference Result 372 states and 478 transitions. [2019-10-15 03:26:33,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:33,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-15 03:26:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:33,529 INFO L225 Difference]: With dead ends: 372 [2019-10-15 03:26:33,529 INFO L226 Difference]: Without dead ends: 208 [2019-10-15 03:26:33,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-15 03:26:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-10-15 03:26:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-15 03:26:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 258 transitions. [2019-10-15 03:26:33,550 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 258 transitions. Word has length 46 [2019-10-15 03:26:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:33,550 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 258 transitions. [2019-10-15 03:26:33,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2019-10-15 03:26:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:26:33,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:33,553 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:33,553 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:33,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:33,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751131, now seen corresponding path program 1 times [2019-10-15 03:26:33,554 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:33,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885674342] [2019-10-15 03:26:33,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:33,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:33,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:33,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885674342] [2019-10-15 03:26:33,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:33,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:33,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771946093] [2019-10-15 03:26:33,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:33,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:33,783 INFO L87 Difference]: Start difference. First operand 208 states and 258 transitions. Second operand 10 states. [2019-10-15 03:26:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:34,666 INFO L93 Difference]: Finished difference Result 405 states and 502 transitions. [2019-10-15 03:26:34,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:26:34,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-10-15 03:26:34,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:34,672 INFO L225 Difference]: With dead ends: 405 [2019-10-15 03:26:34,672 INFO L226 Difference]: Without dead ends: 380 [2019-10-15 03:26:34,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:26:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-15 03:26:34,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 288. [2019-10-15 03:26:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-10-15 03:26:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 356 transitions. [2019-10-15 03:26:34,717 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 356 transitions. Word has length 47 [2019-10-15 03:26:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:34,718 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 356 transitions. [2019-10-15 03:26:34,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 356 transitions. [2019-10-15 03:26:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:26:34,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:34,727 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:34,728 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:34,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1608472133, now seen corresponding path program 1 times [2019-10-15 03:26:34,728 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:34,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949276763] [2019-10-15 03:26:34,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:34,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:34,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:35,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949276763] [2019-10-15 03:26:35,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:35,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:35,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919334366] [2019-10-15 03:26:35,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:35,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:35,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:35,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:35,043 INFO L87 Difference]: Start difference. First operand 288 states and 356 transitions. Second operand 10 states. [2019-10-15 03:26:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:35,641 INFO L93 Difference]: Finished difference Result 498 states and 625 transitions. [2019-10-15 03:26:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 03:26:35,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-10-15 03:26:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:35,644 INFO L225 Difference]: With dead ends: 498 [2019-10-15 03:26:35,644 INFO L226 Difference]: Without dead ends: 444 [2019-10-15 03:26:35,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:26:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-10-15 03:26:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 350. [2019-10-15 03:26:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-15 03:26:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 434 transitions. [2019-10-15 03:26:35,681 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 434 transitions. Word has length 47 [2019-10-15 03:26:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:35,681 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 434 transitions. [2019-10-15 03:26:35,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 434 transitions. [2019-10-15 03:26:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:26:35,683 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:35,683 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:35,683 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:35,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1711689862, now seen corresponding path program 1 times [2019-10-15 03:26:35,684 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:35,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984069542] [2019-10-15 03:26:35,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:35,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:35,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:35,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984069542] [2019-10-15 03:26:35,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:35,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:35,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935001479] [2019-10-15 03:26:35,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:35,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:35,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:35,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:35,744 INFO L87 Difference]: Start difference. First operand 350 states and 434 transitions. Second operand 5 states. [2019-10-15 03:26:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:35,881 INFO L93 Difference]: Finished difference Result 478 states and 602 transitions. [2019-10-15 03:26:35,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:35,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-15 03:26:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:35,884 INFO L225 Difference]: With dead ends: 478 [2019-10-15 03:26:35,884 INFO L226 Difference]: Without dead ends: 350 [2019-10-15 03:26:35,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-10-15 03:26:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-10-15 03:26:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-15 03:26:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 433 transitions. [2019-10-15 03:26:35,920 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 433 transitions. Word has length 47 [2019-10-15 03:26:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:35,921 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 433 transitions. [2019-10-15 03:26:35,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 433 transitions. [2019-10-15 03:26:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:26:35,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:35,922 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:35,922 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:35,923 INFO L82 PathProgramCache]: Analyzing trace with hash 829937832, now seen corresponding path program 1 times [2019-10-15 03:26:35,923 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:35,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126276321] [2019-10-15 03:26:35,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:35,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:35,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:36,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126276321] [2019-10-15 03:26:36,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:36,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:26:36,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935586313] [2019-10-15 03:26:36,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:26:36,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:36,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:26:36,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:26:36,147 INFO L87 Difference]: Start difference. First operand 350 states and 433 transitions. Second operand 10 states. [2019-10-15 03:26:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:36,920 INFO L93 Difference]: Finished difference Result 903 states and 1180 transitions. [2019-10-15 03:26:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:26:36,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-10-15 03:26:36,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:36,925 INFO L225 Difference]: With dead ends: 903 [2019-10-15 03:26:36,925 INFO L226 Difference]: Without dead ends: 815 [2019-10-15 03:26:36,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:26:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-10-15 03:26:36,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 596. [2019-10-15 03:26:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-15 03:26:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 760 transitions. [2019-10-15 03:26:37,002 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 760 transitions. Word has length 48 [2019-10-15 03:26:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:37,003 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 760 transitions. [2019-10-15 03:26:37,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:26:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 760 transitions. [2019-10-15 03:26:37,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 03:26:37,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:37,004 INFO L380 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-10-15 03:26:37,005 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:37,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:37,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1176215270, now seen corresponding path program 1 times [2019-10-15 03:26:37,005 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:37,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039210148] [2019-10-15 03:26:37,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:37,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:37,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:37,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039210148] [2019-10-15 03:26:37,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:37,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:26:37,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152204715] [2019-10-15 03:26:37,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:26:37,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:37,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:26:37,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:26:37,226 INFO L87 Difference]: Start difference. First operand 596 states and 760 transitions. Second operand 12 states. [2019-10-15 03:26:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:37,801 INFO L93 Difference]: Finished difference Result 1305 states and 1689 transitions. [2019-10-15 03:26:37,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:26:37,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-10-15 03:26:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:37,809 INFO L225 Difference]: With dead ends: 1305 [2019-10-15 03:26:37,809 INFO L226 Difference]: Without dead ends: 1253 [2019-10-15 03:26:37,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=302, Unknown=0, NotChecked=0, Total=462 [2019-10-15 03:26:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2019-10-15 03:26:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 605. [2019-10-15 03:26:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-15 03:26:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 768 transitions. [2019-10-15 03:26:37,913 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 768 transitions. Word has length 49 [2019-10-15 03:26:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:37,913 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 768 transitions. [2019-10-15 03:26:37,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:26:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 768 transitions. [2019-10-15 03:26:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:26:37,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:37,915 INFO L380 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-10-15 03:26:37,915 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:37,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:37,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1324463465, now seen corresponding path program 1 times [2019-10-15 03:26:37,916 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:37,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793775081] [2019-10-15 03:26:37,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:37,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:37,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:37,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793775081] [2019-10-15 03:26:37,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:37,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:37,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895706658] [2019-10-15 03:26:37,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:37,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:37,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:37,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:37,957 INFO L87 Difference]: Start difference. First operand 605 states and 768 transitions. Second operand 3 states. [2019-10-15 03:26:38,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:38,070 INFO L93 Difference]: Finished difference Result 1285 states and 1682 transitions. [2019-10-15 03:26:38,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:38,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-15 03:26:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:38,075 INFO L225 Difference]: With dead ends: 1285 [2019-10-15 03:26:38,075 INFO L226 Difference]: Without dead ends: 888 [2019-10-15 03:26:38,077 INFO L600 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-10-15 03:26:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-10-15 03:26:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 797. [2019-10-15 03:26:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-15 03:26:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1031 transitions. [2019-10-15 03:26:38,153 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1031 transitions. Word has length 50 [2019-10-15 03:26:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:38,153 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1031 transitions. [2019-10-15 03:26:38,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1031 transitions. [2019-10-15 03:26:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:26:38,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:38,155 INFO L380 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-10-15 03:26:38,155 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:38,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:38,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2023369027, now seen corresponding path program 1 times [2019-10-15 03:26:38,156 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:38,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587435314] [2019-10-15 03:26:38,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:38,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:38,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:38,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587435314] [2019-10-15 03:26:38,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:38,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:26:38,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97898420] [2019-10-15 03:26:38,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:26:38,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:38,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:26:38,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:26:38,392 INFO L87 Difference]: Start difference. First operand 797 states and 1031 transitions. Second operand 12 states. [2019-10-15 03:26:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:39,400 INFO L93 Difference]: Finished difference Result 1504 states and 1974 transitions. [2019-10-15 03:26:39,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-15 03:26:39,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-10-15 03:26:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:39,408 INFO L225 Difference]: With dead ends: 1504 [2019-10-15 03:26:39,408 INFO L226 Difference]: Without dead ends: 1361 [2019-10-15 03:26:39,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-10-15 03:26:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-10-15 03:26:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 809. [2019-10-15 03:26:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-10-15 03:26:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1043 transitions. [2019-10-15 03:26:39,508 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1043 transitions. Word has length 50 [2019-10-15 03:26:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:39,508 INFO L462 AbstractCegarLoop]: Abstraction has 809 states and 1043 transitions. [2019-10-15 03:26:39,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:26:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1043 transitions. [2019-10-15 03:26:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:26:39,509 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:39,509 INFO L380 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-10-15 03:26:39,510 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash 854854237, now seen corresponding path program 1 times [2019-10-15 03:26:39,510 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:39,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512811653] [2019-10-15 03:26:39,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:39,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:39,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:39,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512811653] [2019-10-15 03:26:39,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:39,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:26:39,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270434437] [2019-10-15 03:26:39,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:26:39,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:39,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:26:39,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:26:39,763 INFO L87 Difference]: Start difference. First operand 809 states and 1043 transitions. Second operand 12 states. [2019-10-15 03:26:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:40,635 INFO L93 Difference]: Finished difference Result 2400 states and 3190 transitions. [2019-10-15 03:26:40,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:26:40,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-10-15 03:26:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:40,646 INFO L225 Difference]: With dead ends: 2400 [2019-10-15 03:26:40,646 INFO L226 Difference]: Without dead ends: 1894 [2019-10-15 03:26:40,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:26:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-10-15 03:26:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1333. [2019-10-15 03:26:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-10-15 03:26:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1749 transitions. [2019-10-15 03:26:40,809 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1749 transitions. Word has length 50 [2019-10-15 03:26:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:40,810 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 1749 transitions. [2019-10-15 03:26:40,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:26:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1749 transitions. [2019-10-15 03:26:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:26:40,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:40,811 INFO L380 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-10-15 03:26:40,811 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash -533267837, now seen corresponding path program 1 times [2019-10-15 03:26:40,812 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:40,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537923426] [2019-10-15 03:26:40,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:40,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:40,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:40,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537923426] [2019-10-15 03:26:40,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:40,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:40,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489411369] [2019-10-15 03:26:40,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:40,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:40,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:40,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:40,852 INFO L87 Difference]: Start difference. First operand 1333 states and 1749 transitions. Second operand 3 states. [2019-10-15 03:26:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:41,098 INFO L93 Difference]: Finished difference Result 3106 states and 4159 transitions. [2019-10-15 03:26:41,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:41,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-15 03:26:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:41,109 INFO L225 Difference]: With dead ends: 3106 [2019-10-15 03:26:41,109 INFO L226 Difference]: Without dead ends: 2011 [2019-10-15 03:26:41,112 INFO L600 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-10-15 03:26:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-10-15 03:26:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 2007. [2019-10-15 03:26:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-10-15 03:26:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2669 transitions. [2019-10-15 03:26:41,389 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2669 transitions. Word has length 51 [2019-10-15 03:26:41,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:41,389 INFO L462 AbstractCegarLoop]: Abstraction has 2007 states and 2669 transitions. [2019-10-15 03:26:41,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2669 transitions. [2019-10-15 03:26:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 03:26:41,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:41,391 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:41,391 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:41,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:41,392 INFO L82 PathProgramCache]: Analyzing trace with hash 446459698, now seen corresponding path program 1 times [2019-10-15 03:26:41,392 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:41,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571546348] [2019-10-15 03:26:41,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:41,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:41,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:42,750 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-15 03:26:42,885 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-15 03:26:43,042 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-15 03:26:43,218 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-10-15 03:26:43,419 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-15 03:26:43,578 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-10-15 03:26:43,771 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-10-15 03:26:44,032 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-10-15 03:26:44,181 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-15 03:26:44,339 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-15 03:26:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:44,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571546348] [2019-10-15 03:26:44,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:44,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-15 03:26:44,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846424482] [2019-10-15 03:26:44,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 03:26:44,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:44,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 03:26:44,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2019-10-15 03:26:44,639 INFO L87 Difference]: Start difference. First operand 2007 states and 2669 transitions. Second operand 26 states. [2019-10-15 03:26:44,834 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-15 03:26:45,217 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-15 03:26:45,398 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-15 03:26:45,571 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-15 03:26:45,769 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-15 03:26:46,050 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-15 03:26:46,374 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-15 03:26:46,661 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-15 03:26:47,047 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-10-15 03:26:47,501 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2019-10-15 03:26:47,969 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-10-15 03:26:48,455 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 104 [2019-10-15 03:26:49,096 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 109 [2019-10-15 03:26:49,751 WARN L191 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 127 [2019-10-15 03:26:50,409 WARN L191 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 135 [2019-10-15 03:26:50,837 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2019-10-15 03:26:51,564 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-15 03:26:53,299 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-15 03:26:53,964 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-15 03:26:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:55,047 INFO L93 Difference]: Finished difference Result 5645 states and 7571 transitions. [2019-10-15 03:26:55,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-15 03:26:55,047 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2019-10-15 03:26:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:55,071 INFO L225 Difference]: With dead ends: 5645 [2019-10-15 03:26:55,071 INFO L226 Difference]: Without dead ends: 5373 [2019-10-15 03:26:55,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=599, Invalid=1753, Unknown=0, NotChecked=0, Total=2352 [2019-10-15 03:26:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5373 states. [2019-10-15 03:26:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5373 to 1995. [2019-10-15 03:26:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-10-15 03:26:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2656 transitions. [2019-10-15 03:26:55,401 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2656 transitions. Word has length 52 [2019-10-15 03:26:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:55,401 INFO L462 AbstractCegarLoop]: Abstraction has 1995 states and 2656 transitions. [2019-10-15 03:26:55,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 03:26:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2656 transitions. [2019-10-15 03:26:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:55,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:55,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:55,403 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:55,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1542380715, now seen corresponding path program 1 times [2019-10-15 03:26:55,404 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:55,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53083721] [2019-10-15 03:26:55,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:55,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:55,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:55,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53083721] [2019-10-15 03:26:55,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:55,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:55,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563782512] [2019-10-15 03:26:55,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:55,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:55,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:55,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:55,461 INFO L87 Difference]: Start difference. First operand 1995 states and 2656 transitions. Second operand 3 states. [2019-10-15 03:26:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:55,748 INFO L93 Difference]: Finished difference Result 3998 states and 5329 transitions. [2019-10-15 03:26:55,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:55,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-15 03:26:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:55,758 INFO L225 Difference]: With dead ends: 3998 [2019-10-15 03:26:55,758 INFO L226 Difference]: Without dead ends: 2518 [2019-10-15 03:26:55,762 INFO L600 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-10-15 03:26:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2019-10-15 03:26:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2296. [2019-10-15 03:26:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2296 states. [2019-10-15 03:26:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3031 transitions. [2019-10-15 03:26:56,104 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3031 transitions. Word has length 55 [2019-10-15 03:26:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:56,104 INFO L462 AbstractCegarLoop]: Abstraction has 2296 states and 3031 transitions. [2019-10-15 03:26:56,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3031 transitions. [2019-10-15 03:26:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:56,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:56,106 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:56,106 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:56,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1558584849, now seen corresponding path program 1 times [2019-10-15 03:26:56,107 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:56,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708527155] [2019-10-15 03:26:56,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:56,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:56,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:56,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708527155] [2019-10-15 03:26:56,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:56,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:56,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308464463] [2019-10-15 03:26:56,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:56,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:56,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:56,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:56,166 INFO L87 Difference]: Start difference. First operand 2296 states and 3031 transitions. Second operand 3 states. [2019-10-15 03:26:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:56,492 INFO L93 Difference]: Finished difference Result 3968 states and 5247 transitions. [2019-10-15 03:26:56,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:56,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:26:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:56,501 INFO L225 Difference]: With dead ends: 3968 [2019-10-15 03:26:56,501 INFO L226 Difference]: Without dead ends: 2735 [2019-10-15 03:26:56,504 INFO L600 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-10-15 03:26:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2019-10-15 03:26:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2553. [2019-10-15 03:26:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-10-15 03:26:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3356 transitions. [2019-10-15 03:26:56,842 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3356 transitions. Word has length 58 [2019-10-15 03:26:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:56,842 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 3356 transitions. [2019-10-15 03:26:56,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3356 transitions. [2019-10-15 03:26:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:26:56,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:56,843 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:56,843 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash -895213973, now seen corresponding path program 1 times [2019-10-15 03:26:56,844 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:56,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131232315] [2019-10-15 03:26:56,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:56,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:56,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:56,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131232315] [2019-10-15 03:26:56,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:56,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:56,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226538914] [2019-10-15 03:26:56,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:56,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:56,908 INFO L87 Difference]: Start difference. First operand 2553 states and 3356 transitions. Second operand 3 states. [2019-10-15 03:26:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:57,370 INFO L93 Difference]: Finished difference Result 5056 states and 6654 transitions. [2019-10-15 03:26:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:57,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-15 03:26:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:57,381 INFO L225 Difference]: With dead ends: 5056 [2019-10-15 03:26:57,381 INFO L226 Difference]: Without dead ends: 3570 [2019-10-15 03:26:57,384 INFO L600 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-10-15 03:26:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2019-10-15 03:26:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3346. [2019-10-15 03:26:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3346 states. [2019-10-15 03:26:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 4348 transitions. [2019-10-15 03:26:57,803 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 4348 transitions. Word has length 62 [2019-10-15 03:26:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:57,803 INFO L462 AbstractCegarLoop]: Abstraction has 3346 states and 4348 transitions. [2019-10-15 03:26:57,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4348 transitions. [2019-10-15 03:26:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 03:26:57,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:57,805 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:57,805 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2069297178, now seen corresponding path program 1 times [2019-10-15 03:26:57,806 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:57,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31357291] [2019-10-15 03:26:57,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:57,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:57,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:57,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31357291] [2019-10-15 03:26:57,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:57,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:26:57,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407841435] [2019-10-15 03:26:57,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:26:57,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:57,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:26:57,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:57,913 INFO L87 Difference]: Start difference. First operand 3346 states and 4348 transitions. Second operand 7 states. [2019-10-15 03:26:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:58,673 INFO L93 Difference]: Finished difference Result 4712 states and 6067 transitions. [2019-10-15 03:26:58,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:26:58,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-10-15 03:26:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:58,691 INFO L225 Difference]: With dead ends: 4712 [2019-10-15 03:26:58,691 INFO L226 Difference]: Without dead ends: 4710 [2019-10-15 03:26:58,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:26:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2019-10-15 03:26:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 3961. [2019-10-15 03:26:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3961 states. [2019-10-15 03:26:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 5110 transitions. [2019-10-15 03:26:59,214 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 5110 transitions. Word has length 65 [2019-10-15 03:26:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:59,215 INFO L462 AbstractCegarLoop]: Abstraction has 3961 states and 5110 transitions. [2019-10-15 03:26:59,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:26:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 5110 transitions. [2019-10-15 03:26:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:26:59,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:59,217 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:59,218 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1412306678, now seen corresponding path program 1 times [2019-10-15 03:26:59,218 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:59,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138497236] [2019-10-15 03:26:59,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:59,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:59,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:59,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138497236] [2019-10-15 03:26:59,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447867091] [2019-10-15 03:26:59,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:26:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:59,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-15 03:26:59,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:27:00,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:00,688 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:27:00,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:27:00,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,211 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-10-15 03:27:01,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 03:27:01,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:27:01,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:27:01,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:27:01,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:01,901 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-10-15 03:27:02,062 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-10-15 03:27:02,284 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-10-15 03:27:02,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 03:27:02,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:27:02,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:02,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1548259556] [2019-10-15 03:27:02,638 INFO L162 IcfgInterpreter]: Started Sifa with 67 locations of interest [2019-10-15 03:27:02,638 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:27:02,643 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:27:02,652 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:27:02,653 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:27:03,526 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 172 for LOIs [2019-10-15 03:27:03,830 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2019-10-15 03:27:04,554 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 252