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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:53,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:53,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:53,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:53,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:53,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:53,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:53,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:53,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:53,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:53,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:53,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:53,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:53,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:53,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:53,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:53,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:53,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:53,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:53,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:53,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:53,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:53,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:53,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:53,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:53,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:53,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:53,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:53,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:53,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:53,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:53,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:53,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:53,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:53,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:53,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:53,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:53,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:53,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:53,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:53,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:53,513 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-13 23:21:53,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:53,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:53,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:53,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:53,547 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:53,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:53,547 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:53,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:53,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:53,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:53,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:53,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:53,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:53,550 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:53,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:53,550 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:53,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:53,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:53,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:53,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:53,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:53,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:53,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:53,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:53,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:53,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:53,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:53,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:53,553 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-13 23:21:53,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:53,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:53,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:53,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:53,860 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:53,861 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 23:21:53,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d9b08b6/61e16bd73097438fa67019966d8d8d8b/FLAG6d1bc5fa3 [2019-10-13 23:21:54,607 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:54,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 23:21:54,631 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d9b08b6/61e16bd73097438fa67019966d8d8d8b/FLAG6d1bc5fa3 [2019-10-13 23:21:54,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d9b08b6/61e16bd73097438fa67019966d8d8d8b [2019-10-13 23:21:54,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:54,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:54,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:54,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:54,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:54,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:54" (1/1) ... [2019-10-13 23:21:54,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3560722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:54, skipping insertion in model container [2019-10-13 23:21:54,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:54" (1/1) ... [2019-10-13 23:21:54,821 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:54,975 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:55,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:55,962 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:56,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:56,303 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:56,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56 WrapperNode [2019-10-13 23:21:56,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:56,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:56,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:56,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:56,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:56,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:56,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:56,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:56,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (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-13 23:21:56,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:56,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:56,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:21:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:21:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 23:21:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:21:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:21:56,692 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:21:56,692 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:21:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:21:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:21:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:21:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:21:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:21:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:00,674 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:00,674 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:22:00,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:00 BoogieIcfgContainer [2019-10-13 23:22:00,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:00,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:00,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:00,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:00,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:54" (1/3) ... [2019-10-13 23:22:00,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571533b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:00, skipping insertion in model container [2019-10-13 23:22:00,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (2/3) ... [2019-10-13 23:22:00,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571533b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:00, skipping insertion in model container [2019-10-13 23:22:00,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:00" (3/3) ... [2019-10-13 23:22:00,695 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 23:22:00,710 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:00,723 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 23:22:00,738 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 23:22:00,778 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:00,779 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:00,779 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:00,779 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:00,779 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:00,779 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:00,779 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:00,780 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states. [2019-10-13 23:22:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:00,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:00,855 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] [2019-10-13 23:22:00,857 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:00,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1364126483, now seen corresponding path program 1 times [2019-10-13 23:22:00,874 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:00,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761705433] [2019-10-13 23:22:00,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:00,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:00,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:01,407 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-13 23:22:01,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761705433] [2019-10-13 23:22:01,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:01,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:01,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121786836] [2019-10-13 23:22:01,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:01,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:01,432 INFO L87 Difference]: Start difference. First operand 1182 states. Second operand 5 states. [2019-10-13 23:22:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:03,553 INFO L93 Difference]: Finished difference Result 2270 states and 3974 transitions. [2019-10-13 23:22:03,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:03,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-13 23:22:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:03,587 INFO L225 Difference]: With dead ends: 2270 [2019-10-13 23:22:03,587 INFO L226 Difference]: Without dead ends: 1418 [2019-10-13 23:22:03,596 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-13 23:22:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-10-13 23:22:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1412. [2019-10-13 23:22:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-10-13 23:22:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1854 transitions. [2019-10-13 23:22:03,750 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1854 transitions. Word has length 54 [2019-10-13 23:22:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:03,751 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 1854 transitions. [2019-10-13 23:22:03,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1854 transitions. [2019-10-13 23:22:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:03,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:03,756 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-13 23:22:03,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:03,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash -672874759, now seen corresponding path program 1 times [2019-10-13 23:22:03,757 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:03,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124624793] [2019-10-13 23:22:03,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:03,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:03,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:04,024 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-13 23:22:04,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124624793] [2019-10-13 23:22:04,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:04,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:04,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581646991] [2019-10-13 23:22:04,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:04,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:04,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:04,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:04,028 INFO L87 Difference]: Start difference. First operand 1412 states and 1854 transitions. Second operand 6 states. [2019-10-13 23:22:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:05,450 INFO L93 Difference]: Finished difference Result 2943 states and 3905 transitions. [2019-10-13 23:22:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:05,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 23:22:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:05,466 INFO L225 Difference]: With dead ends: 2943 [2019-10-13 23:22:05,466 INFO L226 Difference]: Without dead ends: 1976 [2019-10-13 23:22:05,471 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-13 23:22:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2019-10-13 23:22:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1960. [2019-10-13 23:22:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-10-13 23:22:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2580 transitions. [2019-10-13 23:22:05,711 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2580 transitions. Word has length 55 [2019-10-13 23:22:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:05,712 INFO L462 AbstractCegarLoop]: Abstraction has 1960 states and 2580 transitions. [2019-10-13 23:22:05,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2580 transitions. [2019-10-13 23:22:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:05,716 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:05,716 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-13 23:22:05,717 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:05,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1781940792, now seen corresponding path program 1 times [2019-10-13 23:22:05,717 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:05,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987441591] [2019-10-13 23:22:05,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:05,970 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-13 23:22:05,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987441591] [2019-10-13 23:22:05,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:05,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:05,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497429899] [2019-10-13 23:22:05,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:05,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:05,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:05,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:05,974 INFO L87 Difference]: Start difference. First operand 1960 states and 2580 transitions. Second operand 6 states. [2019-10-13 23:22:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:07,271 INFO L93 Difference]: Finished difference Result 4894 states and 6440 transitions. [2019-10-13 23:22:07,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:07,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 23:22:07,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:07,291 INFO L225 Difference]: With dead ends: 4894 [2019-10-13 23:22:07,291 INFO L226 Difference]: Without dead ends: 3588 [2019-10-13 23:22:07,296 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-13 23:22:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2019-10-13 23:22:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3568. [2019-10-13 23:22:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-10-13 23:22:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4693 transitions. [2019-10-13 23:22:07,540 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4693 transitions. Word has length 55 [2019-10-13 23:22:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:07,540 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4693 transitions. [2019-10-13 23:22:07,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4693 transitions. [2019-10-13 23:22:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:07,545 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:07,545 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-13 23:22:07,545 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1568068960, now seen corresponding path program 1 times [2019-10-13 23:22:07,546 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:07,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059311791] [2019-10-13 23:22:07,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:07,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:07,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:07,746 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-13 23:22:07,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059311791] [2019-10-13 23:22:07,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:07,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:07,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615158866] [2019-10-13 23:22:07,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:07,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:07,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:07,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:07,749 INFO L87 Difference]: Start difference. First operand 3568 states and 4693 transitions. Second operand 9 states. [2019-10-13 23:22:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:10,895 INFO L93 Difference]: Finished difference Result 5331 states and 7146 transitions. [2019-10-13 23:22:10,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 23:22:10,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-13 23:22:10,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:10,926 INFO L225 Difference]: With dead ends: 5331 [2019-10-13 23:22:10,926 INFO L226 Difference]: Without dead ends: 5326 [2019-10-13 23:22:10,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-10-13 23:22:10,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5326 states. [2019-10-13 23:22:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5326 to 3568. [2019-10-13 23:22:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-10-13 23:22:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4692 transitions. [2019-10-13 23:22:11,195 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4692 transitions. Word has length 56 [2019-10-13 23:22:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:11,196 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4692 transitions. [2019-10-13 23:22:11,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4692 transitions. [2019-10-13 23:22:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:11,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:11,200 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-13 23:22:11,201 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash -634470005, now seen corresponding path program 1 times [2019-10-13 23:22:11,202 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:11,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718746541] [2019-10-13 23:22:11,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:11,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:11,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:11,349 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-13 23:22:11,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718746541] [2019-10-13 23:22:11,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:11,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:11,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951279405] [2019-10-13 23:22:11,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:11,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:11,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:11,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:11,352 INFO L87 Difference]: Start difference. First operand 3568 states and 4692 transitions. Second operand 9 states. [2019-10-13 23:22:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:14,735 INFO L93 Difference]: Finished difference Result 8465 states and 11375 transitions. [2019-10-13 23:22:14,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 23:22:14,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-13 23:22:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:14,775 INFO L225 Difference]: With dead ends: 8465 [2019-10-13 23:22:14,776 INFO L226 Difference]: Without dead ends: 8171 [2019-10-13 23:22:14,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-13 23:22:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2019-10-13 23:22:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 3568. [2019-10-13 23:22:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-10-13 23:22:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4691 transitions. [2019-10-13 23:22:15,137 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4691 transitions. Word has length 56 [2019-10-13 23:22:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:15,138 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4691 transitions. [2019-10-13 23:22:15,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4691 transitions. [2019-10-13 23:22:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:15,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:15,146 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-13 23:22:15,146 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:15,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:15,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2025706282, now seen corresponding path program 1 times [2019-10-13 23:22:15,147 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:15,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416603305] [2019-10-13 23:22:15,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:15,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:15,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:15,381 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-13 23:22:15,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416603305] [2019-10-13 23:22:15,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:15,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:22:15,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906165696] [2019-10-13 23:22:15,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:22:15,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:22:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:15,385 INFO L87 Difference]: Start difference. First operand 3568 states and 4691 transitions. Second operand 8 states. [2019-10-13 23:22:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:17,879 INFO L93 Difference]: Finished difference Result 7600 states and 10507 transitions. [2019-10-13 23:22:17,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:22:17,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-13 23:22:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:17,912 INFO L225 Difference]: With dead ends: 7600 [2019-10-13 23:22:17,913 INFO L226 Difference]: Without dead ends: 6700 [2019-10-13 23:22:17,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:22:17,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6700 states. [2019-10-13 23:22:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6700 to 3568. [2019-10-13 23:22:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-10-13 23:22:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4690 transitions. [2019-10-13 23:22:18,170 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4690 transitions. Word has length 56 [2019-10-13 23:22:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:18,170 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4690 transitions. [2019-10-13 23:22:18,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:22:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4690 transitions. [2019-10-13 23:22:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:18,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:18,175 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-13 23:22:18,175 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1601603689, now seen corresponding path program 1 times [2019-10-13 23:22:18,176 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:18,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815030461] [2019-10-13 23:22:18,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:18,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:18,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:18,254 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-13 23:22:18,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815030461] [2019-10-13 23:22:18,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:18,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:18,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81745255] [2019-10-13 23:22:18,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:18,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:18,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:18,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:18,257 INFO L87 Difference]: Start difference. First operand 3568 states and 4690 transitions. Second operand 3 states. [2019-10-13 23:22:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:18,749 INFO L93 Difference]: Finished difference Result 6320 states and 8431 transitions. [2019-10-13 23:22:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:18,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 23:22:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:18,786 INFO L225 Difference]: With dead ends: 6320 [2019-10-13 23:22:18,786 INFO L226 Difference]: Without dead ends: 4323 [2019-10-13 23:22:18,793 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-13 23:22:18,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2019-10-13 23:22:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 4317. [2019-10-13 23:22:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2019-10-13 23:22:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5609 transitions. [2019-10-13 23:22:19,172 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5609 transitions. Word has length 57 [2019-10-13 23:22:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:19,173 INFO L462 AbstractCegarLoop]: Abstraction has 4317 states and 5609 transitions. [2019-10-13 23:22:19,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5609 transitions. [2019-10-13 23:22:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:19,178 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:19,178 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-13 23:22:19,178 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:19,179 INFO L82 PathProgramCache]: Analyzing trace with hash -466438381, now seen corresponding path program 1 times [2019-10-13 23:22:19,180 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:19,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132348991] [2019-10-13 23:22:19,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:19,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:19,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:19,264 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-13 23:22:19,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132348991] [2019-10-13 23:22:19,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:19,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:19,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801041234] [2019-10-13 23:22:19,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:19,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:19,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:19,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:19,267 INFO L87 Difference]: Start difference. First operand 4317 states and 5609 transitions. Second operand 3 states. [2019-10-13 23:22:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:19,802 INFO L93 Difference]: Finished difference Result 6378 states and 8567 transitions. [2019-10-13 23:22:19,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:19,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 23:22:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:19,812 INFO L225 Difference]: With dead ends: 6378 [2019-10-13 23:22:19,813 INFO L226 Difference]: Without dead ends: 4883 [2019-10-13 23:22:19,818 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-13 23:22:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-10-13 23:22:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4543. [2019-10-13 23:22:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4543 states. [2019-10-13 23:22:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4543 states to 4543 states and 5970 transitions. [2019-10-13 23:22:20,267 INFO L78 Accepts]: Start accepts. Automaton has 4543 states and 5970 transitions. Word has length 57 [2019-10-13 23:22:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:20,268 INFO L462 AbstractCegarLoop]: Abstraction has 4543 states and 5970 transitions. [2019-10-13 23:22:20,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4543 states and 5970 transitions. [2019-10-13 23:22:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:20,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:20,275 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-13 23:22:20,275 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1782949341, now seen corresponding path program 1 times [2019-10-13 23:22:20,276 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:20,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668028535] [2019-10-13 23:22:20,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:20,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:20,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:20,363 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-13 23:22:20,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668028535] [2019-10-13 23:22:20,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:20,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:20,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463637247] [2019-10-13 23:22:20,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:20,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:20,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:20,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:20,367 INFO L87 Difference]: Start difference. First operand 4543 states and 5970 transitions. Second operand 3 states. [2019-10-13 23:22:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:21,167 INFO L93 Difference]: Finished difference Result 7631 states and 10359 transitions. [2019-10-13 23:22:21,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:21,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 23:22:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:21,180 INFO L225 Difference]: With dead ends: 7631 [2019-10-13 23:22:21,181 INFO L226 Difference]: Without dead ends: 5552 [2019-10-13 23:22:21,188 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-13 23:22:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5552 states. [2019-10-13 23:22:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5552 to 5052. [2019-10-13 23:22:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5052 states. [2019-10-13 23:22:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5052 states to 5052 states and 6682 transitions. [2019-10-13 23:22:21,742 INFO L78 Accepts]: Start accepts. Automaton has 5052 states and 6682 transitions. Word has length 57 [2019-10-13 23:22:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:21,742 INFO L462 AbstractCegarLoop]: Abstraction has 5052 states and 6682 transitions. [2019-10-13 23:22:21,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 5052 states and 6682 transitions. [2019-10-13 23:22:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:21,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:21,747 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-13 23:22:21,748 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:21,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:21,748 INFO L82 PathProgramCache]: Analyzing trace with hash -794875623, now seen corresponding path program 1 times [2019-10-13 23:22:21,748 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:21,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201403021] [2019-10-13 23:22:21,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:21,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:21,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:21,801 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-13 23:22:21,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201403021] [2019-10-13 23:22:21,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:21,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:21,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539035065] [2019-10-13 23:22:21,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:21,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:21,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:21,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:21,803 INFO L87 Difference]: Start difference. First operand 5052 states and 6682 transitions. Second operand 3 states. [2019-10-13 23:22:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:22,479 INFO L93 Difference]: Finished difference Result 8594 states and 11344 transitions. [2019-10-13 23:22:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:22,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:22,487 INFO L225 Difference]: With dead ends: 8594 [2019-10-13 23:22:22,488 INFO L226 Difference]: Without dead ends: 4102 [2019-10-13 23:22:22,497 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-13 23:22:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-10-13 23:22:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3090. [2019-10-13 23:22:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-10-13 23:22:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 4001 transitions. [2019-10-13 23:22:22,832 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 4001 transitions. Word has length 58 [2019-10-13 23:22:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:22,833 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 4001 transitions. [2019-10-13 23:22:22,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 4001 transitions. [2019-10-13 23:22:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:22,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:22,836 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-13 23:22:22,836 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1917578780, now seen corresponding path program 1 times [2019-10-13 23:22:22,837 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:22,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085614972] [2019-10-13 23:22:22,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:22,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:22,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:22,892 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-13 23:22:22,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085614972] [2019-10-13 23:22:22,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:22,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:22,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487111985] [2019-10-13 23:22:22,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:22,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:22,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:22,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:22,894 INFO L87 Difference]: Start difference. First operand 3090 states and 4001 transitions. Second operand 3 states. [2019-10-13 23:22:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:23,292 INFO L93 Difference]: Finished difference Result 5306 states and 7007 transitions. [2019-10-13 23:22:23,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:23,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:23,302 INFO L225 Difference]: With dead ends: 5306 [2019-10-13 23:22:23,303 INFO L226 Difference]: Without dead ends: 2974 [2019-10-13 23:22:23,308 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-13 23:22:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2019-10-13 23:22:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2364. [2019-10-13 23:22:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-10-13 23:22:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3039 transitions. [2019-10-13 23:22:23,607 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3039 transitions. Word has length 58 [2019-10-13 23:22:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:23,608 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 3039 transitions. [2019-10-13 23:22:23,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3039 transitions. [2019-10-13 23:22:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:23,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:23,610 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-13 23:22:23,611 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:23,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1724765725, now seen corresponding path program 1 times [2019-10-13 23:22:23,611 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:23,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027059122] [2019-10-13 23:22:23,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:23,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:23,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:23,668 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-13 23:22:23,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027059122] [2019-10-13 23:22:23,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:23,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:23,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622791861] [2019-10-13 23:22:23,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:23,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:23,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:23,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:23,671 INFO L87 Difference]: Start difference. First operand 2364 states and 3039 transitions. Second operand 3 states. [2019-10-13 23:22:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:24,285 INFO L93 Difference]: Finished difference Result 5185 states and 6877 transitions. [2019-10-13 23:22:24,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:24,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:24,291 INFO L225 Difference]: With dead ends: 5185 [2019-10-13 23:22:24,291 INFO L226 Difference]: Without dead ends: 3343 [2019-10-13 23:22:24,296 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-13 23:22:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2019-10-13 23:22:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 2699. [2019-10-13 23:22:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2019-10-13 23:22:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3550 transitions. [2019-10-13 23:22:24,729 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3550 transitions. Word has length 58 [2019-10-13 23:22:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:24,729 INFO L462 AbstractCegarLoop]: Abstraction has 2699 states and 3550 transitions. [2019-10-13 23:22:24,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3550 transitions. [2019-10-13 23:22:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:22:24,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:24,730 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-13 23:22:24,731 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:24,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:24,731 INFO L82 PathProgramCache]: Analyzing trace with hash 377672324, now seen corresponding path program 1 times [2019-10-13 23:22:24,731 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:24,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021312719] [2019-10-13 23:22:24,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:24,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:24,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:25,366 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-13 23:22:25,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021312719] [2019-10-13 23:22:25,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:25,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-13 23:22:25,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141055722] [2019-10-13 23:22:25,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 23:22:25,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:25,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 23:22:25,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:22:25,369 INFO L87 Difference]: Start difference. First operand 2699 states and 3550 transitions. Second operand 19 states. [2019-10-13 23:22:25,551 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75