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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -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 01:23:13,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:13,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:13,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:13,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:13,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:13,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:13,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:13,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:13,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:13,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:13,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:13,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:13,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:13,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:13,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:13,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:13,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:13,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:13,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:13,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:13,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:13,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:13,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:13,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:13,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:13,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:13,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:13,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:13,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:13,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:13,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:13,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:13,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:13,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:13,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:13,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:13,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:13,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:13,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:13,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:13,552 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 01:23:13,567 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:13,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:13,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:13,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:13,569 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:13,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:13,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:13,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:13,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:13,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:13,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:13,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:13,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:13,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:13,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:13,571 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:13,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:13,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:13,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:13,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:13,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:13,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:13,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:13,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:13,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:13,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:13,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:13,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:13,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:23:13,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:13,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:13,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:13,867 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:13,867 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:13,868 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 01:23:13,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588b86e92/fd92f86271ff4eb2919e1e7d52e1beb6/FLAG03af1bc9a [2019-10-15 01:23:14,431 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:14,439 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 01:23:14,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588b86e92/fd92f86271ff4eb2919e1e7d52e1beb6/FLAG03af1bc9a [2019-10-15 01:23:14,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588b86e92/fd92f86271ff4eb2919e1e7d52e1beb6 [2019-10-15 01:23:14,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:14,748 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:14,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:14,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:14,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:14,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7664837c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14, skipping insertion in model container [2019-10-15 01:23:14,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,767 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:14,824 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:15,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:15,151 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:15,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:15,361 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:15,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15 WrapperNode [2019-10-15 01:23:15,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:15,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:15,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:15,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:15,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:15,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:15,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:15,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:15,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (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 01:23:15,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:15,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:15,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:23:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:15,497 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:16,352 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:16,352 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:16,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:16 BoogieIcfgContainer [2019-10-15 01:23:16,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:16,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:16,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:16,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:16,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:14" (1/3) ... [2019-10-15 01:23:16,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f954cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:16, skipping insertion in model container [2019-10-15 01:23:16,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (2/3) ... [2019-10-15 01:23:16,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f954cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:16, skipping insertion in model container [2019-10-15 01:23:16,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:16" (3/3) ... [2019-10-15 01:23:16,362 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-15 01:23:16,372 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:16,381 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:23:16,393 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:23:16,422 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:16,422 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:16,423 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:16,423 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:16,423 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:16,423 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:16,423 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:16,423 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-15 01:23:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:23:16,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:16,455 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 01:23:16,456 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:16,461 INFO L82 PathProgramCache]: Analyzing trace with hash -276696918, now seen corresponding path program 1 times [2019-10-15 01:23:16,470 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:16,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607935676] [2019-10-15 01:23:16,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:16,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:16,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:16,974 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 01:23:16,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607935676] [2019-10-15 01:23:16,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:16,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:16,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347142799] [2019-10-15 01:23:16,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:16,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:17,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:17,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:17,006 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 6 states. [2019-10-15 01:23:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:17,414 INFO L93 Difference]: Finished difference Result 721 states and 1142 transitions. [2019-10-15 01:23:17,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:23:17,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-15 01:23:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:17,439 INFO L225 Difference]: With dead ends: 721 [2019-10-15 01:23:17,440 INFO L226 Difference]: Without dead ends: 630 [2019-10-15 01:23:17,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:23:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-15 01:23:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 423. [2019-10-15 01:23:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-15 01:23:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 647 transitions. [2019-10-15 01:23:17,549 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 647 transitions. Word has length 52 [2019-10-15 01:23:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:17,550 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 647 transitions. [2019-10-15 01:23:17,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 647 transitions. [2019-10-15 01:23:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:17,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:17,555 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 01:23:17,555 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1087729035, now seen corresponding path program 1 times [2019-10-15 01:23:17,557 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:17,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484732842] [2019-10-15 01:23:17,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:17,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:17,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:17,720 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 01:23:17,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484732842] [2019-10-15 01:23:17,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:17,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:17,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299670428] [2019-10-15 01:23:17,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:17,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:17,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:17,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:17,726 INFO L87 Difference]: Start difference. First operand 423 states and 647 transitions. Second operand 3 states. [2019-10-15 01:23:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:17,810 INFO L93 Difference]: Finished difference Result 1104 states and 1713 transitions. [2019-10-15 01:23:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:17,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-15 01:23:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:17,816 INFO L225 Difference]: With dead ends: 1104 [2019-10-15 01:23:17,816 INFO L226 Difference]: Without dead ends: 748 [2019-10-15 01:23:17,820 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 01:23:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-15 01:23:17,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-10-15 01:23:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-15 01:23:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1138 transitions. [2019-10-15 01:23:17,885 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1138 transitions. Word has length 55 [2019-10-15 01:23:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:17,887 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1138 transitions. [2019-10-15 01:23:17,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1138 transitions. [2019-10-15 01:23:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:17,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:17,901 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 01:23:17,902 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:17,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash 917757431, now seen corresponding path program 1 times [2019-10-15 01:23:17,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:17,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373609548] [2019-10-15 01:23:17,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:17,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:17,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:18,030 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 01:23:18,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373609548] [2019-10-15 01:23:18,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:18,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:18,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551697724] [2019-10-15 01:23:18,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:18,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:18,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:18,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:18,038 INFO L87 Difference]: Start difference. First operand 746 states and 1138 transitions. Second operand 3 states. [2019-10-15 01:23:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:18,156 INFO L93 Difference]: Finished difference Result 2006 states and 3079 transitions. [2019-10-15 01:23:18,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:18,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-15 01:23:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:18,165 INFO L225 Difference]: With dead ends: 2006 [2019-10-15 01:23:18,166 INFO L226 Difference]: Without dead ends: 1335 [2019-10-15 01:23:18,169 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 01:23:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-10-15 01:23:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-10-15 01:23:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-10-15 01:23:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2001 transitions. [2019-10-15 01:23:18,260 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2001 transitions. Word has length 55 [2019-10-15 01:23:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:18,262 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 2001 transitions. [2019-10-15 01:23:18,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2001 transitions. [2019-10-15 01:23:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:18,264 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:18,264 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] [2019-10-15 01:23:18,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:18,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:18,265 INFO L82 PathProgramCache]: Analyzing trace with hash -41555275, now seen corresponding path program 1 times [2019-10-15 01:23:18,266 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:18,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438065843] [2019-10-15 01:23:18,266 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,266 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:18,481 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 01:23:18,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438065843] [2019-10-15 01:23:18,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:18,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:23:18,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496385373] [2019-10-15 01:23:18,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:23:18,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:18,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:23:18,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:23:18,485 INFO L87 Difference]: Start difference. First operand 1333 states and 2001 transitions. Second operand 10 states. [2019-10-15 01:23:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:20,758 INFO L93 Difference]: Finished difference Result 7842 states and 11792 transitions. [2019-10-15 01:23:20,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:23:20,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-15 01:23:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:20,796 INFO L225 Difference]: With dead ends: 7842 [2019-10-15 01:23:20,797 INFO L226 Difference]: Without dead ends: 7341 [2019-10-15 01:23:20,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:23:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7341 states. [2019-10-15 01:23:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7341 to 1358. [2019-10-15 01:23:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-10-15 01:23:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2033 transitions. [2019-10-15 01:23:20,986 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2033 transitions. Word has length 56 [2019-10-15 01:23:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:20,987 INFO L462 AbstractCegarLoop]: Abstraction has 1358 states and 2033 transitions. [2019-10-15 01:23:20,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:23:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2033 transitions. [2019-10-15 01:23:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:20,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:20,989 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] [2019-10-15 01:23:20,989 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash -742667424, now seen corresponding path program 1 times [2019-10-15 01:23:20,990 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:20,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433811739] [2019-10-15 01:23:20,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:20,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:20,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:21,135 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 01:23:21,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433811739] [2019-10-15 01:23:21,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:21,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:23:21,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821926698] [2019-10-15 01:23:21,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:23:21,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:21,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:23:21,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:21,138 INFO L87 Difference]: Start difference. First operand 1358 states and 2033 transitions. Second operand 7 states. [2019-10-15 01:23:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:22,380 INFO L93 Difference]: Finished difference Result 5747 states and 8758 transitions. [2019-10-15 01:23:22,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:23:22,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-10-15 01:23:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:22,410 INFO L225 Difference]: With dead ends: 5747 [2019-10-15 01:23:22,411 INFO L226 Difference]: Without dead ends: 5246 [2019-10-15 01:23:22,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:23:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2019-10-15 01:23:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 1339. [2019-10-15 01:23:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-10-15 01:23:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2009 transitions. [2019-10-15 01:23:22,618 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2009 transitions. Word has length 57 [2019-10-15 01:23:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:22,618 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2009 transitions. [2019-10-15 01:23:22,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:23:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2009 transitions. [2019-10-15 01:23:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:22,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:22,620 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] [2019-10-15 01:23:22,620 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:22,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:22,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1896016447, now seen corresponding path program 1 times [2019-10-15 01:23:22,621 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:22,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660621728] [2019-10-15 01:23:22,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:22,763 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 01:23:22,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660621728] [2019-10-15 01:23:22,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:22,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:22,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974691886] [2019-10-15 01:23:22,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:22,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:22,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:22,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:22,766 INFO L87 Difference]: Start difference. First operand 1339 states and 2009 transitions. Second operand 9 states. [2019-10-15 01:23:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:24,857 INFO L93 Difference]: Finished difference Result 8481 states and 12775 transitions. [2019-10-15 01:23:24,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:23:24,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-15 01:23:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:24,939 INFO L225 Difference]: With dead ends: 8481 [2019-10-15 01:23:24,940 INFO L226 Difference]: Without dead ends: 7351 [2019-10-15 01:23:24,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-10-15 01:23:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7351 states. [2019-10-15 01:23:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7351 to 1378. [2019-10-15 01:23:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-10-15 01:23:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2060 transitions. [2019-10-15 01:23:25,163 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2060 transitions. Word has length 57 [2019-10-15 01:23:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:25,165 INFO L462 AbstractCegarLoop]: Abstraction has 1378 states and 2060 transitions. [2019-10-15 01:23:25,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2060 transitions. [2019-10-15 01:23:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:25,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:25,167 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 01:23:25,167 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:25,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1439125625, now seen corresponding path program 1 times [2019-10-15 01:23:25,168 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:25,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143335047] [2019-10-15 01:23:25,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:25,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:25,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:25,300 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 01:23:25,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143335047] [2019-10-15 01:23:25,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:25,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:23:25,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006559741] [2019-10-15 01:23:25,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:23:25,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:25,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:23:25,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:25,302 INFO L87 Difference]: Start difference. First operand 1378 states and 2060 transitions. Second operand 7 states. [2019-10-15 01:23:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:26,248 INFO L93 Difference]: Finished difference Result 5650 states and 8490 transitions. [2019-10-15 01:23:26,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:23:26,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-15 01:23:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:26,272 INFO L225 Difference]: With dead ends: 5650 [2019-10-15 01:23:26,272 INFO L226 Difference]: Without dead ends: 4520 [2019-10-15 01:23:26,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:23:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2019-10-15 01:23:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 1359. [2019-10-15 01:23:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2019-10-15 01:23:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2033 transitions. [2019-10-15 01:23:26,470 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2033 transitions. Word has length 58 [2019-10-15 01:23:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:26,470 INFO L462 AbstractCegarLoop]: Abstraction has 1359 states and 2033 transitions. [2019-10-15 01:23:26,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:23:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2033 transitions. [2019-10-15 01:23:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:26,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:26,472 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 01:23:26,472 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1839206206, now seen corresponding path program 1 times [2019-10-15 01:23:26,473 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:26,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532089659] [2019-10-15 01:23:26,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:26,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:26,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:26,607 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 01:23:26,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532089659] [2019-10-15 01:23:26,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:26,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:26,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442419992] [2019-10-15 01:23:26,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:26,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:26,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:26,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:26,609 INFO L87 Difference]: Start difference. First operand 1359 states and 2033 transitions. Second operand 9 states. [2019-10-15 01:23:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:28,042 INFO L93 Difference]: Finished difference Result 7327 states and 11032 transitions. [2019-10-15 01:23:28,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:23:28,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-15 01:23:28,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:28,065 INFO L225 Difference]: With dead ends: 7327 [2019-10-15 01:23:28,065 INFO L226 Difference]: Without dead ends: 6095 [2019-10-15 01:23:28,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:23:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-10-15 01:23:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 3782. [2019-10-15 01:23:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-10-15 01:23:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5672 transitions. [2019-10-15 01:23:28,597 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5672 transitions. Word has length 58 [2019-10-15 01:23:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:28,597 INFO L462 AbstractCegarLoop]: Abstraction has 3782 states and 5672 transitions. [2019-10-15 01:23:28,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5672 transitions. [2019-10-15 01:23:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:28,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:28,600 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 01:23:28,600 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:28,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:28,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1369199573, now seen corresponding path program 1 times [2019-10-15 01:23:28,601 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:28,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177393310] [2019-10-15 01:23:28,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:28,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:28,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:28,723 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 01:23:28,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177393310] [2019-10-15 01:23:28,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:28,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:28,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745353017] [2019-10-15 01:23:28,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:28,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:28,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:28,726 INFO L87 Difference]: Start difference. First operand 3782 states and 5672 transitions. Second operand 9 states. [2019-10-15 01:23:31,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:31,272 INFO L93 Difference]: Finished difference Result 19307 states and 28995 transitions. [2019-10-15 01:23:31,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:23:31,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-15 01:23:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:31,311 INFO L225 Difference]: With dead ends: 19307 [2019-10-15 01:23:31,312 INFO L226 Difference]: Without dead ends: 15977 [2019-10-15 01:23:31,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:23:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15977 states. [2019-10-15 01:23:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15977 to 11695. [2019-10-15 01:23:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-10-15 01:23:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 17676 transitions. [2019-10-15 01:23:32,681 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 17676 transitions. Word has length 58 [2019-10-15 01:23:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:32,682 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 17676 transitions. [2019-10-15 01:23:32,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 17676 transitions. [2019-10-15 01:23:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:32,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:32,689 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] [2019-10-15 01:23:32,689 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1177047496, now seen corresponding path program 1 times [2019-10-15 01:23:32,690 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:32,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863411955] [2019-10-15 01:23:32,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:32,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:32,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:32,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 01:23:32,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863411955] [2019-10-15 01:23:32,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:32,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:32,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693601017] [2019-10-15 01:23:32,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:32,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:32,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:32,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:32,762 INFO L87 Difference]: Start difference. First operand 11695 states and 17676 transitions. Second operand 6 states. [2019-10-15 01:23:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:34,443 INFO L93 Difference]: Finished difference Result 26750 states and 40687 transitions. [2019-10-15 01:23:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:34,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-15 01:23:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:34,480 INFO L225 Difference]: With dead ends: 26750 [2019-10-15 01:23:34,480 INFO L226 Difference]: Without dead ends: 16014 [2019-10-15 01:23:34,504 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 01:23:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-10-15 01:23:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 9824. [2019-10-15 01:23:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9824 states. [2019-10-15 01:23:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9824 states to 9824 states and 14759 transitions. [2019-10-15 01:23:35,752 INFO L78 Accepts]: Start accepts. Automaton has 9824 states and 14759 transitions. Word has length 59 [2019-10-15 01:23:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:35,752 INFO L462 AbstractCegarLoop]: Abstraction has 9824 states and 14759 transitions. [2019-10-15 01:23:35,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 9824 states and 14759 transitions. [2019-10-15 01:23:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:35,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:35,755 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] [2019-10-15 01:23:35,755 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:35,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:35,755 INFO L82 PathProgramCache]: Analyzing trace with hash -90485979, now seen corresponding path program 1 times [2019-10-15 01:23:35,756 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:35,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414312425] [2019-10-15 01:23:35,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:35,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:35,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:35,820 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 01:23:35,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414312425] [2019-10-15 01:23:35,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:35,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:35,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892268530] [2019-10-15 01:23:35,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:35,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:35,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:35,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:35,822 INFO L87 Difference]: Start difference. First operand 9824 states and 14759 transitions. Second operand 6 states. [2019-10-15 01:23:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:37,524 INFO L93 Difference]: Finished difference Result 20559 states and 30871 transitions. [2019-10-15 01:23:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:37,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-15 01:23:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:37,543 INFO L225 Difference]: With dead ends: 20559 [2019-10-15 01:23:37,543 INFO L226 Difference]: Without dead ends: 11316 [2019-10-15 01:23:37,567 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 01:23:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11316 states. [2019-10-15 01:23:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11316 to 7633. [2019-10-15 01:23:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-10-15 01:23:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11363 transitions. [2019-10-15 01:23:38,591 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11363 transitions. Word has length 59 [2019-10-15 01:23:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:38,592 INFO L462 AbstractCegarLoop]: Abstraction has 7633 states and 11363 transitions. [2019-10-15 01:23:38,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11363 transitions. [2019-10-15 01:23:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:38,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:38,594 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] [2019-10-15 01:23:38,594 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash -226647092, now seen corresponding path program 1 times [2019-10-15 01:23:38,595 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:38,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068676703] [2019-10-15 01:23:38,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:38,647 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 01:23:38,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068676703] [2019-10-15 01:23:38,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:38,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:38,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962874943] [2019-10-15 01:23:38,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:38,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:38,649 INFO L87 Difference]: Start difference. First operand 7633 states and 11363 transitions. Second operand 5 states. [2019-10-15 01:23:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:40,117 INFO L93 Difference]: Finished difference Result 18447 states and 27375 transitions. [2019-10-15 01:23:40,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:40,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 01:23:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:40,129 INFO L225 Difference]: With dead ends: 18447 [2019-10-15 01:23:40,130 INFO L226 Difference]: Without dead ends: 10894 [2019-10-15 01:23:40,140 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 01:23:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10894 states. [2019-10-15 01:23:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10894 to 7633. [2019-10-15 01:23:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-10-15 01:23:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11259 transitions. [2019-10-15 01:23:42,113 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11259 transitions. Word has length 59 [2019-10-15 01:23:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:42,114 INFO L462 AbstractCegarLoop]: Abstraction has 7633 states and 11259 transitions. [2019-10-15 01:23:42,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11259 transitions. [2019-10-15 01:23:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:42,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:42,115 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] [2019-10-15 01:23:42,116 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash 758768658, now seen corresponding path program 1 times [2019-10-15 01:23:42,116 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:42,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799039068] [2019-10-15 01:23:42,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:42,181 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 01:23:42,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799039068] [2019-10-15 01:23:42,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:42,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:42,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414096308] [2019-10-15 01:23:42,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:42,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:42,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:42,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:42,184 INFO L87 Difference]: Start difference. First operand 7633 states and 11259 transitions. Second operand 5 states. [2019-10-15 01:23:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:44,101 INFO L93 Difference]: Finished difference Result 20122 states and 29836 transitions. [2019-10-15 01:23:44,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:44,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 01:23:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:44,123 INFO L225 Difference]: With dead ends: 20122 [2019-10-15 01:23:44,123 INFO L226 Difference]: Without dead ends: 16178 [2019-10-15 01:23:44,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:44,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16178 states. [2019-10-15 01:23:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16178 to 9877. [2019-10-15 01:23:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9877 states. [2019-10-15 01:23:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9877 states to 9877 states and 14629 transitions. [2019-10-15 01:23:45,465 INFO L78 Accepts]: Start accepts. Automaton has 9877 states and 14629 transitions. Word has length 60 [2019-10-15 01:23:45,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:45,465 INFO L462 AbstractCegarLoop]: Abstraction has 9877 states and 14629 transitions. [2019-10-15 01:23:45,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:45,465 INFO L276 IsEmpty]: Start isEmpty. Operand 9877 states and 14629 transitions. [2019-10-15 01:23:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:45,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:45,467 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] [2019-10-15 01:23:45,468 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2035448048, now seen corresponding path program 1 times [2019-10-15 01:23:45,468 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:45,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879390039] [2019-10-15 01:23:45,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:45,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:45,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:45,558 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 01:23:45,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879390039] [2019-10-15 01:23:45,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:45,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:45,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817943756] [2019-10-15 01:23:45,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:45,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:45,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:45,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:45,560 INFO L87 Difference]: Start difference. First operand 9877 states and 14629 transitions. Second operand 5 states. [2019-10-15 01:23:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:47,655 INFO L93 Difference]: Finished difference Result 21379 states and 31737 transitions. [2019-10-15 01:23:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:47,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 01:23:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:47,675 INFO L225 Difference]: With dead ends: 21379 [2019-10-15 01:23:47,675 INFO L226 Difference]: Without dead ends: 17435 [2019-10-15 01:23:47,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17435 states. [2019-10-15 01:23:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17435 to 11320. [2019-10-15 01:23:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11320 states. [2019-10-15 01:23:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11320 states to 11320 states and 16793 transitions. [2019-10-15 01:23:49,276 INFO L78 Accepts]: Start accepts. Automaton has 11320 states and 16793 transitions. Word has length 60 [2019-10-15 01:23:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:49,276 INFO L462 AbstractCegarLoop]: Abstraction has 11320 states and 16793 transitions. [2019-10-15 01:23:49,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 11320 states and 16793 transitions. [2019-10-15 01:23:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:23:49,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:49,280 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] [2019-10-15 01:23:49,280 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:49,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:49,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2033763663, now seen corresponding path program 1 times [2019-10-15 01:23:49,281 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:49,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904929634] [2019-10-15 01:23:49,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:49,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:49,354 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 01:23:49,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904929634] [2019-10-15 01:23:49,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:49,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:23:49,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713781517] [2019-10-15 01:23:49,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:23:49,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:49,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:23:49,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:49,357 INFO L87 Difference]: Start difference. First operand 11320 states and 16793 transitions. Second operand 7 states.