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.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:52,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:52,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:52,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:52,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:52,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:52,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:52,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:52,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:52,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:52,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:52,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:52,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:52,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:52,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:52,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:52,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:52,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:52,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:52,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:52,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:52,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:52,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:52,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:52,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:52,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:52,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:52,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:52,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:52,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:52,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:52,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:52,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:52,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:52,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:52,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:52,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:52,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:52,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:52,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:52,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:52,736 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 21:23:52,756 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:52,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:52,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:52,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:52,760 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:52,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:52,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:52,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:52,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:52,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:52,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:52,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:52,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:52,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:52,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:52,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:52,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:52,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:52,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:52,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:52,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:52,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:52,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:52,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:52,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:52,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:52,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:52,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:52,767 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-13 21:23:53,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:53,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:53,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:53,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:53,059 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:53,060 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:23:53,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ad03986/c145aabc402d4db09160a6f9dea0072d/FLAG446ff6b87 [2019-10-13 21:23:53,767 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:53,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:23:53,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ad03986/c145aabc402d4db09160a6f9dea0072d/FLAG446ff6b87 [2019-10-13 21:23:53,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ad03986/c145aabc402d4db09160a6f9dea0072d [2019-10-13 21:23:53,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:53,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:53,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:53,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:53,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:53,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:53" (1/1) ... [2019-10-13 21:23:53,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43089c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:53, skipping insertion in model container [2019-10-13 21:23:53,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:53" (1/1) ... [2019-10-13 21:23:54,000 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:54,110 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:54,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:54,870 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:55,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:55,344 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:55,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55 WrapperNode [2019-10-13 21:23:55,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:55,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:55,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:55,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:55,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (1/1) ... [2019-10-13 21:23:55,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:55,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:55,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:55,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:55,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (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 21:23:55,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:55,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:55,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:55,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:57,997 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:57,998 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:58,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:57 BoogieIcfgContainer [2019-10-13 21:23:58,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:58,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:58,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:58,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:58,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:53" (1/3) ... [2019-10-13 21:23:58,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a014227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:58, skipping insertion in model container [2019-10-13 21:23:58,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:55" (2/3) ... [2019-10-13 21:23:58,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a014227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:58, skipping insertion in model container [2019-10-13 21:23:58,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:57" (3/3) ... [2019-10-13 21:23:58,017 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 21:23:58,027 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:58,055 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-13 21:23:58,071 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-13 21:23:58,118 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:58,118 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:58,119 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:58,119 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:58,120 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:58,120 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:58,120 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:58,120 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states. [2019-10-13 21:23:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 21:23:58,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:58,201 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 21:23:58,203 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:58,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1062699127, now seen corresponding path program 1 times [2019-10-13 21:23:58,222 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:58,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945785635] [2019-10-13 21:23:58,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:58,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:58,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:58,785 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 21:23:58,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945785635] [2019-10-13 21:23:58,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:58,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:58,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022012152] [2019-10-13 21:23:58,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:58,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:58,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:58,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:58,816 INFO L87 Difference]: Start difference. First operand 447 states. Second operand 3 states. [2019-10-13 21:23:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:59,003 INFO L93 Difference]: Finished difference Result 697 states and 1222 transitions. [2019-10-13 21:23:59,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:59,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-13 21:23:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:59,039 INFO L225 Difference]: With dead ends: 697 [2019-10-13 21:23:59,039 INFO L226 Difference]: Without dead ends: 550 [2019-10-13 21:23:59,047 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 21:23:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-13 21:23:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 544. [2019-10-13 21:23:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-13 21:23:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 719 transitions. [2019-10-13 21:23:59,187 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 719 transitions. Word has length 54 [2019-10-13 21:23:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:59,188 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 719 transitions. [2019-10-13 21:23:59,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 719 transitions. [2019-10-13 21:23:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 21:23:59,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:59,195 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 21:23:59,196 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash -194729860, now seen corresponding path program 1 times [2019-10-13 21:23:59,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:59,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47227735] [2019-10-13 21:23:59,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:59,335 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 21:23:59,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47227735] [2019-10-13 21:23:59,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:59,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:59,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457413123] [2019-10-13 21:23:59,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:59,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:59,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:59,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:59,339 INFO L87 Difference]: Start difference. First operand 544 states and 719 transitions. Second operand 3 states. [2019-10-13 21:23:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:59,440 INFO L93 Difference]: Finished difference Result 959 states and 1321 transitions. [2019-10-13 21:23:59,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:59,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-13 21:23:59,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:59,446 INFO L225 Difference]: With dead ends: 959 [2019-10-13 21:23:59,446 INFO L226 Difference]: Without dead ends: 718 [2019-10-13 21:23:59,449 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 21:23:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-10-13 21:23:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 712. [2019-10-13 21:23:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-13 21:23:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 957 transitions. [2019-10-13 21:23:59,481 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 957 transitions. Word has length 54 [2019-10-13 21:23:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:59,481 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 957 transitions. [2019-10-13 21:23:59,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 957 transitions. [2019-10-13 21:23:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 21:23:59,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:59,484 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 21:23:59,485 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash 509758050, now seen corresponding path program 1 times [2019-10-13 21:23:59,485 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:59,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585883054] [2019-10-13 21:23:59,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:59,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:59,784 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 21:23:59,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585883054] [2019-10-13 21:23:59,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:59,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:23:59,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675887881] [2019-10-13 21:23:59,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:23:59,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:59,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:23:59,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:23:59,787 INFO L87 Difference]: Start difference. First operand 712 states and 957 transitions. Second operand 10 states. [2019-10-13 21:24:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:01,961 INFO L93 Difference]: Finished difference Result 2252 states and 3213 transitions. [2019-10-13 21:24:01,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:24:01,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-13 21:24:01,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:01,974 INFO L225 Difference]: With dead ends: 2252 [2019-10-13 21:24:01,974 INFO L226 Difference]: Without dead ends: 2121 [2019-10-13 21:24:01,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:24:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-10-13 21:24:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 723. [2019-10-13 21:24:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-10-13 21:24:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 971 transitions. [2019-10-13 21:24:02,040 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 971 transitions. Word has length 54 [2019-10-13 21:24:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:02,043 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 971 transitions. [2019-10-13 21:24:02,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:24:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 971 transitions. [2019-10-13 21:24:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:02,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:02,046 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 21:24:02,047 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1420674109, now seen corresponding path program 1 times [2019-10-13 21:24:02,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:02,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12183655] [2019-10-13 21:24:02,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:02,127 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 21:24:02,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12183655] [2019-10-13 21:24:02,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:02,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:02,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896116088] [2019-10-13 21:24:02,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:02,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:02,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:02,129 INFO L87 Difference]: Start difference. First operand 723 states and 971 transitions. Second operand 3 states. [2019-10-13 21:24:02,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:02,241 INFO L93 Difference]: Finished difference Result 1390 states and 1920 transitions. [2019-10-13 21:24:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:02,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-13 21:24:02,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:02,247 INFO L225 Difference]: With dead ends: 1390 [2019-10-13 21:24:02,248 INFO L226 Difference]: Without dead ends: 1061 [2019-10-13 21:24:02,249 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 21:24:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-10-13 21:24:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1054. [2019-10-13 21:24:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-10-13 21:24:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1429 transitions. [2019-10-13 21:24:02,310 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1429 transitions. Word has length 55 [2019-10-13 21:24:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:02,311 INFO L462 AbstractCegarLoop]: Abstraction has 1054 states and 1429 transitions. [2019-10-13 21:24:02,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1429 transitions. [2019-10-13 21:24:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:02,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:02,314 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 21:24:02,314 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:02,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:02,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1526715040, now seen corresponding path program 1 times [2019-10-13 21:24:02,315 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:02,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574095630] [2019-10-13 21:24:02,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:02,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:02,572 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 21:24:02,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574095630] [2019-10-13 21:24:02,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:02,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:24:02,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903330629] [2019-10-13 21:24:02,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:24:02,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:02,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:24:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:24:02,575 INFO L87 Difference]: Start difference. First operand 1054 states and 1429 transitions. Second operand 12 states. [2019-10-13 21:24:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:06,818 INFO L93 Difference]: Finished difference Result 3825 states and 5350 transitions. [2019-10-13 21:24:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:24:06,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-10-13 21:24:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:06,842 INFO L225 Difference]: With dead ends: 3825 [2019-10-13 21:24:06,842 INFO L226 Difference]: Without dead ends: 3626 [2019-10-13 21:24:06,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:24:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-10-13 21:24:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 1070. [2019-10-13 21:24:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2019-10-13 21:24:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1452 transitions. [2019-10-13 21:24:07,009 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1452 transitions. Word has length 55 [2019-10-13 21:24:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:07,012 INFO L462 AbstractCegarLoop]: Abstraction has 1070 states and 1452 transitions. [2019-10-13 21:24:07,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:24:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1452 transitions. [2019-10-13 21:24:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:07,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:07,017 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 21:24:07,017 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:07,019 INFO L82 PathProgramCache]: Analyzing trace with hash -822227130, now seen corresponding path program 1 times [2019-10-13 21:24:07,019 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:07,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992807706] [2019-10-13 21:24:07,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:07,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:07,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:07,244 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 21:24:07,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992807706] [2019-10-13 21:24:07,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:07,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:07,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523332136] [2019-10-13 21:24:07,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:07,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:07,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:07,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:07,249 INFO L87 Difference]: Start difference. First operand 1070 states and 1452 transitions. Second operand 9 states. [2019-10-13 21:24:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:08,695 INFO L93 Difference]: Finished difference Result 4052 states and 5667 transitions. [2019-10-13 21:24:08,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:24:08,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-13 21:24:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:08,713 INFO L225 Difference]: With dead ends: 4052 [2019-10-13 21:24:08,713 INFO L226 Difference]: Without dead ends: 3292 [2019-10-13 21:24:08,716 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-13 21:24:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2019-10-13 21:24:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 2379. [2019-10-13 21:24:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2019-10-13 21:24:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3335 transitions. [2019-10-13 21:24:08,966 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3335 transitions. Word has length 55 [2019-10-13 21:24:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:08,966 INFO L462 AbstractCegarLoop]: Abstraction has 2379 states and 3335 transitions. [2019-10-13 21:24:08,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3335 transitions. [2019-10-13 21:24:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:08,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:08,970 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 21:24:08,970 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1576357576, now seen corresponding path program 1 times [2019-10-13 21:24:08,971 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:08,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123566542] [2019-10-13 21:24:08,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:08,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:08,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:09,229 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 21:24:09,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123566542] [2019-10-13 21:24:09,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:09,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:24:09,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837615771] [2019-10-13 21:24:09,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:24:09,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:09,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:24:09,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:24:09,231 INFO L87 Difference]: Start difference. First operand 2379 states and 3335 transitions. Second operand 10 states. [2019-10-13 21:24:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:11,084 INFO L93 Difference]: Finished difference Result 6160 states and 8682 transitions. [2019-10-13 21:24:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:24:11,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-13 21:24:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:11,111 INFO L225 Difference]: With dead ends: 6160 [2019-10-13 21:24:11,111 INFO L226 Difference]: Without dead ends: 5771 [2019-10-13 21:24:11,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:24:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2019-10-13 21:24:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 2390. [2019-10-13 21:24:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-10-13 21:24:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3349 transitions. [2019-10-13 21:24:11,366 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3349 transitions. Word has length 55 [2019-10-13 21:24:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:11,366 INFO L462 AbstractCegarLoop]: Abstraction has 2390 states and 3349 transitions. [2019-10-13 21:24:11,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:24:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3349 transitions. [2019-10-13 21:24:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:11,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:11,370 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 21:24:11,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:11,371 INFO L82 PathProgramCache]: Analyzing trace with hash 306490719, now seen corresponding path program 1 times [2019-10-13 21:24:11,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:11,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443563855] [2019-10-13 21:24:11,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:11,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:11,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:11,531 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 21:24:11,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443563855] [2019-10-13 21:24:11,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:11,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:11,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955494674] [2019-10-13 21:24:11,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:11,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:11,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:11,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:11,535 INFO L87 Difference]: Start difference. First operand 2390 states and 3349 transitions. Second operand 9 states. [2019-10-13 21:24:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:13,343 INFO L93 Difference]: Finished difference Result 6728 states and 9609 transitions. [2019-10-13 21:24:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:24:13,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-13 21:24:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:13,375 INFO L225 Difference]: With dead ends: 6728 [2019-10-13 21:24:13,375 INFO L226 Difference]: Without dead ends: 6175 [2019-10-13 21:24:13,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:24:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6175 states. [2019-10-13 21:24:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6175 to 2405. [2019-10-13 21:24:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-10-13 21:24:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3371 transitions. [2019-10-13 21:24:13,685 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3371 transitions. Word has length 56 [2019-10-13 21:24:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:13,686 INFO L462 AbstractCegarLoop]: Abstraction has 2405 states and 3371 transitions. [2019-10-13 21:24:13,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3371 transitions. [2019-10-13 21:24:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:13,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:13,690 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 21:24:13,691 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash 943835121, now seen corresponding path program 1 times [2019-10-13 21:24:13,692 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:13,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786679182] [2019-10-13 21:24:13,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:13,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:13,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:13,819 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 21:24:13,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786679182] [2019-10-13 21:24:13,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:13,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:13,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926590314] [2019-10-13 21:24:13,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:13,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:13,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:13,825 INFO L87 Difference]: Start difference. First operand 2405 states and 3371 transitions. Second operand 6 states. [2019-10-13 21:24:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:14,408 INFO L93 Difference]: Finished difference Result 4144 states and 5874 transitions. [2019-10-13 21:24:14,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:14,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-13 21:24:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:14,419 INFO L225 Difference]: With dead ends: 4144 [2019-10-13 21:24:14,419 INFO L226 Difference]: Without dead ends: 2374 [2019-10-13 21:24:14,423 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 21:24:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-10-13 21:24:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1715. [2019-10-13 21:24:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-13 21:24:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2382 transitions. [2019-10-13 21:24:14,616 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2382 transitions. Word has length 56 [2019-10-13 21:24:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:14,616 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2382 transitions. [2019-10-13 21:24:14,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2382 transitions. [2019-10-13 21:24:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:14,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:14,619 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 21:24:14,619 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:14,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash 776701643, now seen corresponding path program 1 times [2019-10-13 21:24:14,620 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:14,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335009385] [2019-10-13 21:24:14,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:14,620 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:14,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:14,751 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 21:24:14,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335009385] [2019-10-13 21:24:14,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:14,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:24:14,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374379989] [2019-10-13 21:24:14,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:24:14,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:14,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:24:14,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:24:14,753 INFO L87 Difference]: Start difference. First operand 1715 states and 2382 transitions. Second operand 10 states. [2019-10-13 21:24:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:18,418 INFO L93 Difference]: Finished difference Result 8475 states and 12038 transitions. [2019-10-13 21:24:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:24:18,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-13 21:24:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:18,438 INFO L225 Difference]: With dead ends: 8475 [2019-10-13 21:24:18,438 INFO L226 Difference]: Without dead ends: 7941 [2019-10-13 21:24:18,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:24:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7941 states. [2019-10-13 21:24:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7941 to 1715. [2019-10-13 21:24:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-13 21:24:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2382 transitions. [2019-10-13 21:24:18,673 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2382 transitions. Word has length 56 [2019-10-13 21:24:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:18,674 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2382 transitions. [2019-10-13 21:24:18,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:24:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2382 transitions. [2019-10-13 21:24:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:18,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:18,677 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 21:24:18,677 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:18,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1768109464, now seen corresponding path program 1 times [2019-10-13 21:24:18,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:18,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897705268] [2019-10-13 21:24:18,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:18,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:18,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:18,818 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 21:24:18,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897705268] [2019-10-13 21:24:18,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:18,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:18,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888446859] [2019-10-13 21:24:18,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:18,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:18,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:18,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:18,821 INFO L87 Difference]: Start difference. First operand 1715 states and 2382 transitions. Second operand 9 states. [2019-10-13 21:24:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:20,696 INFO L93 Difference]: Finished difference Result 7739 states and 10931 transitions. [2019-10-13 21:24:20,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:24:20,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-13 21:24:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:20,720 INFO L225 Difference]: With dead ends: 7739 [2019-10-13 21:24:20,720 INFO L226 Difference]: Without dead ends: 6267 [2019-10-13 21:24:20,730 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-13 21:24:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6267 states. [2019-10-13 21:24:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6267 to 4343. [2019-10-13 21:24:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4343 states. [2019-10-13 21:24:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6162 transitions. [2019-10-13 21:24:21,295 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6162 transitions. Word has length 56 [2019-10-13 21:24:21,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:21,295 INFO L462 AbstractCegarLoop]: Abstraction has 4343 states and 6162 transitions. [2019-10-13 21:24:21,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6162 transitions. [2019-10-13 21:24:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:21,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:21,300 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 21:24:21,300 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1848159850, now seen corresponding path program 1 times [2019-10-13 21:24:21,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:21,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564717184] [2019-10-13 21:24:21,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:21,425 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 21:24:21,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564717184] [2019-10-13 21:24:21,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:21,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:21,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225311993] [2019-10-13 21:24:21,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:21,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:21,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:21,427 INFO L87 Difference]: Start difference. First operand 4343 states and 6162 transitions. Second operand 9 states. [2019-10-13 21:24:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:25,681 INFO L93 Difference]: Finished difference Result 16319 states and 22817 transitions. [2019-10-13 21:24:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:24:25,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-13 21:24:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:25,711 INFO L225 Difference]: With dead ends: 16319 [2019-10-13 21:24:25,711 INFO L226 Difference]: Without dead ends: 14835 [2019-10-13 21:24:25,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:24:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14835 states. [2019-10-13 21:24:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14835 to 4357. [2019-10-13 21:24:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4357 states. [2019-10-13 21:24:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4357 states to 4357 states and 6180 transitions. [2019-10-13 21:24:26,450 INFO L78 Accepts]: Start accepts. Automaton has 4357 states and 6180 transitions. Word has length 56 [2019-10-13 21:24:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:26,450 INFO L462 AbstractCegarLoop]: Abstraction has 4357 states and 6180 transitions. [2019-10-13 21:24:26,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4357 states and 6180 transitions. [2019-10-13 21:24:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:26,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:26,454 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 21:24:26,454 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash -802335602, now seen corresponding path program 1 times [2019-10-13 21:24:26,454 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:26,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138410004] [2019-10-13 21:24:26,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:26,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:26,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:26,549 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 21:24:26,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138410004] [2019-10-13 21:24:26,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:26,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:24:26,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802306396] [2019-10-13 21:24:26,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:24:26,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:26,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:24:26,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:24:26,552 INFO L87 Difference]: Start difference. First operand 4357 states and 6180 transitions. Second operand 7 states.