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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/mem_slave_tlm.3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:13:29,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:13:29,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:13:29,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:13:29,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:13:29,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:13:29,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:13:29,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:13:29,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:13:29,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:13:29,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:13:29,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:13:29,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:13:29,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:13:29,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:13:29,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:13:29,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:13:29,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:13:29,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:13:29,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:13:29,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:13:29,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:13:29,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:13:29,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:13:29,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:13:29,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:13:29,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:13:29,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:13:29,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:13:29,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:13:29,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:13:29,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:13:29,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:13:29,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:13:29,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:13:29,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:13:29,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:13:29,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:13:29,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:13:29,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:13:29,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:13:29,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:13:29,762 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:13:29,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:13:29,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:13:29,763 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:13:29,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:13:29,764 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:13:29,764 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:13:29,764 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:13:29,764 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:13:29,765 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:13:29,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:13:29,765 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:13:29,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:13:29,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:13:29,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:13:29,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:13:29,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:13:29,767 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:13:29,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:13:29,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:13:29,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:13:29,767 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:13:29,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:13:29,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:13:29,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:13:29,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:13:29,769 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:13:29,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:13:29,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:13:29,769 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:13:29,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:13:29,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:13:29,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:13:29,817 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:13:29,817 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:13:29,818 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/mem_slave_tlm.3.cil.c [2019-09-10 03:13:29,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a490d82b7/b8fce96375dc430ca378245da34800cd/FLAG2d59e7e35 [2019-09-10 03:13:30,320 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:13:30,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.3.cil.c [2019-09-10 03:13:30,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a490d82b7/b8fce96375dc430ca378245da34800cd/FLAG2d59e7e35 [2019-09-10 03:13:30,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a490d82b7/b8fce96375dc430ca378245da34800cd [2019-09-10 03:13:30,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:13:30,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:13:30,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:13:30,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:13:30,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:13:30,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:13:30" (1/1) ... [2019-09-10 03:13:30,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe8b1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:30, skipping insertion in model container [2019-09-10 03:13:30,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:13:30" (1/1) ... [2019-09-10 03:13:30,721 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:13:30,768 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:13:31,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:13:31,171 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:13:31,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:13:31,268 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:13:31,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:31 WrapperNode [2019-09-10 03:13:31,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:13:31,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:13:31,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:13:31,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:13:31,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:31" (1/1) ... [2019-09-10 03:13:31,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:31" (1/1) ... [2019-09-10 03:13:31,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:31" (1/1) ... [2019-09-10 03:13:31,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:31" (1/1) ... [2019-09-10 03:13:31,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:31" (1/1) ... [2019-09-10 03:13:31,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:31" (1/1) ... [2019-09-10 03:13:31,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:31" (1/1) ... [2019-09-10 03:13:31,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:13:31,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:13:31,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:13:31,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:13:31,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:31" (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-09-10 03:13:31,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:13:31,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:13:31,448 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:13:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure s_memory_read [2019-09-10 03:13:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure s_memory_write [2019-09-10 03:13:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure m_run [2019-09-10 03:13:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure s_run [2019-09-10 03:13:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:13:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:13:31,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:13:31,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:13:31,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:13:31,451 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:13:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure s_memory_read [2019-09-10 03:13:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure s_memory_write [2019-09-10 03:13:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure m_run [2019-09-10 03:13:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure s_run [2019-09-10 03:13:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:13:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:13:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:13:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:13:31,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:13:32,697 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:13:32,697 INFO L283 CfgBuilder]: Removed 13 assume(true) statements. [2019-09-10 03:13:32,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:13:32 BoogieIcfgContainer [2019-09-10 03:13:32,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:13:32,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:13:32,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:13:32,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:13:32,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:13:30" (1/3) ... [2019-09-10 03:13:32,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e247600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:13:32, skipping insertion in model container [2019-09-10 03:13:32,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:13:31" (2/3) ... [2019-09-10 03:13:32,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e247600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:13:32, skipping insertion in model container [2019-09-10 03:13:32,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:13:32" (3/3) ... [2019-09-10 03:13:32,712 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3.cil.c [2019-09-10 03:13:32,722 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:13:32,747 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:13:32,769 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:13:32,814 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:13:32,815 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:13:32,815 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:13:32,815 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:13:32,815 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:13:32,816 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:13:32,816 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:13:32,816 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:13:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-09-10 03:13:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 03:13:32,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:32,863 INFO L399 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] [2019-09-10 03:13:32,864 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1983901195, now seen corresponding path program 1 times [2019-09-10 03:13:32,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:32,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:32,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:33,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:33,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:33,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:33,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:33,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:33,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:33,261 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-09-10 03:13:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:33,744 INFO L93 Difference]: Finished difference Result 507 states and 821 transitions. [2019-09-10 03:13:33,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:33,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-10 03:13:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:33,771 INFO L225 Difference]: With dead ends: 507 [2019-09-10 03:13:33,771 INFO L226 Difference]: Without dead ends: 493 [2019-09-10 03:13:33,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09-10 03:13:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-10 03:13:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 480. [2019-09-10 03:13:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-10 03:13:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 795 transitions. [2019-09-10 03:13:33,856 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 795 transitions. Word has length 39 [2019-09-10 03:13:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:33,857 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 795 transitions. [2019-09-10 03:13:33,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 795 transitions. [2019-09-10 03:13:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 03:13:33,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:33,861 INFO L399 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] [2019-09-10 03:13:33,862 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:33,862 INFO L82 PathProgramCache]: Analyzing trace with hash 963174849, now seen corresponding path program 1 times [2019-09-10 03:13:33,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:33,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:33,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:33,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:33,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:33,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:33,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:33,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:33,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:33,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:33,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:33,977 INFO L87 Difference]: Start difference. First operand 480 states and 795 transitions. Second operand 3 states. [2019-09-10 03:13:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:34,388 INFO L93 Difference]: Finished difference Result 681 states and 1097 transitions. [2019-09-10 03:13:34,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:34,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-09-10 03:13:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:34,393 INFO L225 Difference]: With dead ends: 681 [2019-09-10 03:13:34,393 INFO L226 Difference]: Without dead ends: 681 [2019-09-10 03:13:34,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-09-10 03:13:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 668. [2019-09-10 03:13:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-10 03:13:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1085 transitions. [2019-09-10 03:13:34,431 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1085 transitions. Word has length 42 [2019-09-10 03:13:34,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:34,431 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 1085 transitions. [2019-09-10 03:13:34,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1085 transitions. [2019-09-10 03:13:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-10 03:13:34,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:34,436 INFO L399 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] [2019-09-10 03:13:34,436 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:34,437 INFO L82 PathProgramCache]: Analyzing trace with hash -184896711, now seen corresponding path program 1 times [2019-09-10 03:13:34,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:34,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:34,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:34,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:34,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:34,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:34,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:34,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:34,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:34,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:34,556 INFO L87 Difference]: Start difference. First operand 668 states and 1085 transitions. Second operand 3 states. [2019-09-10 03:13:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:34,818 INFO L93 Difference]: Finished difference Result 870 states and 1374 transitions. [2019-09-10 03:13:34,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:34,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-10 03:13:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:34,825 INFO L225 Difference]: With dead ends: 870 [2019-09-10 03:13:34,825 INFO L226 Difference]: Without dead ends: 870 [2019-09-10 03:13:34,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-09-10 03:13:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 857. [2019-09-10 03:13:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-10 03:13:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1362 transitions. [2019-09-10 03:13:34,853 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1362 transitions. Word has length 44 [2019-09-10 03:13:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:34,853 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1362 transitions. [2019-09-10 03:13:34,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1362 transitions. [2019-09-10 03:13:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:13:34,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:34,855 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:34,856 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1239811520, now seen corresponding path program 1 times [2019-09-10 03:13:34,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:34,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:34,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:34,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:34,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:34,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:34,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:34,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:34,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:34,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:34,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:34,921 INFO L87 Difference]: Start difference. First operand 857 states and 1362 transitions. Second operand 3 states. [2019-09-10 03:13:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:35,150 INFO L93 Difference]: Finished difference Result 1005 states and 1554 transitions. [2019-09-10 03:13:35,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:35,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-10 03:13:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:35,156 INFO L225 Difference]: With dead ends: 1005 [2019-09-10 03:13:35,156 INFO L226 Difference]: Without dead ends: 1005 [2019-09-10 03:13:35,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-09-10 03:13:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 996. [2019-09-10 03:13:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-09-10 03:13:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1546 transitions. [2019-09-10 03:13:35,185 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1546 transitions. Word has length 49 [2019-09-10 03:13:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:35,185 INFO L475 AbstractCegarLoop]: Abstraction has 996 states and 1546 transitions. [2019-09-10 03:13:35,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1546 transitions. [2019-09-10 03:13:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 03:13:35,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:35,187 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:35,187 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:35,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:35,188 INFO L82 PathProgramCache]: Analyzing trace with hash -704464747, now seen corresponding path program 1 times [2019-09-10 03:13:35,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:35,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:35,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:35,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:35,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:35,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:35,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:35,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:35,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:35,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:35,272 INFO L87 Difference]: Start difference. First operand 996 states and 1546 transitions. Second operand 3 states. [2019-09-10 03:13:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:35,489 INFO L93 Difference]: Finished difference Result 1145 states and 1731 transitions. [2019-09-10 03:13:35,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:35,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-10 03:13:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:35,502 INFO L225 Difference]: With dead ends: 1145 [2019-09-10 03:13:35,502 INFO L226 Difference]: Without dead ends: 1145 [2019-09-10 03:13:35,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-09-10 03:13:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1136. [2019-09-10 03:13:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2019-09-10 03:13:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1723 transitions. [2019-09-10 03:13:35,535 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1723 transitions. Word has length 51 [2019-09-10 03:13:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:35,537 INFO L475 AbstractCegarLoop]: Abstraction has 1136 states and 1723 transitions. [2019-09-10 03:13:35,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1723 transitions. [2019-09-10 03:13:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 03:13:35,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:35,541 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:35,541 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash 729027308, now seen corresponding path program 1 times [2019-09-10 03:13:35,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:35,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:35,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:35,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:35,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:35,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:35,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:35,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:35,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:35,618 INFO L87 Difference]: Start difference. First operand 1136 states and 1723 transitions. Second operand 3 states. [2019-09-10 03:13:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:35,780 INFO L93 Difference]: Finished difference Result 2139 states and 3245 transitions. [2019-09-10 03:13:35,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:35,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-10 03:13:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:35,794 INFO L225 Difference]: With dead ends: 2139 [2019-09-10 03:13:35,794 INFO L226 Difference]: Without dead ends: 2139 [2019-09-10 03:13:35,795 INFO L628 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-09-10 03:13:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-09-10 03:13:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2126. [2019-09-10 03:13:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-09-10 03:13:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3233 transitions. [2019-09-10 03:13:35,862 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3233 transitions. Word has length 51 [2019-09-10 03:13:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:35,863 INFO L475 AbstractCegarLoop]: Abstraction has 2126 states and 3233 transitions. [2019-09-10 03:13:35,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:35,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3233 transitions. [2019-09-10 03:13:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 03:13:35,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:35,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:35,879 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:35,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:35,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1724529657, now seen corresponding path program 1 times [2019-09-10 03:13:35,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:35,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:35,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:35,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:35,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:35,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:35,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:35,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:35,966 INFO L87 Difference]: Start difference. First operand 2126 states and 3233 transitions. Second operand 3 states. [2019-09-10 03:13:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:36,161 INFO L93 Difference]: Finished difference Result 2391 states and 3540 transitions. [2019-09-10 03:13:36,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:36,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-10 03:13:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:36,173 INFO L225 Difference]: With dead ends: 2391 [2019-09-10 03:13:36,173 INFO L226 Difference]: Without dead ends: 2391 [2019-09-10 03:13:36,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09-10 03:13:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2019-09-10 03:13:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2382. [2019-09-10 03:13:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2382 states. [2019-09-10 03:13:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3532 transitions. [2019-09-10 03:13:36,231 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3532 transitions. Word has length 51 [2019-09-10 03:13:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:36,232 INFO L475 AbstractCegarLoop]: Abstraction has 2382 states and 3532 transitions. [2019-09-10 03:13:36,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3532 transitions. [2019-09-10 03:13:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 03:13:36,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:36,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:36,234 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:36,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:36,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1129417961, now seen corresponding path program 1 times [2019-09-10 03:13:36,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:36,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:36,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:36,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:36,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:36,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:36,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:36,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:36,279 INFO L87 Difference]: Start difference. First operand 2382 states and 3532 transitions. Second operand 3 states. [2019-09-10 03:13:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:36,423 INFO L93 Difference]: Finished difference Result 4489 states and 6772 transitions. [2019-09-10 03:13:36,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:36,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 03:13:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:36,454 INFO L225 Difference]: With dead ends: 4489 [2019-09-10 03:13:36,454 INFO L226 Difference]: Without dead ends: 4489 [2019-09-10 03:13:36,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09-10 03:13:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-09-10 03:13:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4454. [2019-09-10 03:13:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-09-10 03:13:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 6738 transitions. [2019-09-10 03:13:36,650 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 6738 transitions. Word has length 52 [2019-09-10 03:13:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:36,651 INFO L475 AbstractCegarLoop]: Abstraction has 4454 states and 6738 transitions. [2019-09-10 03:13:36,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 6738 transitions. [2019-09-10 03:13:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 03:13:36,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:36,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:36,655 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:36,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1665889234, now seen corresponding path program 1 times [2019-09-10 03:13:36,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:36,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:36,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:36,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:36,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:36,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 03:13:36,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:36,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:13:36,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:13:36,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:13:36,841 INFO L87 Difference]: Start difference. First operand 4454 states and 6738 transitions. Second operand 8 states. [2019-09-10 03:13:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:37,241 INFO L93 Difference]: Finished difference Result 8280 states and 13142 transitions. [2019-09-10 03:13:37,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:13:37,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-10 03:13:37,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:37,292 INFO L225 Difference]: With dead ends: 8280 [2019-09-10 03:13:37,293 INFO L226 Difference]: Without dead ends: 8280 [2019-09-10 03:13:37,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-09-10 03:13:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2019-09-10 03:13:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 7171. [2019-09-10 03:13:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7171 states. [2019-09-10 03:13:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7171 states to 7171 states and 11587 transitions. [2019-09-10 03:13:37,715 INFO L78 Accepts]: Start accepts. Automaton has 7171 states and 11587 transitions. Word has length 52 [2019-09-10 03:13:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:37,716 INFO L475 AbstractCegarLoop]: Abstraction has 7171 states and 11587 transitions. [2019-09-10 03:13:37,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:13:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7171 states and 11587 transitions. [2019-09-10 03:13:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 03:13:37,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:37,719 INFO L399 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] [2019-09-10 03:13:37,719 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1081550133, now seen corresponding path program 1 times [2019-09-10 03:13:37,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:37,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:37,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:37,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:37,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:37,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:37,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:13:37,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:37,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:13:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:13:37,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:13:37,899 INFO L87 Difference]: Start difference. First operand 7171 states and 11587 transitions. Second operand 4 states. [2019-09-10 03:13:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:38,029 INFO L93 Difference]: Finished difference Result 7830 states and 12540 transitions. [2019-09-10 03:13:38,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:13:38,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-09-10 03:13:38,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:38,088 INFO L225 Difference]: With dead ends: 7830 [2019-09-10 03:13:38,088 INFO L226 Difference]: Without dead ends: 7830 [2019-09-10 03:13:38,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:13:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7830 states. [2019-09-10 03:13:38,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7830 to 6915. [2019-09-10 03:13:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6915 states. [2019-09-10 03:13:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6915 states to 6915 states and 11203 transitions. [2019-09-10 03:13:38,508 INFO L78 Accepts]: Start accepts. Automaton has 6915 states and 11203 transitions. Word has length 53 [2019-09-10 03:13:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:38,509 INFO L475 AbstractCegarLoop]: Abstraction has 6915 states and 11203 transitions. [2019-09-10 03:13:38,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:13:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6915 states and 11203 transitions. [2019-09-10 03:13:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 03:13:38,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:38,517 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:38,517 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:38,518 INFO L82 PathProgramCache]: Analyzing trace with hash 213321994, now seen corresponding path program 1 times [2019-09-10 03:13:38,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:38,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:38,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:38,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:38,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:13:38,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:38,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:13:38,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:13:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:13:38,616 INFO L87 Difference]: Start difference. First operand 6915 states and 11203 transitions. Second operand 4 states. [2019-09-10 03:13:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:39,158 INFO L93 Difference]: Finished difference Result 9967 states and 17489 transitions. [2019-09-10 03:13:39,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:13:39,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-10 03:13:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:39,195 INFO L225 Difference]: With dead ends: 9967 [2019-09-10 03:13:39,195 INFO L226 Difference]: Without dead ends: 9967 [2019-09-10 03:13:39,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:13:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9967 states. [2019-09-10 03:13:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9967 to 9857. [2019-09-10 03:13:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9857 states. [2019-09-10 03:13:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9857 states to 9857 states and 17361 transitions. [2019-09-10 03:13:39,914 INFO L78 Accepts]: Start accepts. Automaton has 9857 states and 17361 transitions. Word has length 63 [2019-09-10 03:13:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:39,916 INFO L475 AbstractCegarLoop]: Abstraction has 9857 states and 17361 transitions. [2019-09-10 03:13:39,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:13:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 9857 states and 17361 transitions. [2019-09-10 03:13:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 03:13:39,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:39,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:39,939 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:39,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash -945736246, now seen corresponding path program 1 times [2019-09-10 03:13:39,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:39,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:39,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:39,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:39,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:40,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:40,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:40,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:40,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:40,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:40,016 INFO L87 Difference]: Start difference. First operand 9857 states and 17361 transitions. Second operand 3 states. [2019-09-10 03:13:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:40,181 INFO L93 Difference]: Finished difference Result 9537 states and 16852 transitions. [2019-09-10 03:13:40,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:40,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 03:13:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:40,217 INFO L225 Difference]: With dead ends: 9537 [2019-09-10 03:13:40,217 INFO L226 Difference]: Without dead ends: 9537 [2019-09-10 03:13:40,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-09-10 03:13:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-09-10 03:13:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 9505. [2019-09-10 03:13:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9505 states. [2019-09-10 03:13:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9505 states to 9505 states and 16800 transitions. [2019-09-10 03:13:41,440 INFO L78 Accepts]: Start accepts. Automaton has 9505 states and 16800 transitions. Word has length 77 [2019-09-10 03:13:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:41,440 INFO L475 AbstractCegarLoop]: Abstraction has 9505 states and 16800 transitions. [2019-09-10 03:13:41,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 9505 states and 16800 transitions. [2019-09-10 03:13:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 03:13:41,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:41,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:41,466 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1333786741, now seen corresponding path program 1 times [2019-09-10 03:13:41,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:41,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:41,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:41,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:41,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:41,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:41,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:41,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:41,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:41,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:41,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:41,535 INFO L87 Difference]: Start difference. First operand 9505 states and 16800 transitions. Second operand 3 states. [2019-09-10 03:13:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:41,859 INFO L93 Difference]: Finished difference Result 9525 states and 16745 transitions. [2019-09-10 03:13:41,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:41,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 03:13:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:41,898 INFO L225 Difference]: With dead ends: 9525 [2019-09-10 03:13:41,898 INFO L226 Difference]: Without dead ends: 9525 [2019-09-10 03:13:41,898 INFO L628 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-09-10 03:13:41,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9525 states. [2019-09-10 03:13:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9525 to 9505. [2019-09-10 03:13:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9505 states. [2019-09-10 03:13:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9505 states to 9505 states and 16726 transitions. [2019-09-10 03:13:42,476 INFO L78 Accepts]: Start accepts. Automaton has 9505 states and 16726 transitions. Word has length 79 [2019-09-10 03:13:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:42,476 INFO L475 AbstractCegarLoop]: Abstraction has 9505 states and 16726 transitions. [2019-09-10 03:13:42,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9505 states and 16726 transitions. [2019-09-10 03:13:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 03:13:42,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:42,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:42,498 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:42,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2096221435, now seen corresponding path program 1 times [2019-09-10 03:13:42,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:42,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:42,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:42,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:42,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:42,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:42,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:13:42,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:42,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:13:42,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:13:42,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:13:42,583 INFO L87 Difference]: Start difference. First operand 9505 states and 16726 transitions. Second operand 4 states. [2019-09-10 03:13:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:43,004 INFO L93 Difference]: Finished difference Result 9475 states and 15993 transitions. [2019-09-10 03:13:43,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:13:43,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-10 03:13:43,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:43,037 INFO L225 Difference]: With dead ends: 9475 [2019-09-10 03:13:43,037 INFO L226 Difference]: Without dead ends: 9475 [2019-09-10 03:13:43,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:13:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9475 states. [2019-09-10 03:13:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9475 to 8538. [2019-09-10 03:13:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8538 states. [2019-09-10 03:13:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 14519 transitions. [2019-09-10 03:13:43,436 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 14519 transitions. Word has length 77 [2019-09-10 03:13:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:43,437 INFO L475 AbstractCegarLoop]: Abstraction has 8538 states and 14519 transitions. [2019-09-10 03:13:43,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:13:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 14519 transitions. [2019-09-10 03:13:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 03:13:43,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:43,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:43,448 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:43,448 INFO L82 PathProgramCache]: Analyzing trace with hash -227036465, now seen corresponding path program 1 times [2019-09-10 03:13:43,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:43,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:43,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:43,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:43,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:43,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:43,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:43,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:43,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:43,489 INFO L87 Difference]: Start difference. First operand 8538 states and 14519 transitions. Second operand 3 states. [2019-09-10 03:13:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:43,568 INFO L93 Difference]: Finished difference Result 8386 states and 14213 transitions. [2019-09-10 03:13:43,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:43,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 03:13:43,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:43,603 INFO L225 Difference]: With dead ends: 8386 [2019-09-10 03:13:43,603 INFO L226 Difference]: Without dead ends: 8386 [2019-09-10 03:13:43,605 INFO L628 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-09-10 03:13:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8386 states. [2019-09-10 03:13:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8386 to 8386. [2019-09-10 03:13:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8386 states. [2019-09-10 03:13:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8386 states to 8386 states and 14213 transitions. [2019-09-10 03:13:44,070 INFO L78 Accepts]: Start accepts. Automaton has 8386 states and 14213 transitions. Word has length 80 [2019-09-10 03:13:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:44,070 INFO L475 AbstractCegarLoop]: Abstraction has 8386 states and 14213 transitions. [2019-09-10 03:13:44,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 8386 states and 14213 transitions. [2019-09-10 03:13:44,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 03:13:44,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:44,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:44,080 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:44,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:44,081 INFO L82 PathProgramCache]: Analyzing trace with hash -303937263, now seen corresponding path program 1 times [2019-09-10 03:13:44,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:44,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:44,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:44,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:44,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:44,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:44,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:13:44,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:44,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:13:44,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:13:44,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:13:44,196 INFO L87 Difference]: Start difference. First operand 8386 states and 14213 transitions. Second operand 9 states. [2019-09-10 03:13:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:48,720 INFO L93 Difference]: Finished difference Result 16014 states and 49417 transitions. [2019-09-10 03:13:48,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 03:13:48,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 03:13:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:48,875 INFO L225 Difference]: With dead ends: 16014 [2019-09-10 03:13:48,875 INFO L226 Difference]: Without dead ends: 16014 [2019-09-10 03:13:48,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2019-09-10 03:13:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-09-10 03:13:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 13600. [2019-09-10 03:13:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13600 states. [2019-09-10 03:13:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13600 states to 13600 states and 40150 transitions. [2019-09-10 03:13:51,388 INFO L78 Accepts]: Start accepts. Automaton has 13600 states and 40150 transitions. Word has length 80 [2019-09-10 03:13:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:51,388 INFO L475 AbstractCegarLoop]: Abstraction has 13600 states and 40150 transitions. [2019-09-10 03:13:51,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:13:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 13600 states and 40150 transitions. [2019-09-10 03:13:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 03:13:51,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:51,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:51,415 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:51,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:51,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1810711992, now seen corresponding path program 1 times [2019-09-10 03:13:51,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:51,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:51,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:51,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:51,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 03:13:51,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:51,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:13:51,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:13:51,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:13:51,569 INFO L87 Difference]: Start difference. First operand 13600 states and 40150 transitions. Second operand 8 states. [2019-09-10 03:13:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:53,169 INFO L93 Difference]: Finished difference Result 21562 states and 80721 transitions. [2019-09-10 03:13:53,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:13:53,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-09-10 03:13:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:53,360 INFO L225 Difference]: With dead ends: 21562 [2019-09-10 03:13:53,361 INFO L226 Difference]: Without dead ends: 21562 [2019-09-10 03:13:53,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:13:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21562 states. [2019-09-10 03:13:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21562 to 19514. [2019-09-10 03:13:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19514 states. [2019-09-10 03:13:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19514 states to 19514 states and 74952 transitions. [2019-09-10 03:13:58,955 INFO L78 Accepts]: Start accepts. Automaton has 19514 states and 74952 transitions. Word has length 81 [2019-09-10 03:13:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:58,956 INFO L475 AbstractCegarLoop]: Abstraction has 19514 states and 74952 transitions. [2019-09-10 03:13:58,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:13:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 19514 states and 74952 transitions. [2019-09-10 03:13:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 03:13:58,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:58,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:58,990 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash -396744736, now seen corresponding path program 1 times [2019-09-10 03:13:58,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:58,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:58,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:58,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:58,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:13:59,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:59,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 03:13:59,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:59,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:13:59,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:13:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:13:59,156 INFO L87 Difference]: Start difference. First operand 19514 states and 74952 transitions. Second operand 8 states. [2019-09-10 03:14:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:14:03,178 INFO L93 Difference]: Finished difference Result 37763 states and 185922 transitions. [2019-09-10 03:14:03,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:14:03,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-09-10 03:14:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:14:03,564 INFO L225 Difference]: With dead ends: 37763 [2019-09-10 03:14:03,565 INFO L226 Difference]: Without dead ends: 37763 [2019-09-10 03:14:03,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:14:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37763 states. [2019-09-10 03:14:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37763 to 31400. [2019-09-10 03:14:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31400 states. [2019-09-10 03:14:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31400 states to 31400 states and 146820 transitions. [2019-09-10 03:14:18,968 INFO L78 Accepts]: Start accepts. Automaton has 31400 states and 146820 transitions. Word has length 86 [2019-09-10 03:14:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:14:18,968 INFO L475 AbstractCegarLoop]: Abstraction has 31400 states and 146820 transitions. [2019-09-10 03:14:18,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:14:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 31400 states and 146820 transitions. [2019-09-10 03:14:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:14:18,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:14:18,986 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:14:18,986 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:14:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:14:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1124105256, now seen corresponding path program 1 times [2019-09-10 03:14:18,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:14:18,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:18,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:14:18,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:18,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:14:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:14:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:14:19,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:14:19,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:14:19,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 92 with the following transitions: [2019-09-10 03:14:19,063 INFO L207 CegarAbsIntRunner]: [0], [5], [10], [15], [20], [21], [22], [31], [35], [46], [49], [59], [62], [68], [74], [77], [79], [82], [111], [120], [124], [128], [137], [141], [143], [145], [147], [151], [160], [166], [174], [177], [180], [257], [269], [271], [280], [284], [288], [897], [898], [901], [907], [921], [933], [945], [957], [969], [981], [993], [1005], [1014], [1016], [1133], [1156], [1159], [1162], [1183], [1192], [1198], [1206], [1217], [1229], [1233], [1238], [1253], [1265], [1277], [1289], [1301], [1303], [1306], [1442], [1444], [1445], [1446], [1454], [1456], [1457], [1458], [1460], [1464] [2019-09-10 03:14:19,114 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:14:19,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:14:19,309 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:14:19,311 INFO L272 AbstractInterpreter]: Visited 42 different actions 42 times. Never merged. Never widened. Performed 358 root evaluator evaluations with a maximum evaluation depth of 3. Performed 358 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 100 variables. [2019-09-10 03:14:19,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:14:19,315 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:14:19,511 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 88.94% of their original sizes. [2019-09-10 03:14:19,511 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:14:19,654 INFO L420 sIntCurrentIteration]: We unified 90 AI predicates to 90 [2019-09-10 03:14:19,654 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:14:19,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:14:19,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2019-09-10 03:14:19,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:14:19,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 03:14:19,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 03:14:19,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:14:19,657 INFO L87 Difference]: Start difference. First operand 31400 states and 146820 transitions. Second operand 17 states. [2019-09-10 03:14:28,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:14:28,154 INFO L93 Difference]: Finished difference Result 31413 states and 146788 transitions. [2019-09-10 03:14:28,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:14:28,154 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2019-09-10 03:14:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:14:28,458 INFO L225 Difference]: With dead ends: 31413 [2019-09-10 03:14:28,458 INFO L226 Difference]: Without dead ends: 31413 [2019-09-10 03:14:28,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-09-10 03:14:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31413 states. [2019-09-10 03:14:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31413 to 31404. [2019-09-10 03:14:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31404 states. [2019-09-10 03:14:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31404 states to 31404 states and 146757 transitions. [2019-09-10 03:14:38,955 INFO L78 Accepts]: Start accepts. Automaton has 31404 states and 146757 transitions. Word has length 91 [2019-09-10 03:14:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:14:38,955 INFO L475 AbstractCegarLoop]: Abstraction has 31404 states and 146757 transitions. [2019-09-10 03:14:38,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 03:14:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 31404 states and 146757 transitions. [2019-09-10 03:14:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 03:14:38,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:14:38,971 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:14:38,972 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:14:38,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:14:38,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1667026861, now seen corresponding path program 1 times [2019-09-10 03:14:38,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:14:38,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:38,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:14:38,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:38,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:14:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:14:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:14:39,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:14:39,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:14:39,057 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 03:14:39,057 INFO L207 CegarAbsIntRunner]: [0], [5], [10], [15], [20], [21], [22], [31], [35], [46], [49], [52], [59], [62], [68], [74], [77], [79], [82], [111], [120], [124], [128], [137], [141], [143], [145], [147], [151], [160], [166], [174], [177], [180], [257], [269], [271], [280], [284], [288], [897], [898], [901], [907], [921], [933], [945], [957], [969], [981], [993], [1005], [1014], [1016], [1133], [1156], [1159], [1162], [1183], [1192], [1196], [1198], [1200], [1206], [1217], [1229], [1233], [1238], [1253], [1265], [1277], [1289], [1301], [1303], [1306], [1441], [1442], [1444], [1445], [1446], [1447], [1454], [1456], [1457], [1458], [1460], [1464] [2019-09-10 03:14:39,061 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:14:39,061 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:14:39,133 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:14:39,134 INFO L272 AbstractInterpreter]: Visited 56 different actions 90 times. Merged at 8 different actions 8 times. Never widened. Performed 702 root evaluator evaluations with a maximum evaluation depth of 4. Performed 702 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 100 variables. [2019-09-10 03:14:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:14:39,135 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:14:39,303 INFO L227 lantSequenceWeakener]: Weakened 71 states. On average, predicates are now at 88.43% of their original sizes. [2019-09-10 03:14:39,304 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:14:39,738 INFO L420 sIntCurrentIteration]: We unified 105 AI predicates to 105 [2019-09-10 03:14:39,738 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:14:39,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:14:39,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [8] total 33 [2019-09-10 03:14:39,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:14:39,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 03:14:39,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 03:14:39,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:14:39,740 INFO L87 Difference]: Start difference. First operand 31404 states and 146757 transitions. Second operand 27 states. [2019-09-10 03:14:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:14:49,417 INFO L93 Difference]: Finished difference Result 27302 states and 92719 transitions. [2019-09-10 03:14:49,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:14:49,417 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 106 [2019-09-10 03:14:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:14:49,782 INFO L225 Difference]: With dead ends: 27302 [2019-09-10 03:14:49,782 INFO L226 Difference]: Without dead ends: 27302 [2019-09-10 03:14:49,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=1244, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 03:14:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27302 states. [2019-09-10 03:14:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27302 to 27291. [2019-09-10 03:14:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27291 states. [2019-09-10 03:14:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27291 states to 27291 states and 92707 transitions. [2019-09-10 03:14:59,918 INFO L78 Accepts]: Start accepts. Automaton has 27291 states and 92707 transitions. Word has length 106 [2019-09-10 03:14:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:14:59,918 INFO L475 AbstractCegarLoop]: Abstraction has 27291 states and 92707 transitions. [2019-09-10 03:14:59,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 03:14:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 27291 states and 92707 transitions. [2019-09-10 03:14:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 03:14:59,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:14:59,947 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:14:59,949 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:14:59,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:14:59,950 INFO L82 PathProgramCache]: Analyzing trace with hash 782730595, now seen corresponding path program 1 times [2019-09-10 03:14:59,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:14:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:59,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:14:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:59,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:14:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:15:00,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:15:00,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:15:00,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2019-09-10 03:15:00,063 INFO L207 CegarAbsIntRunner]: [20], [21], [22], [31], [35], [46], [49], [59], [62], [68], [74], [77], [79], [84], [89], [92], [111], [120], [124], [128], [137], [143], [151], [160], [166], [174], [185], [197], [201], [206], [209], [221], [233], [245], [257], [269], [271], [280], [284], [286], [288], [290], [294], [305], [317], [321], [326], [341], [353], [365], [377], [389], [391], [397], [399], [410], [422], [426], [431], [446], [458], [470], [482], [494], [496], [897], [898], [901], [907], [921], [933], [945], [957], [969], [981], [993], [1005], [1014], [1016], [1133], [1137], [1142], [1147], [1152], [1156], [1159], [1162], [1183], [1192], [1198], [1206], [1217], [1229], [1233], [1238], [1253], [1265], [1277], [1289], [1301], [1303], [1310], [1313], [1444], [1445], [1446], [1454], [1456], [1457], [1458], [1460], [1462], [1466] [2019-09-10 03:15:00,072 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:15:00,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:15:00,135 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:15:00,135 INFO L272 AbstractInterpreter]: Visited 81 different actions 81 times. Never merged. Never widened. Performed 549 root evaluator evaluations with a maximum evaluation depth of 3. Performed 549 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 100 variables. [2019-09-10 03:15:00,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:00,136 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:15:00,347 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 88% of their original sizes. [2019-09-10 03:15:00,347 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:15:00,927 INFO L420 sIntCurrentIteration]: We unified 141 AI predicates to 141 [2019-09-10 03:15:00,928 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:15:00,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:15:00,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [7] total 43 [2019-09-10 03:15:00,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:00,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 03:15:00,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 03:15:00,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1264, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 03:15:00,930 INFO L87 Difference]: Start difference. First operand 27291 states and 92707 transitions. Second operand 38 states. [2019-09-10 03:15:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:12,369 INFO L93 Difference]: Finished difference Result 50184 states and 219552 transitions. [2019-09-10 03:15:12,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 03:15:12,369 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 142 [2019-09-10 03:15:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:12,872 INFO L225 Difference]: With dead ends: 50184 [2019-09-10 03:15:12,872 INFO L226 Difference]: Without dead ends: 50184 [2019-09-10 03:15:12,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=2792, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 03:15:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50184 states. [2019-09-10 03:15:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50184 to 49401. [2019-09-10 03:15:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49401 states. [2019-09-10 03:15:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49401 states to 49401 states and 218770 transitions. [2019-09-10 03:15:34,297 INFO L78 Accepts]: Start accepts. Automaton has 49401 states and 218770 transitions. Word has length 142 [2019-09-10 03:15:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:34,298 INFO L475 AbstractCegarLoop]: Abstraction has 49401 states and 218770 transitions. [2019-09-10 03:15:34,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 03:15:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 49401 states and 218770 transitions. [2019-09-10 03:15:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 03:15:34,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:34,320 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:15:34,320 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:34,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:34,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1805613634, now seen corresponding path program 1 times [2019-09-10 03:15:34,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:34,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:34,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 03:15:34,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:15:34,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:15:34,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-09-10 03:15:34,397 INFO L207 CegarAbsIntRunner]: [20], [21], [22], [31], [35], [46], [49], [52], [59], [62], [68], [74], [77], [79], [84], [89], [92], [111], [120], [124], [128], [137], [143], [151], [160], [166], [174], [185], [197], [201], [206], [209], [221], [233], [245], [257], [269], [271], [280], [284], [286], [288], [290], [294], [305], [317], [321], [326], [341], [353], [365], [377], [389], [391], [397], [399], [410], [422], [426], [431], [446], [458], [470], [482], [494], [496], [897], [898], [901], [907], [921], [933], [945], [957], [969], [981], [993], [1005], [1014], [1016], [1133], [1137], [1142], [1147], [1152], [1156], [1159], [1162], [1183], [1192], [1196], [1198], [1200], [1206], [1217], [1229], [1233], [1238], [1253], [1265], [1277], [1289], [1301], [1303], [1310], [1313], [1441], [1444], [1445], [1446], [1447], [1454], [1456], [1457], [1458], [1460], [1462], [1466] [2019-09-10 03:15:34,398 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:15:34,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:15:34,486 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:15:34,486 INFO L272 AbstractInterpreter]: Visited 90 different actions 181 times. Merged at 15 different actions 19 times. Never widened. Performed 1226 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 5 different actions. Largest state had 100 variables. [2019-09-10 03:15:34,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:34,487 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:15:34,690 INFO L227 lantSequenceWeakener]: Weakened 106 states. On average, predicates are now at 87.02% of their original sizes. [2019-09-10 03:15:34,690 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:15:38,525 INFO L420 sIntCurrentIteration]: We unified 156 AI predicates to 156 [2019-09-10 03:15:38,525 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:15:38,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:15:38,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [4] total 67 [2019-09-10 03:15:38,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:38,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 03:15:38,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 03:15:38,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=3742, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 03:15:38,528 INFO L87 Difference]: Start difference. First operand 49401 states and 218770 transitions. Second operand 65 states. [2019-09-10 03:16:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:16:44,629 INFO L93 Difference]: Finished difference Result 29248 states and 95681 transitions. [2019-09-10 03:16:44,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-10 03:16:44,629 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 157 [2019-09-10 03:16:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:16:44,836 INFO L225 Difference]: With dead ends: 29248 [2019-09-10 03:16:44,837 INFO L226 Difference]: Without dead ends: 28381 [2019-09-10 03:16:44,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14755 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=4217, Invalid=36789, Unknown=0, NotChecked=0, Total=41006 [2019-09-10 03:16:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28381 states. [2019-09-10 03:16:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28381 to 27739. [2019-09-10 03:16:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27739 states. [2019-09-10 03:16:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27739 states to 27739 states and 93872 transitions. [2019-09-10 03:16:50,421 INFO L78 Accepts]: Start accepts. Automaton has 27739 states and 93872 transitions. Word has length 157 [2019-09-10 03:16:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:16:50,421 INFO L475 AbstractCegarLoop]: Abstraction has 27739 states and 93872 transitions. [2019-09-10 03:16:50,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 03:16:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 27739 states and 93872 transitions. [2019-09-10 03:16:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 03:16:50,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:16:50,434 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:16:50,435 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:16:50,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:50,437 INFO L82 PathProgramCache]: Analyzing trace with hash -189629062, now seen corresponding path program 1 times [2019-09-10 03:16:50,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:16:50,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:50,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:16:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:50,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:16:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:16:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 55 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:16:50,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:16:50,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:16:50,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2019-09-10 03:16:50,561 INFO L207 CegarAbsIntRunner]: [20], [21], [22], [31], [35], [46], [49], [59], [62], [74], [77], [79], [84], [89], [92], [111], [120], [124], [128], [137], [143], [151], [160], [166], [174], [185], [197], [201], [206], [209], [221], [233], [245], [257], [269], [271], [280], [284], [286], [288], [290], [294], [305], [317], [321], [326], [341], [353], [365], [369], [372], [391], [397], [399], [410], [422], [426], [431], [446], [458], [470], [482], [494], [496], [897], [898], [901], [907], [921], [933], [945], [957], [969], [981], [993], [1005], [1014], [1016], [1133], [1137], [1140], [1142], [1147], [1152], [1155], [1156], [1159], [1162], [1183], [1192], [1196], [1198], [1200], [1206], [1217], [1229], [1233], [1238], [1253], [1265], [1277], [1289], [1301], [1303], [1310], [1313], [1315], [1326], [1332], [1340], [1351], [1363], [1367], [1370], [1423], [1435], [1437], [1441], [1444], [1445], [1446], [1447], [1454], [1456], [1457], [1458], [1460], [1462], [1466], [1467] [2019-09-10 03:16:50,563 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:16:50,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:16:50,638 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:16:50,639 INFO L272 AbstractInterpreter]: Visited 112 different actions 211 times. Merged at 23 different actions 28 times. Never widened. Performed 1014 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1014 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 5 different actions. Largest state had 100 variables. [2019-09-10 03:16:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:50,639 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:16:50,810 INFO L227 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 86.49% of their original sizes. [2019-09-10 03:16:50,810 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:16:54,117 INFO L420 sIntCurrentIteration]: We unified 183 AI predicates to 183 [2019-09-10 03:16:54,117 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:16:54,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:16:54,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [75] imperfect sequences [8] total 81 [2019-09-10 03:16:54,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:16:54,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-10 03:16:54,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-10 03:16:54,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=5234, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 03:16:54,120 INFO L87 Difference]: Start difference. First operand 27739 states and 93872 transitions. Second operand 75 states. [2019-09-10 03:18:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:19,053 INFO L93 Difference]: Finished difference Result 30162 states and 100568 transitions. [2019-09-10 03:18:19,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-10 03:18:19,053 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 184 [2019-09-10 03:18:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:19,215 INFO L225 Difference]: With dead ends: 30162 [2019-09-10 03:18:19,215 INFO L226 Difference]: Without dead ends: 29734 [2019-09-10 03:18:19,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6845 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1638, Invalid=21924, Unknown=0, NotChecked=0, Total=23562 [2019-09-10 03:18:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29734 states. [2019-09-10 03:18:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29734 to 28859. [2019-09-10 03:18:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28859 states. [2019-09-10 03:18:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28859 states to 28859 states and 98861 transitions. [2019-09-10 03:18:24,663 INFO L78 Accepts]: Start accepts. Automaton has 28859 states and 98861 transitions. Word has length 184 [2019-09-10 03:18:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:24,664 INFO L475 AbstractCegarLoop]: Abstraction has 28859 states and 98861 transitions. [2019-09-10 03:18:24,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-10 03:18:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 28859 states and 98861 transitions. [2019-09-10 03:18:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 03:18:24,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:24,672 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:24,672 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash -538548847, now seen corresponding path program 1 times [2019-09-10 03:18:24,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:24,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:24,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:24,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:24,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:18:24,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:24,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:18:24,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:24,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:18:24,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:18:24,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:18:24,765 INFO L87 Difference]: Start difference. First operand 28859 states and 98861 transitions. Second operand 4 states. [2019-09-10 03:18:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:25,625 INFO L93 Difference]: Finished difference Result 28570 states and 93203 transitions. [2019-09-10 03:18:25,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:18:25,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-10 03:18:25,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:25,784 INFO L225 Difference]: With dead ends: 28570 [2019-09-10 03:18:25,784 INFO L226 Difference]: Without dead ends: 28570 [2019-09-10 03:18:25,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:18:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28570 states. [2019-09-10 03:18:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28570 to 28395. [2019-09-10 03:18:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28395 states. [2019-09-10 03:18:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28395 states to 28395 states and 93029 transitions. [2019-09-10 03:18:31,105 INFO L78 Accepts]: Start accepts. Automaton has 28395 states and 93029 transitions. Word has length 184 [2019-09-10 03:18:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:31,105 INFO L475 AbstractCegarLoop]: Abstraction has 28395 states and 93029 transitions. [2019-09-10 03:18:31,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:18:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 28395 states and 93029 transitions. [2019-09-10 03:18:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 03:18:31,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:31,111 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 03:18:31,111 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:31,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:31,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1345623952, now seen corresponding path program 1 times [2019-09-10 03:18:31,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:31,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:31,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:31,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:31,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 03:18:31,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:18:31,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:18:31,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:18:31,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:18:31,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:18:31,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:18:31,688 INFO L87 Difference]: Start difference. First operand 28395 states and 93029 transitions. Second operand 3 states. [2019-09-10 03:18:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:32,685 INFO L93 Difference]: Finished difference Result 34064 states and 152304 transitions. [2019-09-10 03:18:32,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:18:32,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-10 03:18:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:32,923 INFO L225 Difference]: With dead ends: 34064 [2019-09-10 03:18:32,924 INFO L226 Difference]: Without dead ends: 34064 [2019-09-10 03:18:32,924 INFO L628 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-09-10 03:18:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34064 states. [2019-09-10 03:18:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34064 to 32449. [2019-09-10 03:18:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32449 states. [2019-09-10 03:18:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32449 states to 32449 states and 150076 transitions. [2019-09-10 03:18:54,211 INFO L78 Accepts]: Start accepts. Automaton has 32449 states and 150076 transitions. Word has length 184 [2019-09-10 03:18:54,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:54,212 INFO L475 AbstractCegarLoop]: Abstraction has 32449 states and 150076 transitions. [2019-09-10 03:18:54,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:18:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 32449 states and 150076 transitions. [2019-09-10 03:18:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 03:18:54,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:54,218 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 03:18:54,219 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:54,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:54,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1839342716, now seen corresponding path program 1 times [2019-09-10 03:18:54,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:54,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:54,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:54,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:54,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 03:18:54,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:54,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:18:54,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2019-09-10 03:18:54,340 INFO L207 CegarAbsIntRunner]: [20], [21], [22], [31], [35], [46], [49], [59], [62], [74], [77], [79], [84], [89], [92], [111], [120], [124], [128], [137], [143], [151], [160], [166], [174], [185], [197], [201], [206], [209], [221], [233], [245], [249], [252], [257], [269], [271], [280], [284], [286], [288], [290], [294], [305], [317], [321], [326], [341], [353], [365], [369], [374], [389], [391], [397], [399], [410], [422], [426], [431], [446], [458], [470], [474], [479], [494], [496], [897], [898], [901], [907], [921], [933], [945], [957], [969], [981], [993], [1005], [1014], [1016], [1133], [1137], [1140], [1142], [1147], [1152], [1155], [1156], [1159], [1162], [1164], [1169], [1172], [1183], [1192], [1196], [1198], [1200], [1202], [1206], [1217], [1229], [1233], [1238], [1253], [1265], [1277], [1281], [1284], [1289], [1301], [1303], [1310], [1313], [1315], [1326], [1332], [1340], [1351], [1363], [1367], [1370], [1423], [1435], [1437], [1441], [1444], [1445], [1446], [1447], [1454], [1456], [1457], [1458], [1460], [1462], [1466], [1467] [2019-09-10 03:18:54,342 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:18:54,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:18:54,783 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:18:54,784 INFO L272 AbstractInterpreter]: Visited 138 different actions 1494 times. Merged at 92 different actions 773 times. Widened at 1 different actions 1 times. Performed 6314 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6314 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 75 fixpoints after 21 different actions. Largest state had 100 variables. [2019-09-10 03:18:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:54,784 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:18:54,964 INFO L227 lantSequenceWeakener]: Weakened 74 states. On average, predicates are now at 86.88% of their original sizes. [2019-09-10 03:18:54,964 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:19:12,686 INFO L420 sIntCurrentIteration]: We unified 187 AI predicates to 187 [2019-09-10 03:19:12,686 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:19:12,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:19:12,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [89] imperfect sequences [6] total 93 [2019-09-10 03:19:12,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:19:12,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-10 03:19:12,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-10 03:19:12,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=7313, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 03:19:12,688 INFO L87 Difference]: Start difference. First operand 32449 states and 150076 transitions. Second operand 89 states. [2019-09-10 03:21:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:03,919 INFO L93 Difference]: Finished difference Result 35475 states and 157038 transitions. [2019-09-10 03:21:03,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 03:21:03,919 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 188 [2019-09-10 03:21:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:04,134 INFO L225 Difference]: With dead ends: 35475 [2019-09-10 03:21:04,134 INFO L226 Difference]: Without dead ends: 35137 [2019-09-10 03:21:04,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6897 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=1420, Invalid=20042, Unknown=0, NotChecked=0, Total=21462 [2019-09-10 03:21:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35137 states. [2019-09-10 03:21:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35137 to 33647. [2019-09-10 03:21:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33647 states. [2019-09-10 03:21:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33647 states to 33647 states and 154810 transitions. [2019-09-10 03:21:20,508 INFO L78 Accepts]: Start accepts. Automaton has 33647 states and 154810 transitions. Word has length 188 [2019-09-10 03:21:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:20,509 INFO L475 AbstractCegarLoop]: Abstraction has 33647 states and 154810 transitions. [2019-09-10 03:21:20,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-10 03:21:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33647 states and 154810 transitions. [2019-09-10 03:21:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 03:21:20,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:20,516 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 03:21:20,516 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:20,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1291886439, now seen corresponding path program 1 times [2019-09-10 03:21:20,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:20,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:20,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:20,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:20,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 03:21:20,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:21:20,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:21:20,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:20,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:21:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:21:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:21:20,610 INFO L87 Difference]: Start difference. First operand 33647 states and 154810 transitions. Second operand 3 states. [2019-09-10 03:21:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:21:21,709 INFO L93 Difference]: Finished difference Result 33688 states and 150653 transitions. [2019-09-10 03:21:21,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:21:21,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-09-10 03:21:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:21:21,945 INFO L225 Difference]: With dead ends: 33688 [2019-09-10 03:21:21,945 INFO L226 Difference]: Without dead ends: 33688 [2019-09-10 03:21:21,946 INFO L628 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-09-10 03:21:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33688 states. [2019-09-10 03:21:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33688 to 33641. [2019-09-10 03:21:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33641 states. [2019-09-10 03:21:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33641 states to 33641 states and 150598 transitions. [2019-09-10 03:21:41,430 INFO L78 Accepts]: Start accepts. Automaton has 33641 states and 150598 transitions. Word has length 189 [2019-09-10 03:21:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:21:41,430 INFO L475 AbstractCegarLoop]: Abstraction has 33641 states and 150598 transitions. [2019-09-10 03:21:41,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:21:41,430 INFO L276 IsEmpty]: Start isEmpty. Operand 33641 states and 150598 transitions. [2019-09-10 03:21:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 03:21:41,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:21:41,437 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 03:21:41,437 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:21:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1794389811, now seen corresponding path program 1 times [2019-09-10 03:21:41,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:21:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:41,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:21:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:21:41,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:21:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:21:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 03:21:41,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:21:41,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:21:41,544 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2019-09-10 03:21:41,545 INFO L207 CegarAbsIntRunner]: [0], [5], [10], [15], [20], [21], [22], [31], [35], [46], [49], [59], [62], [74], [77], [79], [84], [89], [92], [111], [120], [124], [126], [128], [137], [143], [151], [160], [166], [174], [185], [197], [209], [221], [233], [245], [257], [269], [271], [280], [284], [286], [288], [290], [294], [305], [317], [321], [326], [341], [353], [365], [369], [374], [389], [391], [397], [399], [410], [422], [426], [431], [446], [458], [470], [474], [479], [494], [496], [500], [509], [513], [517], [526], [532], [540], [549], [555], [563], [574], [586], [590], [595], [610], [622], [634], [638], [641], [660], [669], [673], [677], [897], [898], [901], [907], [921], [933], [945], [957], [969], [981], [993], [1005], [1014], [1016], [1133], [1137], [1140], [1155], [1156], [1159], [1162], [1164], [1169], [1172], [1183], [1192], [1196], [1198], [1200], [1202], [1206], [1217], [1229], [1233], [1238], [1241], [1253], [1265], [1269], [1274], [1277], [1281], [1284], [1289], [1301], [1303], [1306], [1310], [1313], [1315], [1326], [1332], [1340], [1351], [1363], [1367], [1370], [1423], [1435], [1437], [1441], [1442], [1444], [1445], [1446], [1447], [1454], [1456], [1457], [1458], [1460], [1464], [1466], [1467] [2019-09-10 03:21:41,547 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:21:41,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:21:41,621 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:21:41,621 INFO L272 AbstractInterpreter]: Visited 138 different actions 284 times. Merged at 47 different actions 63 times. Never widened. Performed 1206 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1206 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 9 different actions. Largest state had 100 variables. [2019-09-10 03:21:41,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:21:41,621 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:21:41,724 INFO L227 lantSequenceWeakener]: Weakened 160 states. On average, predicates are now at 84.79% of their original sizes. [2019-09-10 03:21:41,724 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:21:45,258 INFO L420 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2019-09-10 03:21:45,259 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:21:45,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:21:45,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [77] imperfect sequences [6] total 81 [2019-09-10 03:21:45,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:21:45,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 03:21:45,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 03:21:45,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=5530, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 03:21:45,261 INFO L87 Difference]: Start difference. First operand 33641 states and 150598 transitions. Second operand 77 states. [2019-09-10 03:22:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:21,797 INFO L93 Difference]: Finished difference Result 33656 states and 149085 transitions. [2019-09-10 03:22:21,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 03:22:21,798 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 190 [2019-09-10 03:22:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:22,021 INFO L225 Difference]: With dead ends: 33656 [2019-09-10 03:22:22,021 INFO L226 Difference]: Without dead ends: 33656 [2019-09-10 03:22:22,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3827 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=967, Invalid=13075, Unknown=0, NotChecked=0, Total=14042 [2019-09-10 03:22:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33656 states. [2019-09-10 03:22:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33656 to 33318. [2019-09-10 03:22:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33318 states. [2019-09-10 03:22:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33318 states to 33318 states and 148747 transitions. [2019-09-10 03:22:41,706 INFO L78 Accepts]: Start accepts. Automaton has 33318 states and 148747 transitions. Word has length 190 [2019-09-10 03:22:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:41,706 INFO L475 AbstractCegarLoop]: Abstraction has 33318 states and 148747 transitions. [2019-09-10 03:22:41,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 03:22:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 33318 states and 148747 transitions. [2019-09-10 03:22:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:22:41,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:41,716 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:22:41,716 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash 771074215, now seen corresponding path program 1 times [2019-09-10 03:22:41,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:41,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:41,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:41,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 59 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:22:42,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:22:42,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:22:42,271 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2019-09-10 03:22:42,272 INFO L207 CegarAbsIntRunner]: [20], [21], [22], [31], [35], [46], [49], [52], [59], [62], [74], [77], [79], [84], [89], [92], [111], [120], [124], [128], [137], [143], [151], [160], [166], [174], [185], [197], [201], [206], [209], [221], [233], [245], [249], [252], [271], [280], [284], [286], [288], [290], [294], [305], [317], [321], [326], [341], [353], [365], [369], [372], [391], [397], [399], [410], [422], [426], [431], [446], [458], [470], [474], [477], [496], [897], [898], [901], [907], [921], [933], [945], [957], [969], [981], [993], [1005], [1014], [1016], [1133], [1137], [1140], [1142], [1147], [1152], [1155], [1156], [1159], [1162], [1164], [1169], [1172], [1183], [1192], [1196], [1198], [1200], [1202], [1206], [1217], [1229], [1233], [1238], [1253], [1265], [1277], [1281], [1284], [1303], [1310], [1313], [1315], [1326], [1332], [1340], [1351], [1363], [1367], [1370], [1415], [1418], [1437], [1441], [1444], [1445], [1446], [1447], [1454], [1456], [1457], [1458], [1460], [1462], [1466], [1467] [2019-09-10 03:22:42,274 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:22:42,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:22:42,376 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:22:42,376 INFO L272 AbstractInterpreter]: Visited 87 different actions 240 times. Merged at 26 different actions 51 times. Never widened. Performed 1420 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1420 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 100 variables. [2019-09-10 03:22:42,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:42,376 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:22:42,521 INFO L227 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 86.03% of their original sizes. [2019-09-10 03:22:42,521 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:22:44,762 INFO L420 sIntCurrentIteration]: We unified 202 AI predicates to 202 [2019-09-10 03:22:44,763 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:22:44,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:22:44,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [8] total 78 [2019-09-10 03:22:44,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:44,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 03:22:44,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 03:22:44,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=4754, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 03:22:44,765 INFO L87 Difference]: Start difference. First operand 33318 states and 148747 transitions. Second operand 72 states. [2019-09-10 03:23:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:33,813 INFO L93 Difference]: Finished difference Result 36890 states and 163046 transitions. [2019-09-10 03:23:33,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-10 03:23:33,813 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 203 [2019-09-10 03:23:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:34,076 INFO L225 Difference]: With dead ends: 36890 [2019-09-10 03:23:34,077 INFO L226 Difference]: Without dead ends: 36596 [2019-09-10 03:23:34,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4805 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1191, Invalid=13571, Unknown=0, NotChecked=0, Total=14762 [2019-09-10 03:23:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36596 states. [2019-09-10 03:23:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36596 to 35529. [2019-09-10 03:23:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35529 states. [2019-09-10 03:23:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35529 states to 35529 states and 160504 transitions. [2019-09-10 03:23:53,449 INFO L78 Accepts]: Start accepts. Automaton has 35529 states and 160504 transitions. Word has length 203 [2019-09-10 03:23:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:53,449 INFO L475 AbstractCegarLoop]: Abstraction has 35529 states and 160504 transitions. [2019-09-10 03:23:53,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 03:23:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 35529 states and 160504 transitions. [2019-09-10 03:23:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 03:23:53,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:53,460 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:53,460 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash 547497871, now seen corresponding path program 1 times [2019-09-10 03:23:53,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:53,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:53,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:53,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:53,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 44 proven. 32 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 03:23:53,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:53,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:53,559 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2019-09-10 03:23:53,559 INFO L207 CegarAbsIntRunner]: [20], [21], [22], [31], [35], [46], [49], [52], [59], [62], [74], [77], [79], [84], [89], [92], [111], [120], [124], [128], [137], [143], [151], [160], [166], [174], [185], [197], [201], [206], [209], [221], [233], [245], [249], [252], [257], [269], [271], [280], [284], [286], [288], [290], [294], [305], [317], [321], [326], [341], [353], [365], [369], [374], [389], [391], [397], [399], [410], [422], [426], [431], [446], [458], [470], [474], [479], [494], [496], [897], [898], [901], [907], [921], [933], [945], [957], [969], [981], [993], [1005], [1014], [1016], [1133], [1137], [1140], [1142], [1147], [1152], [1155], [1156], [1159], [1162], [1164], [1169], [1172], [1183], [1192], [1196], [1198], [1200], [1202], [1206], [1217], [1229], [1233], [1238], [1253], [1265], [1277], [1281], [1284], [1289], [1301], [1303], [1310], [1313], [1315], [1326], [1332], [1340], [1351], [1363], [1367], [1370], [1423], [1435], [1437], [1441], [1444], [1445], [1446], [1447], [1454], [1456], [1457], [1458], [1460], [1462], [1466], [1467] [2019-09-10 03:23:53,561 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:23:53,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:23:54,057 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:23:54,057 INFO L272 AbstractInterpreter]: Visited 139 different actions 1166 times. Merged at 93 different actions 502 times. Widened at 1 different actions 1 times. Performed 5047 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5047 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 63 fixpoints after 21 different actions. Largest state had 100 variables. [2019-09-10 03:23:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:54,058 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:23:54,255 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 94.04% of their original sizes. [2019-09-10 03:23:54,255 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:24:06,971 INFO L420 sIntCurrentIteration]: We unified 204 AI predicates to 204 [2019-09-10 03:24:06,971 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:24:06,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:24:06,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [78] imperfect sequences [7] total 83 [2019-09-10 03:24:06,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:06,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 03:24:06,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 03:24:06,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5619, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 03:24:06,973 INFO L87 Difference]: Start difference. First operand 35529 states and 160504 transitions. Second operand 78 states. [2019-09-10 03:25:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:25:53,480 INFO L93 Difference]: Finished difference Result 37067 states and 162744 transitions. [2019-09-10 03:25:53,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-10 03:25:53,480 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 205 [2019-09-10 03:25:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:25:53,743 INFO L225 Difference]: With dead ends: 37067 [2019-09-10 03:25:53,743 INFO L226 Difference]: Without dead ends: 37067 [2019-09-10 03:25:53,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4270 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=695, Invalid=11515, Unknown=0, NotChecked=0, Total=12210 [2019-09-10 03:25:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37067 states.