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/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:59:17,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:59:17,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:59:17,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:59:17,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:59:17,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:59:17,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:59:17,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:59:17,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:59:17,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:59:17,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:59:17,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:59:17,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:59:17,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:59:17,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:59:17,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:59:17,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:59:17,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:59:17,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:59:17,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:59:17,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:59:17,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:59:17,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:59:17,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:59:17,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:59:17,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:59:17,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:59:17,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:59:17,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:59:17,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:59:17,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:59:17,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:59:17,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:59:17,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:59:17,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:59:17,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:59:17,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:59:17,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:59:17,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:59:17,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:59:17,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:59:17,277 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 06:59:17,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:59:17,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:59:17,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:59:17,292 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:59:17,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:59:17,293 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:59:17,293 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:59:17,293 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:59:17,293 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:59:17,294 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:59:17,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:59:17,294 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:59:17,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:59:17,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:59:17,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:59:17,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:59:17,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:59:17,296 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:59:17,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:59:17,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:59:17,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:59:17,296 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:59:17,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:59:17,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:59:17,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:59:17,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:59:17,297 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:59:17,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:59:17,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:59:17,298 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:59:17,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:59:17,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:59:17,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:59:17,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:59:17,344 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:59:17,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:59:17,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6653e1a6/4db96b754cc847d19070b0f67ec9386d/FLAGf31c3f99f [2019-09-10 06:59:17,854 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:59:17,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:59:17,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6653e1a6/4db96b754cc847d19070b0f67ec9386d/FLAGf31c3f99f [2019-09-10 06:59:18,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6653e1a6/4db96b754cc847d19070b0f67ec9386d [2019-09-10 06:59:18,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:59:18,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:59:18,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:59:18,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:59:18,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:59:18,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:59:18" (1/1) ... [2019-09-10 06:59:18,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffd4eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18, skipping insertion in model container [2019-09-10 06:59:18,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:59:18" (1/1) ... [2019-09-10 06:59:18,259 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:59:18,310 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:59:18,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:59:18,671 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:59:18,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:59:18,753 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:59:18,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18 WrapperNode [2019-09-10 06:59:18,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:59:18,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:59:18,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:59:18,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:59:18,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18" (1/1) ... [2019-09-10 06:59:18,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18" (1/1) ... [2019-09-10 06:59:18,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18" (1/1) ... [2019-09-10 06:59:18,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18" (1/1) ... [2019-09-10 06:59:18,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18" (1/1) ... [2019-09-10 06:59:18,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18" (1/1) ... [2019-09-10 06:59:18,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18" (1/1) ... [2019-09-10 06:59:18,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:59:18,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:59:18,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:59:18,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:59:18,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18" (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 06:59:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:59:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:59:18,877 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:59:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:59:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:59:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:59:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:59:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:59:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:59:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:59:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:59:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:59:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:59:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:59:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:59:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:59:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:59:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:59:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:59:19,559 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:59:19,560 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:59:19,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:59:19 BoogieIcfgContainer [2019-09-10 06:59:19,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:59:19,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:59:19,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:59:19,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:59:19,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:59:18" (1/3) ... [2019-09-10 06:59:19,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a8c248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:59:19, skipping insertion in model container [2019-09-10 06:59:19,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:59:18" (2/3) ... [2019-09-10 06:59:19,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a8c248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:59:19, skipping insertion in model container [2019-09-10 06:59:19,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:59:19" (3/3) ... [2019-09-10 06:59:19,575 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:59:19,584 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:59:19,605 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:59:19,620 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:59:19,644 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:59:19,644 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:59:19,644 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:59:19,645 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:59:19,645 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:59:19,645 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:59:19,645 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:59:19,646 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:59:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-09-10 06:59:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 06:59:19,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:19,679 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 06:59:19,681 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:19,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1173815041, now seen corresponding path program 1 times [2019-09-10 06:59:19,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:19,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:19,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:19,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:19,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:20,105 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 06:59:20,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:20,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:20,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:20,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:20,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:20,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:20,135 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-09-10 06:59:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:20,255 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2019-09-10 06:59:20,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:20,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 06:59:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:20,284 INFO L225 Difference]: With dead ends: 183 [2019-09-10 06:59:20,284 INFO L226 Difference]: Without dead ends: 175 [2019-09-10 06:59:20,288 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 06:59:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-10 06:59:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2019-09-10 06:59:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-10 06:59:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 257 transitions. [2019-09-10 06:59:20,386 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 257 transitions. Word has length 52 [2019-09-10 06:59:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:20,387 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 257 transitions. [2019-09-10 06:59:20,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 257 transitions. [2019-09-10 06:59:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 06:59:20,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:20,391 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 06:59:20,391 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:20,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:20,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1357822606, now seen corresponding path program 1 times [2019-09-10 06:59:20,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:20,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:20,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:20,585 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 06:59:20,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:20,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:20,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:20,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:20,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:20,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:20,588 INFO L87 Difference]: Start difference. First operand 173 states and 257 transitions. Second operand 3 states. [2019-09-10 06:59:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:20,619 INFO L93 Difference]: Finished difference Result 283 states and 429 transitions. [2019-09-10 06:59:20,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:20,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-10 06:59:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:20,622 INFO L225 Difference]: With dead ends: 283 [2019-09-10 06:59:20,622 INFO L226 Difference]: Without dead ends: 283 [2019-09-10 06:59:20,623 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 06:59:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-10 06:59:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2019-09-10 06:59:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-10 06:59:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 428 transitions. [2019-09-10 06:59:20,641 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 428 transitions. Word has length 53 [2019-09-10 06:59:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:20,642 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 428 transitions. [2019-09-10 06:59:20,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 428 transitions. [2019-09-10 06:59:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 06:59:20,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:20,644 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] [2019-09-10 06:59:20,644 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1224986484, now seen corresponding path program 1 times [2019-09-10 06:59:20,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:20,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:20,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:20,737 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 06:59:20,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:20,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:20,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:20,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:20,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:20,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:20,739 INFO L87 Difference]: Start difference. First operand 281 states and 428 transitions. Second operand 3 states. [2019-09-10 06:59:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:20,775 INFO L93 Difference]: Finished difference Result 467 states and 717 transitions. [2019-09-10 06:59:20,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:20,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-10 06:59:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:20,780 INFO L225 Difference]: With dead ends: 467 [2019-09-10 06:59:20,780 INFO L226 Difference]: Without dead ends: 467 [2019-09-10 06:59:20,781 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 06:59:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-10 06:59:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2019-09-10 06:59:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-10 06:59:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 716 transitions. [2019-09-10 06:59:20,810 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 716 transitions. Word has length 54 [2019-09-10 06:59:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:20,810 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 716 transitions. [2019-09-10 06:59:20,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 716 transitions. [2019-09-10 06:59:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:59:20,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:20,816 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] [2019-09-10 06:59:20,816 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:20,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:20,817 INFO L82 PathProgramCache]: Analyzing trace with hash 781354829, now seen corresponding path program 1 times [2019-09-10 06:59:20,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:20,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:20,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:20,898 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 06:59:20,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:20,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:20,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:20,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:20,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:20,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:20,901 INFO L87 Difference]: Start difference. First operand 465 states and 716 transitions. Second operand 3 states. [2019-09-10 06:59:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:20,923 INFO L93 Difference]: Finished difference Result 771 states and 1185 transitions. [2019-09-10 06:59:20,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:20,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 06:59:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:20,929 INFO L225 Difference]: With dead ends: 771 [2019-09-10 06:59:20,929 INFO L226 Difference]: Without dead ends: 771 [2019-09-10 06:59:20,930 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 06:59:20,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-09-10 06:59:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 769. [2019-09-10 06:59:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-09-10 06:59:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1184 transitions. [2019-09-10 06:59:20,955 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1184 transitions. Word has length 55 [2019-09-10 06:59:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:20,957 INFO L475 AbstractCegarLoop]: Abstraction has 769 states and 1184 transitions. [2019-09-10 06:59:20,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1184 transitions. [2019-09-10 06:59:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:59:20,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:20,965 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] [2019-09-10 06:59:20,965 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash -895952899, now seen corresponding path program 1 times [2019-09-10 06:59:20,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:21,119 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 06:59:21,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:21,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:59:21,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:21,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:59:21,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:59:21,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:21,123 INFO L87 Difference]: Start difference. First operand 769 states and 1184 transitions. Second operand 6 states. [2019-09-10 06:59:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:21,360 INFO L93 Difference]: Finished difference Result 3721 states and 5764 transitions. [2019-09-10 06:59:21,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:59:21,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:59:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:21,391 INFO L225 Difference]: With dead ends: 3721 [2019-09-10 06:59:21,391 INFO L226 Difference]: Without dead ends: 3721 [2019-09-10 06:59:21,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2019-09-10 06:59:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 1505. [2019-09-10 06:59:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2019-09-10 06:59:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2304 transitions. [2019-09-10 06:59:21,489 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2304 transitions. Word has length 56 [2019-09-10 06:59:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:21,489 INFO L475 AbstractCegarLoop]: Abstraction has 1505 states and 2304 transitions. [2019-09-10 06:59:21,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:59:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2304 transitions. [2019-09-10 06:59:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:59:21,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:21,497 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] [2019-09-10 06:59:21,498 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:21,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:21,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2023268854, now seen corresponding path program 1 times [2019-09-10 06:59:21,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:21,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:21,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:21,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:21,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:21,702 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 06:59:21,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:21,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:59:21,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:21,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:59:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:59:21,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:21,705 INFO L87 Difference]: Start difference. First operand 1505 states and 2304 transitions. Second operand 6 states. [2019-09-10 06:59:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:21,851 INFO L93 Difference]: Finished difference Result 5031 states and 7619 transitions. [2019-09-10 06:59:21,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:59:21,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:59:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:21,878 INFO L225 Difference]: With dead ends: 5031 [2019-09-10 06:59:21,878 INFO L226 Difference]: Without dead ends: 5031 [2019-09-10 06:59:21,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2019-09-10 06:59:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 5025. [2019-09-10 06:59:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-09-10 06:59:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 7616 transitions. [2019-09-10 06:59:22,018 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 7616 transitions. Word has length 57 [2019-09-10 06:59:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:22,018 INFO L475 AbstractCegarLoop]: Abstraction has 5025 states and 7616 transitions. [2019-09-10 06:59:22,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:59:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 7616 transitions. [2019-09-10 06:59:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:59:22,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:22,024 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] [2019-09-10 06:59:22,025 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:22,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:22,031 INFO L82 PathProgramCache]: Analyzing trace with hash -837113055, now seen corresponding path program 1 times [2019-09-10 06:59:22,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:22,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:22,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:22,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:22,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:22,121 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 06:59:22,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:22,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:59:22,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:22,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:59:22,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:59:22,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:59:22,124 INFO L87 Difference]: Start difference. First operand 5025 states and 7616 transitions. Second operand 5 states. [2019-09-10 06:59:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:22,453 INFO L93 Difference]: Finished difference Result 8915 states and 13425 transitions. [2019-09-10 06:59:22,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:59:22,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 06:59:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:22,496 INFO L225 Difference]: With dead ends: 8915 [2019-09-10 06:59:22,496 INFO L226 Difference]: Without dead ends: 8915 [2019-09-10 06:59:22,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:59:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8915 states. [2019-09-10 06:59:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8915 to 8913. [2019-09-10 06:59:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8913 states. [2019-09-10 06:59:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8913 states to 8913 states and 13424 transitions. [2019-09-10 06:59:22,711 INFO L78 Accepts]: Start accepts. Automaton has 8913 states and 13424 transitions. Word has length 59 [2019-09-10 06:59:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:22,712 INFO L475 AbstractCegarLoop]: Abstraction has 8913 states and 13424 transitions. [2019-09-10 06:59:22,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:59:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 8913 states and 13424 transitions. [2019-09-10 06:59:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:59:22,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:22,713 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] [2019-09-10 06:59:22,713 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:22,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:22,714 INFO L82 PathProgramCache]: Analyzing trace with hash 932858652, now seen corresponding path program 1 times [2019-09-10 06:59:22,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:22,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:22,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:22,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:22,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:22,824 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 06:59:22,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:22,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:59:22,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:22,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:59:22,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:59:22,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:59:22,826 INFO L87 Difference]: Start difference. First operand 8913 states and 13424 transitions. Second operand 5 states. [2019-09-10 06:59:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:23,003 INFO L93 Difference]: Finished difference Result 18241 states and 27040 transitions. [2019-09-10 06:59:23,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:59:23,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 06:59:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:23,068 INFO L225 Difference]: With dead ends: 18241 [2019-09-10 06:59:23,068 INFO L226 Difference]: Without dead ends: 18241 [2019-09-10 06:59:23,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18241 states. [2019-09-10 06:59:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18241 to 9361. [2019-09-10 06:59:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9361 states. [2019-09-10 06:59:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9361 states to 9361 states and 13872 transitions. [2019-09-10 06:59:23,290 INFO L78 Accepts]: Start accepts. Automaton has 9361 states and 13872 transitions. Word has length 59 [2019-09-10 06:59:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:23,290 INFO L475 AbstractCegarLoop]: Abstraction has 9361 states and 13872 transitions. [2019-09-10 06:59:23,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:59:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 9361 states and 13872 transitions. [2019-09-10 06:59:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:59:23,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:23,291 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] [2019-09-10 06:59:23,292 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1136533126, now seen corresponding path program 1 times [2019-09-10 06:59:23,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:23,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:23,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:23,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:23,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:23,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:23,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:23,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:23,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:23,356 INFO L87 Difference]: Start difference. First operand 9361 states and 13872 transitions. Second operand 3 states. [2019-09-10 06:59:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:23,408 INFO L93 Difference]: Finished difference Result 11725 states and 17239 transitions. [2019-09-10 06:59:23,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:23,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:59:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:23,431 INFO L225 Difference]: With dead ends: 11725 [2019-09-10 06:59:23,432 INFO L226 Difference]: Without dead ends: 11725 [2019-09-10 06:59:23,432 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 06:59:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11725 states. [2019-09-10 06:59:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11725 to 11723. [2019-09-10 06:59:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11723 states. [2019-09-10 06:59:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11723 states to 11723 states and 17238 transitions. [2019-09-10 06:59:23,669 INFO L78 Accepts]: Start accepts. Automaton has 11723 states and 17238 transitions. Word has length 60 [2019-09-10 06:59:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:23,669 INFO L475 AbstractCegarLoop]: Abstraction has 11723 states and 17238 transitions. [2019-09-10 06:59:23,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 11723 states and 17238 transitions. [2019-09-10 06:59:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:59:23,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:23,675 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:59:23,676 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:23,676 INFO L82 PathProgramCache]: Analyzing trace with hash 324055568, now seen corresponding path program 1 times [2019-09-10 06:59:23,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:23,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:23,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:59:23,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:23,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:59:23,794 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-09-10 06:59:23,796 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [159], [164], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [336], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 06:59:23,844 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:59:23,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:59:23,972 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:59:24,470 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:59:24,475 INFO L272 AbstractInterpreter]: Visited 74 different actions 485 times. Merged at 43 different actions 352 times. Widened at 18 different actions 60 times. Performed 1703 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1703 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 50 fixpoints after 13 different actions. Largest state had 121 variables. [2019-09-10 06:59:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:24,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:59:24,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:24,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:59:24,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:24,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:59:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:24,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 06:59:24,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:59:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:59:24,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:59:24,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:59:24,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:59:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:59:24,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:59:24,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 7 [2019-09-10 06:59:24,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:59:24,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:59:24,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:59:24,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:59:24,852 INFO L87 Difference]: Start difference. First operand 11723 states and 17238 transitions. Second operand 5 states. [2019-09-10 06:59:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:24,983 INFO L93 Difference]: Finished difference Result 21413 states and 31232 transitions. [2019-09-10 06:59:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:59:24,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 06:59:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:25,025 INFO L225 Difference]: With dead ends: 21413 [2019-09-10 06:59:25,025 INFO L226 Difference]: Without dead ends: 21413 [2019-09-10 06:59:25,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:59:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21413 states. [2019-09-10 06:59:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21413 to 20379. [2019-09-10 06:59:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20379 states. [2019-09-10 06:59:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20379 states to 20379 states and 29734 transitions. [2019-09-10 06:59:25,413 INFO L78 Accepts]: Start accepts. Automaton has 20379 states and 29734 transitions. Word has length 81 [2019-09-10 06:59:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:25,413 INFO L475 AbstractCegarLoop]: Abstraction has 20379 states and 29734 transitions. [2019-09-10 06:59:25,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:59:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 20379 states and 29734 transitions. [2019-09-10 06:59:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:59:25,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:25,420 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:59:25,420 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash 429171158, now seen corresponding path program 1 times [2019-09-10 06:59:25,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:25,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:25,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:25,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:25,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:25,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:25,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:25,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:25,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:25,501 INFO L87 Difference]: Start difference. First operand 20379 states and 29734 transitions. Second operand 3 states. [2019-09-10 06:59:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:25,724 INFO L93 Difference]: Finished difference Result 32754 states and 47091 transitions. [2019-09-10 06:59:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:25,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:59:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:25,788 INFO L225 Difference]: With dead ends: 32754 [2019-09-10 06:59:25,789 INFO L226 Difference]: Without dead ends: 32754 [2019-09-10 06:59:25,789 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 06:59:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32754 states. [2019-09-10 06:59:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32754 to 31576. [2019-09-10 06:59:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31576 states. [2019-09-10 06:59:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31576 states to 31576 states and 45526 transitions. [2019-09-10 06:59:27,052 INFO L78 Accepts]: Start accepts. Automaton has 31576 states and 45526 transitions. Word has length 82 [2019-09-10 06:59:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:27,052 INFO L475 AbstractCegarLoop]: Abstraction has 31576 states and 45526 transitions. [2019-09-10 06:59:27,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 31576 states and 45526 transitions. [2019-09-10 06:59:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:59:27,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:27,064 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:59:27,064 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1049279691, now seen corresponding path program 1 times [2019-09-10 06:59:27,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:27,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:27,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:27,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:27,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:27,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:27,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:27,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:27,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:27,133 INFO L87 Difference]: Start difference. First operand 31576 states and 45526 transitions. Second operand 3 states. [2019-09-10 06:59:27,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:27,375 INFO L93 Difference]: Finished difference Result 45612 states and 64609 transitions. [2019-09-10 06:59:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:27,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:59:27,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:27,489 INFO L225 Difference]: With dead ends: 45612 [2019-09-10 06:59:27,489 INFO L226 Difference]: Without dead ends: 45612 [2019-09-10 06:59:27,490 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 06:59:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45612 states. [2019-09-10 06:59:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45612 to 43538. [2019-09-10 06:59:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43538 states. [2019-09-10 06:59:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43538 states to 43538 states and 61892 transitions. [2019-09-10 06:59:28,268 INFO L78 Accepts]: Start accepts. Automaton has 43538 states and 61892 transitions. Word has length 82 [2019-09-10 06:59:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:28,268 INFO L475 AbstractCegarLoop]: Abstraction has 43538 states and 61892 transitions. [2019-09-10 06:59:28,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 43538 states and 61892 transitions. [2019-09-10 06:59:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:59:28,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:28,280 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:59:28,281 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:28,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1536115522, now seen corresponding path program 1 times [2019-09-10 06:59:28,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:28,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:28,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:28,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:28,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:28,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:28,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:28,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:28,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:28,342 INFO L87 Difference]: Start difference. First operand 43538 states and 61892 transitions. Second operand 3 states. [2019-09-10 06:59:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:28,499 INFO L93 Difference]: Finished difference Result 50743 states and 70816 transitions. [2019-09-10 06:59:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:28,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 06:59:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:28,587 INFO L225 Difference]: With dead ends: 50743 [2019-09-10 06:59:28,588 INFO L226 Difference]: Without dead ends: 45589 [2019-09-10 06:59:28,588 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 06:59:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45589 states. [2019-09-10 06:59:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45589 to 43759. [2019-09-10 06:59:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43759 states. [2019-09-10 06:59:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43759 states to 43759 states and 61234 transitions. [2019-09-10 06:59:29,374 INFO L78 Accepts]: Start accepts. Automaton has 43759 states and 61234 transitions. Word has length 82 [2019-09-10 06:59:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:29,375 INFO L475 AbstractCegarLoop]: Abstraction has 43759 states and 61234 transitions. [2019-09-10 06:59:29,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 43759 states and 61234 transitions. [2019-09-10 06:59:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:59:29,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:29,386 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:59:29,386 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1323355809, now seen corresponding path program 1 times [2019-09-10 06:59:29,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:29,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:29,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:29,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:29,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:29,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:29,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:59:29,485 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 06:59:29,485 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [88], [93], [95], [98], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [327], [330], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 06:59:29,489 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:59:29,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:59:29,509 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:59:29,652 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:59:29,653 INFO L272 AbstractInterpreter]: Visited 71 different actions 332 times. Merged at 37 different actions 220 times. Widened at 12 different actions 24 times. Performed 1215 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 8 different actions. Largest state had 121 variables. [2019-09-10 06:59:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:29,653 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:59:29,840 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 80.79% of their original sizes. [2019-09-10 06:59:29,840 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:59:33,360 INFO L420 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2019-09-10 06:59:33,360 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:59:33,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:59:33,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [7] total 52 [2019-09-10 06:59:33,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:33,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 06:59:33,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 06:59:33,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1914, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:59:33,363 INFO L87 Difference]: Start difference. First operand 43759 states and 61234 transitions. Second operand 47 states. [2019-09-10 07:00:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:10,023 INFO L93 Difference]: Finished difference Result 88687 states and 122453 transitions. [2019-09-10 07:00:10,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-10 07:00:10,024 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 82 [2019-09-10 07:00:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:10,139 INFO L225 Difference]: With dead ends: 88687 [2019-09-10 07:00:10,139 INFO L226 Difference]: Without dead ends: 88588 [2019-09-10 07:00:10,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12511 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=5027, Invalid=31263, Unknown=0, NotChecked=0, Total=36290 [2019-09-10 07:00:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88588 states. [2019-09-10 07:00:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88588 to 51671. [2019-09-10 07:00:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51671 states. [2019-09-10 07:00:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51671 states to 51671 states and 71597 transitions. [2019-09-10 07:00:11,142 INFO L78 Accepts]: Start accepts. Automaton has 51671 states and 71597 transitions. Word has length 82 [2019-09-10 07:00:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:11,142 INFO L475 AbstractCegarLoop]: Abstraction has 51671 states and 71597 transitions. [2019-09-10 07:00:11,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 07:00:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 51671 states and 71597 transitions. [2019-09-10 07:00:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:00:11,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:11,160 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:00:11,160 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1092382182, now seen corresponding path program 1 times [2019-09-10 07:00:11,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:11,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:11,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:11,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:11,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:00:11,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:00:11,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 07:00:11,251 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [101], [104], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [274], [277], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 07:00:11,262 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:00:11,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:00:11,286 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:00:11,408 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:00:11,409 INFO L272 AbstractInterpreter]: Visited 71 different actions 340 times. Merged at 37 different actions 226 times. Widened at 10 different actions 20 times. Performed 1260 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1260 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 8 different actions. Largest state had 121 variables. [2019-09-10 07:00:11,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:11,409 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:00:11,551 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 81.01% of their original sizes. [2019-09-10 07:00:11,551 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:00:14,122 INFO L420 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2019-09-10 07:00:14,122 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:00:14,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:00:14,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [7] total 52 [2019-09-10 07:00:14,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:14,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 07:00:14,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 07:00:14,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1919, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 07:00:14,124 INFO L87 Difference]: Start difference. First operand 51671 states and 71597 transitions. Second operand 47 states. [2019-09-10 07:01:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:30,641 INFO L93 Difference]: Finished difference Result 105786 states and 142842 transitions. [2019-09-10 07:01:30,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 389 states. [2019-09-10 07:01:30,642 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 82 [2019-09-10 07:01:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:30,758 INFO L225 Difference]: With dead ends: 105786 [2019-09-10 07:01:30,758 INFO L226 Difference]: Without dead ends: 105768 [2019-09-10 07:01:30,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71286 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=19180, Invalid=150976, Unknown=0, NotChecked=0, Total=170156 [2019-09-10 07:01:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105768 states. [2019-09-10 07:01:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105768 to 60677. [2019-09-10 07:01:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60677 states. [2019-09-10 07:01:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60677 states to 60677 states and 82819 transitions. [2019-09-10 07:01:31,819 INFO L78 Accepts]: Start accepts. Automaton has 60677 states and 82819 transitions. Word has length 82 [2019-09-10 07:01:31,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:31,819 INFO L475 AbstractCegarLoop]: Abstraction has 60677 states and 82819 transitions. [2019-09-10 07:01:31,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 07:01:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 60677 states and 82819 transitions. [2019-09-10 07:01:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:01:31,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:31,845 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:01:31,845 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:31,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:31,846 INFO L82 PathProgramCache]: Analyzing trace with hash 596777845, now seen corresponding path program 1 times [2019-09-10 07:01:31,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:31,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:31,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:31,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:31,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:31,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:01:31,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:01:31,933 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 07:01:31,934 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [117], [120], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [221], [224], [232], [235], [238], [241], [243], [245], [283], [285], [298], [306], [325], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 07:01:31,939 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:01:31,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:01:31,957 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:01:32,075 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:01:32,076 INFO L272 AbstractInterpreter]: Visited 71 different actions 359 times. Merged at 37 different actions 243 times. Widened at 13 different actions 32 times. Performed 1293 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1293 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 8 different actions. Largest state had 121 variables. [2019-09-10 07:01:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:32,076 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:01:32,146 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 81.2% of their original sizes. [2019-09-10 07:01:32,146 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:01:34,263 INFO L420 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2019-09-10 07:01:34,263 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:01:34,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:01:34,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [7] total 51 [2019-09-10 07:01:34,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:34,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 07:01:34,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 07:01:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1824, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 07:01:34,265 INFO L87 Difference]: Start difference. First operand 60677 states and 82819 transitions. Second operand 46 states. [2019-09-10 07:02:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:25,905 INFO L93 Difference]: Finished difference Result 108081 states and 146295 transitions. [2019-09-10 07:02:25,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2019-09-10 07:02:25,905 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 82 [2019-09-10 07:02:25,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:26,017 INFO L225 Difference]: With dead ends: 108081 [2019-09-10 07:02:26,017 INFO L226 Difference]: Without dead ends: 108069 [2019-09-10 07:02:26,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23094 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=8237, Invalid=50569, Unknown=0, NotChecked=0, Total=58806 [2019-09-10 07:02:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108069 states. [2019-09-10 07:02:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108069 to 66504. [2019-09-10 07:02:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66504 states. [2019-09-10 07:02:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66504 states to 66504 states and 90126 transitions. [2019-09-10 07:02:26,822 INFO L78 Accepts]: Start accepts. Automaton has 66504 states and 90126 transitions. Word has length 82 [2019-09-10 07:02:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:26,822 INFO L475 AbstractCegarLoop]: Abstraction has 66504 states and 90126 transitions. [2019-09-10 07:02:26,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 07:02:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 66504 states and 90126 transitions. [2019-09-10 07:02:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:02:26,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:26,837 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:02:26,837 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2014317374, now seen corresponding path program 1 times [2019-09-10 07:02:26,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:26,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:26,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:26,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:02:26,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:02:26,923 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 07:02:26,924 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 07:02:26,926 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:02:26,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:02:26,940 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:02:27,066 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:02:27,066 INFO L272 AbstractInterpreter]: Visited 71 different actions 393 times. Merged at 37 different actions 273 times. Widened at 11 different actions 37 times. Performed 1376 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1376 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 8 different actions. Largest state had 121 variables. [2019-09-10 07:02:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:27,067 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:02:27,204 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 81.21% of their original sizes. [2019-09-10 07:02:27,204 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:02:29,514 INFO L420 sIntCurrentIteration]: We unified 81 AI predicates to 81 [2019-09-10 07:02:29,514 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:02:29,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:02:29,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [7] total 52 [2019-09-10 07:02:29,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:29,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 07:02:29,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 07:02:29,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1913, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 07:02:29,516 INFO L87 Difference]: Start difference. First operand 66504 states and 90126 transitions. Second operand 47 states. [2019-09-10 07:03:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:16,428 INFO L93 Difference]: Finished difference Result 117344 states and 157785 transitions. [2019-09-10 07:03:16,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 343 states. [2019-09-10 07:03:16,429 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 82 [2019-09-10 07:03:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:16,534 INFO L225 Difference]: With dead ends: 117344 [2019-09-10 07:03:16,534 INFO L226 Difference]: Without dead ends: 117258 [2019-09-10 07:03:16,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56050 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=17835, Invalid=114297, Unknown=0, NotChecked=0, Total=132132 [2019-09-10 07:03:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117258 states. [2019-09-10 07:03:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117258 to 71027. [2019-09-10 07:03:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71027 states. [2019-09-10 07:03:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71027 states to 71027 states and 95802 transitions. [2019-09-10 07:03:17,533 INFO L78 Accepts]: Start accepts. Automaton has 71027 states and 95802 transitions. Word has length 82 [2019-09-10 07:03:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:17,534 INFO L475 AbstractCegarLoop]: Abstraction has 71027 states and 95802 transitions. [2019-09-10 07:03:17,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 07:03:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 71027 states and 95802 transitions. [2019-09-10 07:03:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:03:17,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:17,548 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:03:17,548 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash 845153957, now seen corresponding path program 1 times [2019-09-10 07:03:17,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:17,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:17,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:17,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:17,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:17,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:17,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:17,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:17,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:17,599 INFO L87 Difference]: Start difference. First operand 71027 states and 95802 transitions. Second operand 3 states. [2019-09-10 07:03:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:17,773 INFO L93 Difference]: Finished difference Result 94194 states and 125423 transitions. [2019-09-10 07:03:17,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:17,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:03:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:17,860 INFO L225 Difference]: With dead ends: 94194 [2019-09-10 07:03:17,860 INFO L226 Difference]: Without dead ends: 93753 [2019-09-10 07:03:17,860 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 07:03:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93753 states. [2019-09-10 07:03:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93753 to 93484. [2019-09-10 07:03:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93484 states. [2019-09-10 07:03:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93484 states to 93484 states and 124560 transitions. [2019-09-10 07:03:18,686 INFO L78 Accepts]: Start accepts. Automaton has 93484 states and 124560 transitions. Word has length 82 [2019-09-10 07:03:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:18,686 INFO L475 AbstractCegarLoop]: Abstraction has 93484 states and 124560 transitions. [2019-09-10 07:03:18,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 93484 states and 124560 transitions. [2019-09-10 07:03:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:03:18,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:18,702 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:03:18,702 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:18,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1641210552, now seen corresponding path program 1 times [2019-09-10 07:03:18,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:18,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:18,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:18,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:18,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 07:03:18,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:18,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:03:18,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:18,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:03:18,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:03:18,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:03:18,782 INFO L87 Difference]: Start difference. First operand 93484 states and 124560 transitions. Second operand 6 states. [2019-09-10 07:03:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:19,247 INFO L93 Difference]: Finished difference Result 152636 states and 207072 transitions. [2019-09-10 07:03:19,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:03:19,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:03:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:19,461 INFO L225 Difference]: With dead ends: 152636 [2019-09-10 07:03:19,461 INFO L226 Difference]: Without dead ends: 152303 [2019-09-10 07:03:19,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:03:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152303 states. [2019-09-10 07:03:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152303 to 119696. [2019-09-10 07:03:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119696 states. [2019-09-10 07:03:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119696 states to 119696 states and 160516 transitions. [2019-09-10 07:03:22,907 INFO L78 Accepts]: Start accepts. Automaton has 119696 states and 160516 transitions. Word has length 84 [2019-09-10 07:03:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:22,907 INFO L475 AbstractCegarLoop]: Abstraction has 119696 states and 160516 transitions. [2019-09-10 07:03:22,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:03:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 119696 states and 160516 transitions. [2019-09-10 07:03:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:03:22,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:22,923 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:03:22,923 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:22,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash -747025901, now seen corresponding path program 1 times [2019-09-10 07:03:22,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:22,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:22,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:22,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:22,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:23,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:23,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:03:23,013 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 07:03:23,014 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [88], [93], [95], [98], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [230], [232], [245], [253], [272], [283], [285], [288], [291], [294], [296], [298], [327], [330], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 07:03:23,020 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:03:23,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:03:23,032 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:03:23,172 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:03:23,173 INFO L272 AbstractInterpreter]: Visited 73 different actions 387 times. Merged at 39 different actions 266 times. Widened at 15 different actions 40 times. Performed 1414 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1414 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 11 different actions. Largest state had 122 variables. [2019-09-10 07:03:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:23,173 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:03:23,283 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.22% of their original sizes. [2019-09-10 07:03:23,283 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:03:25,664 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 07:03:25,664 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:03:25,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:03:25,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [7] total 54 [2019-09-10 07:03:25,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:25,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 07:03:25,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 07:03:25,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2085, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:03:25,666 INFO L87 Difference]: Start difference. First operand 119696 states and 160516 transitions. Second operand 49 states. [2019-09-10 07:04:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:11,666 INFO L93 Difference]: Finished difference Result 195150 states and 261680 transitions. [2019-09-10 07:04:11,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2019-09-10 07:04:11,666 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 84 [2019-09-10 07:04:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:11,862 INFO L225 Difference]: With dead ends: 195150 [2019-09-10 07:04:11,862 INFO L226 Difference]: Without dead ends: 195141 [2019-09-10 07:04:11,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21250 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=7587, Invalid=49295, Unknown=0, NotChecked=0, Total=56882 [2019-09-10 07:04:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195141 states. [2019-09-10 07:04:13,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195141 to 122807. [2019-09-10 07:04:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122807 states. [2019-09-10 07:04:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122807 states to 122807 states and 164509 transitions. [2019-09-10 07:04:13,829 INFO L78 Accepts]: Start accepts. Automaton has 122807 states and 164509 transitions. Word has length 84 [2019-09-10 07:04:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:13,830 INFO L475 AbstractCegarLoop]: Abstraction has 122807 states and 164509 transitions. [2019-09-10 07:04:13,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 07:04:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 122807 states and 164509 transitions. [2019-09-10 07:04:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:04:13,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:13,842 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:04:13,842 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:13,843 INFO L82 PathProgramCache]: Analyzing trace with hash 47949475, now seen corresponding path program 1 times [2019-09-10 07:04:13,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:13,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:13,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:13,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:13,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:04:13,930 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 07:04:13,931 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [117], [120], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [221], [224], [232], [235], [238], [241], [243], [245], [283], [285], [298], [306], [325], [336], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 07:04:13,934 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:04:13,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:04:13,945 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:04:14,082 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:04:14,083 INFO L272 AbstractInterpreter]: Visited 73 different actions 421 times. Merged at 39 different actions 297 times. Widened at 17 different actions 55 times. Performed 1505 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1505 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 122 variables. [2019-09-10 07:04:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:14,084 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:04:14,166 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.6% of their original sizes. [2019-09-10 07:04:14,166 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:04:16,348 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 07:04:16,348 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:04:16,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:04:16,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [7] total 52 [2019-09-10 07:04:16,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:16,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 07:04:16,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 07:04:16,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1909, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 07:04:16,350 INFO L87 Difference]: Start difference. First operand 122807 states and 164509 transitions. Second operand 47 states. [2019-09-10 07:05:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:32,016 INFO L93 Difference]: Finished difference Result 242079 states and 318891 transitions. [2019-09-10 07:05:32,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 370 states. [2019-09-10 07:05:32,016 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 84 [2019-09-10 07:05:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:32,236 INFO L225 Difference]: With dead ends: 242079 [2019-09-10 07:05:32,236 INFO L226 Difference]: Without dead ends: 242079 [2019-09-10 07:05:32,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67382 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=17049, Invalid=136223, Unknown=0, NotChecked=0, Total=153272 [2019-09-10 07:05:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242079 states. [2019-09-10 07:05:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242079 to 147211. [2019-09-10 07:05:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147211 states. [2019-09-10 07:05:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147211 states to 147211 states and 194773 transitions. [2019-09-10 07:05:34,182 INFO L78 Accepts]: Start accepts. Automaton has 147211 states and 194773 transitions. Word has length 84 [2019-09-10 07:05:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:34,182 INFO L475 AbstractCegarLoop]: Abstraction has 147211 states and 194773 transitions. [2019-09-10 07:05:34,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 07:05:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 147211 states and 194773 transitions. [2019-09-10 07:05:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:05:34,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:34,195 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:05:34,195 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1731821552, now seen corresponding path program 1 times [2019-09-10 07:05:34,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:34,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:34,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:05:34,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:05:34,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 07:05:34,285 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [336], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 07:05:34,286 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:05:34,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:05:34,297 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:05:34,452 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:05:34,452 INFO L272 AbstractInterpreter]: Visited 73 different actions 462 times. Merged at 39 different actions 333 times. Widened at 16 different actions 62 times. Performed 1566 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1566 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 12 different actions. Largest state had 122 variables. [2019-09-10 07:05:34,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:34,453 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:05:34,537 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.78% of their original sizes. [2019-09-10 07:05:34,537 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:05:36,850 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 07:05:36,851 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:05:36,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:05:36,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [7] total 54 [2019-09-10 07:05:36,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:36,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 07:05:36,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 07:05:36,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2085, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:05:36,852 INFO L87 Difference]: Start difference. First operand 147211 states and 194773 transitions. Second operand 49 states. [2019-09-10 07:06:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:59,567 INFO L93 Difference]: Finished difference Result 260785 states and 341207 transitions. [2019-09-10 07:06:59,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 574 states. [2019-09-10 07:06:59,567 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 84 [2019-09-10 07:06:59,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:59,833 INFO L225 Difference]: With dead ends: 260785 [2019-09-10 07:06:59,833 INFO L226 Difference]: Without dead ends: 260527 [2019-09-10 07:06:59,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 595 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163774 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=37339, Invalid=318473, Unknown=0, NotChecked=0, Total=355812 [2019-09-10 07:06:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260527 states. [2019-09-10 07:07:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260527 to 154209. [2019-09-10 07:07:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154209 states. [2019-09-10 07:07:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154209 states to 154209 states and 203259 transitions. [2019-09-10 07:07:05,217 INFO L78 Accepts]: Start accepts. Automaton has 154209 states and 203259 transitions. Word has length 84 [2019-09-10 07:07:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:05,218 INFO L475 AbstractCegarLoop]: Abstraction has 154209 states and 203259 transitions. [2019-09-10 07:07:05,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 07:07:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 154209 states and 203259 transitions. [2019-09-10 07:07:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:07:05,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:05,234 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:07:05,234 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:05,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash 296325587, now seen corresponding path program 1 times [2019-09-10 07:07:05,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:05,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:05,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:05,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:05,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:07:05,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:05,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:07:05,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:05,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:07:05,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:07:05,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:07:05,319 INFO L87 Difference]: Start difference. First operand 154209 states and 203259 transitions. Second operand 6 states. [2019-09-10 07:07:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:05,788 INFO L93 Difference]: Finished difference Result 214203 states and 287213 transitions. [2019-09-10 07:07:05,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:07:05,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:07:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:06,018 INFO L225 Difference]: With dead ends: 214203 [2019-09-10 07:07:06,019 INFO L226 Difference]: Without dead ends: 213972 [2019-09-10 07:07:06,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213972 states. [2019-09-10 07:07:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213972 to 167844. [2019-09-10 07:07:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167844 states. [2019-09-10 07:07:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167844 states to 167844 states and 222139 transitions. [2019-09-10 07:07:09,369 INFO L78 Accepts]: Start accepts. Automaton has 167844 states and 222139 transitions. Word has length 84 [2019-09-10 07:07:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:09,369 INFO L475 AbstractCegarLoop]: Abstraction has 167844 states and 222139 transitions. [2019-09-10 07:07:09,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:07:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 167844 states and 222139 transitions. [2019-09-10 07:07:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:07:09,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:09,387 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:07:09,387 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:09,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1875929625, now seen corresponding path program 1 times [2019-09-10 07:07:09,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:09,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:09,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:09,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:09,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:07:09,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:09,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:07:09,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:09,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:07:09,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:07:09,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:07:09,478 INFO L87 Difference]: Start difference. First operand 167844 states and 222139 transitions. Second operand 6 states. [2019-09-10 07:07:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:10,265 INFO L93 Difference]: Finished difference Result 228892 states and 307285 transitions. [2019-09-10 07:07:10,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:07:10,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:07:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:10,563 INFO L225 Difference]: With dead ends: 228892 [2019-09-10 07:07:10,563 INFO L226 Difference]: Without dead ends: 228879 [2019-09-10 07:07:10,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228879 states. [2019-09-10 07:07:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228879 to 186220. [2019-09-10 07:07:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186220 states. [2019-09-10 07:07:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186220 states to 186220 states and 247511 transitions. [2019-09-10 07:07:14,724 INFO L78 Accepts]: Start accepts. Automaton has 186220 states and 247511 transitions. Word has length 84 [2019-09-10 07:07:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:14,724 INFO L475 AbstractCegarLoop]: Abstraction has 186220 states and 247511 transitions. [2019-09-10 07:07:14,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:07:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 186220 states and 247511 transitions. [2019-09-10 07:07:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:07:14,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:14,742 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:07:14,742 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash -192057548, now seen corresponding path program 1 times [2019-09-10 07:07:14,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:14,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:14,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:14,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:14,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:14,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:07:14,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:07:14,822 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 07:07:14,822 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [283], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 07:07:14,824 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:07:14,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:07:14,835 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:07:14,981 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:07:14,981 INFO L272 AbstractInterpreter]: Visited 73 different actions 435 times. Merged at 39 different actions 311 times. Widened at 15 different actions 55 times. Performed 1544 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1544 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 9 different actions. Largest state had 122 variables. [2019-09-10 07:07:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:14,981 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:07:15,044 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.88% of their original sizes. [2019-09-10 07:07:15,044 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:07:17,371 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 07:07:17,371 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:07:17,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:07:17,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [7] total 54 [2019-09-10 07:07:17,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:17,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 07:07:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 07:07:17,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2083, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:07:17,373 INFO L87 Difference]: Start difference. First operand 186220 states and 247511 transitions. Second operand 49 states. [2019-09-10 07:08:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:54,065 INFO L93 Difference]: Finished difference Result 310349 states and 409864 transitions. [2019-09-10 07:08:54,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 565 states. [2019-09-10 07:08:54,065 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 84 [2019-09-10 07:08:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:54,378 INFO L225 Difference]: With dead ends: 310349 [2019-09-10 07:08:54,378 INFO L226 Difference]: Without dead ends: 310158 [2019-09-10 07:08:54,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 586 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160575 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=35714, Invalid=309442, Unknown=0, NotChecked=0, Total=345156 [2019-09-10 07:08:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310158 states. [2019-09-10 07:08:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310158 to 195707. [2019-09-10 07:08:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195707 states. [2019-09-10 07:08:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195707 states to 195707 states and 258843 transitions. [2019-09-10 07:08:57,006 INFO L78 Accepts]: Start accepts. Automaton has 195707 states and 258843 transitions. Word has length 84 [2019-09-10 07:08:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:57,006 INFO L475 AbstractCegarLoop]: Abstraction has 195707 states and 258843 transitions. [2019-09-10 07:08:57,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 07:08:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 195707 states and 258843 transitions. [2019-09-10 07:08:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:08:57,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:57,019 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:08:57,020 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1249818576, now seen corresponding path program 1 times [2019-09-10 07:08:57,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:57,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:57,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:08:57,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:57,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:08:57,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:57,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:08:57,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:08:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:08:57,862 INFO L87 Difference]: Start difference. First operand 195707 states and 258843 transitions. Second operand 6 states. [2019-09-10 07:08:58,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:58,591 INFO L93 Difference]: Finished difference Result 254082 states and 340114 transitions. [2019-09-10 07:08:58,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:08:58,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:08:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:58,886 INFO L225 Difference]: With dead ends: 254082 [2019-09-10 07:08:58,886 INFO L226 Difference]: Without dead ends: 254082 [2019-09-10 07:08:58,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:08:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254082 states. [2019-09-10 07:09:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254082 to 211423. [2019-09-10 07:09:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211423 states. [2019-09-10 07:09:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211423 states to 211423 states and 280419 transitions. [2019-09-10 07:09:02,120 INFO L78 Accepts]: Start accepts. Automaton has 211423 states and 280419 transitions. Word has length 84 [2019-09-10 07:09:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:02,120 INFO L475 AbstractCegarLoop]: Abstraction has 211423 states and 280419 transitions. [2019-09-10 07:09:02,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:09:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 211423 states and 280419 transitions. [2019-09-10 07:09:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:09:02,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:02,137 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:09:02,137 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1646036884, now seen corresponding path program 1 times [2019-09-10 07:09:02,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:02,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:02,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:02,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:03,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:03,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:09:03,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2019-09-10 07:09:03,333 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [88], [93], [95], [98], [109], [111], [114], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [283], [285], [298], [306], [325], [327], [330], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 07:09:03,334 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:09:03,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:09:03,350 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:09:03,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:09:03,519 INFO L272 AbstractInterpreter]: Visited 77 different actions 451 times. Merged at 45 different actions 325 times. Widened at 11 different actions 35 times. Performed 1544 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1544 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 12 different actions. Largest state had 122 variables. [2019-09-10 07:09:03,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:03,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:09:03,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:03,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:09:03,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:03,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:09:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:03,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:09:03,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:09:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:03,724 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:09:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:03,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:09:03,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 07:09:03,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:09:03,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:09:03,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:09:03,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:09:03,807 INFO L87 Difference]: Start difference. First operand 211423 states and 280419 transitions. Second operand 11 states. [2019-09-10 07:09:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:05,095 INFO L93 Difference]: Finished difference Result 377935 states and 501466 transitions. [2019-09-10 07:09:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:09:05,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-10 07:09:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:05,513 INFO L225 Difference]: With dead ends: 377935 [2019-09-10 07:09:05,513 INFO L226 Difference]: Without dead ends: 377935 [2019-09-10 07:09:05,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:09:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377935 states. [2019-09-10 07:09:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377935 to 233094. [2019-09-10 07:09:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233094 states. [2019-09-10 07:09:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233094 states to 233094 states and 309714 transitions. [2019-09-10 07:09:12,946 INFO L78 Accepts]: Start accepts. Automaton has 233094 states and 309714 transitions. Word has length 87 [2019-09-10 07:09:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:12,947 INFO L475 AbstractCegarLoop]: Abstraction has 233094 states and 309714 transitions. [2019-09-10 07:09:12,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:09:12,947 INFO L276 IsEmpty]: Start isEmpty. Operand 233094 states and 309714 transitions. [2019-09-10 07:09:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:09:12,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:12,963 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:09:12,963 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:12,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1392616462, now seen corresponding path program 1 times [2019-09-10 07:09:12,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:12,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:12,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:12,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:12,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:13,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:13,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:09:13,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2019-09-10 07:09:13,050 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [101], [104], [109], [111], [114], [117], [120], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [221], [224], [232], [235], [238], [241], [243], [245], [274], [277], [285], [288], [291], [294], [296], [298], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 07:09:13,051 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:09:13,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:09:13,062 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:09:13,202 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:09:13,202 INFO L272 AbstractInterpreter]: Visited 77 different actions 468 times. Merged at 45 different actions 341 times. Widened at 16 different actions 48 times. Performed 1572 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1572 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 13 different actions. Largest state had 122 variables. [2019-09-10 07:09:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:13,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:09:13,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:13,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:09:13,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:13,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:09:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:13,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:09:13,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:09:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:13,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:09:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:13,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:09:13,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 07:09:13,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:09:13,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:09:13,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:09:13,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:09:13,464 INFO L87 Difference]: Start difference. First operand 233094 states and 309714 transitions. Second operand 11 states. [2019-09-10 07:09:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:19,399 INFO L93 Difference]: Finished difference Result 476991 states and 632744 transitions. [2019-09-10 07:09:19,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:09:19,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-10 07:09:19,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:20,013 INFO L225 Difference]: With dead ends: 476991 [2019-09-10 07:09:20,013 INFO L226 Difference]: Without dead ends: 476991 [2019-09-10 07:09:20,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:09:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476991 states. [2019-09-10 07:09:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476991 to 253736. [2019-09-10 07:09:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253736 states. [2019-09-10 07:09:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253736 states to 253736 states and 338097 transitions. [2019-09-10 07:09:23,795 INFO L78 Accepts]: Start accepts. Automaton has 253736 states and 338097 transitions. Word has length 87 [2019-09-10 07:09:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:23,795 INFO L475 AbstractCegarLoop]: Abstraction has 253736 states and 338097 transitions. [2019-09-10 07:09:23,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:09:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 253736 states and 338097 transitions. [2019-09-10 07:09:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:09:23,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:23,816 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:09:23,816 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash -80864488, now seen corresponding path program 1 times [2019-09-10 07:09:23,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:23,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:23,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:23,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:23,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:24,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:24,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:09:24,652 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2019-09-10 07:09:24,652 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [109], [111], [114], [117], [120], [125], [127], [130], [133], [136], [141], [143], [146], [149], [151], [154], [155], [157], [166], [168], [171], [179], [182], [185], [188], [190], [192], [221], [224], [232], [235], [238], [241], [243], [245], [283], [285], [298], [306], [325], [336], [338], [351], [359], [378], [407], [408], [412], [413], [414] [2019-09-10 07:09:24,653 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:09:24,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:09:24,664 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:09:24,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:09:24,893 INFO L272 AbstractInterpreter]: Visited 77 different actions 576 times. Merged at 45 different actions 437 times. Widened at 17 different actions 61 times. Performed 2065 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2065 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 13 different actions. Largest state had 122 variables. [2019-09-10 07:09:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:24,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:09:24,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:24,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:09:24,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:24,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:09:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:25,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:09:25,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:09:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:25,091 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:09:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:25,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:09:25,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 07:09:25,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:09:25,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:09:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:09:25,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:09:25,144 INFO L87 Difference]: Start difference. First operand 253736 states and 338097 transitions. Second operand 11 states. [2019-09-10 07:09:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:26,624 INFO L93 Difference]: Finished difference Result 477223 states and 636203 transitions. [2019-09-10 07:09:26,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:09:26,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-10 07:09:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:27,252 INFO L225 Difference]: With dead ends: 477223 [2019-09-10 07:09:27,252 INFO L226 Difference]: Without dead ends: 477223 [2019-09-10 07:09:27,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:09:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477223 states. [2019-09-10 07:09:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477223 to 275929. [2019-09-10 07:09:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275929 states. [2019-09-10 07:09:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275929 states to 275929 states and 368693 transitions. [2019-09-10 07:09:35,893 INFO L78 Accepts]: Start accepts. Automaton has 275929 states and 368693 transitions. Word has length 87 [2019-09-10 07:09:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:35,894 INFO L475 AbstractCegarLoop]: Abstraction has 275929 states and 368693 transitions. [2019-09-10 07:09:35,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:09:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 275929 states and 368693 transitions. [2019-09-10 07:09:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:09:35,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:35,917 INFO L399 BasicCegarLoop]: trace histogram [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 07:09:35,917 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:35,917 INFO L82 PathProgramCache]: Analyzing trace with hash 427156896, now seen corresponding path program 1 times [2019-09-10 07:09:35,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:35,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:35,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:35,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:35,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:36,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:36,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:09:36,108 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-10 07:09:36,108 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [93], [95], [98], [101], [104], [109], [111], [114], [117], [120], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [192], [200], [219], [221], [224], [232], [235], [238], [241], [243], [245], [274], [277], [285], [288], [291], [294], [296], [298], [336], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 07:09:36,109 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:09:36,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:09:36,118 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:09:36,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:09:36,327 INFO L272 AbstractInterpreter]: Visited 83 different actions 652 times. Merged at 52 different actions 503 times. Widened at 20 different actions 89 times. Performed 2163 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2163 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 56 fixpoints after 17 different actions. Largest state had 123 variables. [2019-09-10 07:09:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:36,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:09:36,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:36,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:09:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:36,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:09:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:36,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:09:36,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:09:36,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:09:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:36,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:09:36,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:09:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:37,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:09:37,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-10 07:09:37,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:09:37,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:09:37,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:09:37,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:09:37,090 INFO L87 Difference]: Start difference. First operand 275929 states and 368693 transitions. Second operand 17 states. [2019-09-10 07:09:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:49,370 INFO L93 Difference]: Finished difference Result 1791674 states and 2385204 transitions. [2019-09-10 07:09:49,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-10 07:09:49,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-09-10 07:09:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:02,634 INFO L225 Difference]: With dead ends: 1791674 [2019-09-10 07:10:02,634 INFO L226 Difference]: Without dead ends: 1791632 [2019-09-10 07:10:02,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2044 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1564, Invalid=4916, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 07:10:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791632 states. [2019-09-10 07:10:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791632 to 779994. [2019-09-10 07:10:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779994 states. [2019-09-10 07:10:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779994 states to 779994 states and 1049975 transitions. [2019-09-10 07:10:31,389 INFO L78 Accepts]: Start accepts. Automaton has 779994 states and 1049975 transitions. Word has length 89 [2019-09-10 07:10:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:31,390 INFO L475 AbstractCegarLoop]: Abstraction has 779994 states and 1049975 transitions. [2019-09-10 07:10:31,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:10:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 779994 states and 1049975 transitions. [2019-09-10 07:10:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:10:31,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:31,417 INFO L399 BasicCegarLoop]: trace histogram [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 07:10:31,417 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:31,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1410087250, now seen corresponding path program 1 times [2019-09-10 07:10:31,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:31,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:31,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:31,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:31,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:10:31,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:10:31,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:10:31,592 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-10 07:10:31,592 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [88], [93], [95], [98], [101], [104], [109], [111], [114], [125], [127], [130], [141], [143], [146], [149], [151], [154], [155], [157], [166], [177], [179], [182], [185], [188], [190], [192], [230], [232], [245], [253], [272], [274], [277], [285], [288], [291], [294], [296], [298], [327], [330], [338], [341], [344], [347], [349], [351], [407], [408], [412], [413], [414] [2019-09-10 07:10:31,595 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:10:31,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:10:31,607 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:10:31,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:10:31,799 INFO L272 AbstractInterpreter]: Visited 83 different actions 659 times. Merged at 52 different actions 510 times. Widened at 18 different actions 84 times. Performed 2198 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 57 fixpoints after 17 different actions. Largest state had 123 variables. [2019-09-10 07:10:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:31,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:10:31,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:10:31,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:10:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:31,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:10:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:31,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 07:10:31,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:10:32,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:10:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:10:32,360 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:10:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:10:32,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:10:32,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:10:32,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:10:32,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:10:32,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:10:32,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:10:32,749 INFO L87 Difference]: Start difference. First operand 779994 states and 1049975 transitions. Second operand 20 states. [2019-09-10 07:10:35,037 WARN L188 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-10 07:10:45,655 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-09-10 07:10:45,918 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-09-10 07:10:50,262 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-10 07:10:53,894 WARN L188 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:10:56,337 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:10:58,564 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:11:04,417 WARN L188 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-09-10 07:11:07,429 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 07:11:08,463 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:11:08,612 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 07:11:09,510 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:11:09,667 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 07:11:09,811 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 07:11:10,333 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-10 07:11:17,344 WARN L188 SmtUtils]: Spent 5.35 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 07:11:18,110 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 07:11:21,644 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-10 07:11:24,303 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-10 07:11:27,551 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-10 07:11:29,097 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-09-10 07:11:30,481 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:11:33,540 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 07:11:35,163 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 07:11:37,375 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-10 07:11:37,543 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50