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.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:09:22,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:09:22,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:09:22,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:09:22,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:09:22,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:09:22,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:09:22,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:09:22,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:09:22,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:09:22,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:09:22,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:09:22,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:09:22,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:09:22,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:09:22,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:09:22,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:09:22,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:09:22,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:09:22,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:09:22,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:09:22,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:09:22,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:09:22,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:09:22,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:09:22,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:09:22,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:09:22,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:09:22,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:09:22,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:09:22,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:09:22,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:09:22,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:09:22,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:09:22,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:09:22,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:09:22,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:09:22,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:09:22,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:09:22,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:09:22,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:09:22,694 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 07:09:22,709 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:09:22,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:09:22,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:09:22,710 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:09:22,711 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:09:22,711 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:09:22,711 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:09:22,711 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:09:22,712 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:09:22,712 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:09:22,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:09:22,713 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:09:22,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:09:22,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:09:22,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:09:22,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:09:22,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:09:22,714 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:09:22,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:09:22,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:09:22,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:09:22,715 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:09:22,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:09:22,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:09:22,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:09:22,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:09:22,716 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:09:22,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:09:22,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:09:22,716 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:09:22,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:09:22,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:09:22,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:09:22,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:09:22,774 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:09:22,775 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.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:09:22,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b4f0aca/4f5e24a460bf4cf0bf999007f8b8d9ff/FLAG4c634681b [2019-09-10 07:09:23,393 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:09:23,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:09:23,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b4f0aca/4f5e24a460bf4cf0bf999007f8b8d9ff/FLAG4c634681b [2019-09-10 07:09:23,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b4f0aca/4f5e24a460bf4cf0bf999007f8b8d9ff [2019-09-10 07:09:23,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:09:23,685 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:09:23,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:09:23,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:09:23,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:09:23,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:09:23" (1/1) ... [2019-09-10 07:09:23,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c72549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:23, skipping insertion in model container [2019-09-10 07:09:23,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:09:23" (1/1) ... [2019-09-10 07:09:23,704 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:09:23,768 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:09:24,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:09:24,161 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:09:24,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:09:24,266 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:09:24,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:24 WrapperNode [2019-09-10 07:09:24,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:09:24,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:09:24,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:09:24,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:09:24,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:24" (1/1) ... [2019-09-10 07:09:24,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:24" (1/1) ... [2019-09-10 07:09:24,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:24" (1/1) ... [2019-09-10 07:09:24,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:24" (1/1) ... [2019-09-10 07:09:24,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:24" (1/1) ... [2019-09-10 07:09:24,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:24" (1/1) ... [2019-09-10 07:09:24,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:24" (1/1) ... [2019-09-10 07:09:24,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:09:24,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:09:24,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:09:24,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:09:24,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:24" (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 07:09:24,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:09:24,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:09:24,421 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:09:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:09:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:09:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:09:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:09:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:09:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:09:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:09:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:09:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:09:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:09:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:09:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:09:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:09:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:09:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:09:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:09:24,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:09:25,186 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:09:25,188 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:09:25,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:09:25 BoogieIcfgContainer [2019-09-10 07:09:25,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:09:25,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:09:25,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:09:25,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:09:25,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:09:23" (1/3) ... [2019-09-10 07:09:25,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cccf57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:09:25, skipping insertion in model container [2019-09-10 07:09:25,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:24" (2/3) ... [2019-09-10 07:09:25,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cccf57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:09:25, skipping insertion in model container [2019-09-10 07:09:25,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:09:25" (3/3) ... [2019-09-10 07:09:25,204 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:09:25,214 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:09:25,232 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:09:25,249 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:09:25,277 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:09:25,277 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:09:25,277 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:09:25,277 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:09:25,277 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:09:25,278 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:09:25,278 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:09:25,278 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:09:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-09-10 07:09:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:09:25,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:25,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:25,311 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:25,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1692654370, now seen corresponding path program 1 times [2019-09-10 07:09:25,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:25,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:25,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:25,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:25,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:25,770 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 07:09:25,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:25,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:25,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:25,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:25,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:25,798 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-09-10 07:09:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:25,871 INFO L93 Difference]: Finished difference Result 222 states and 357 transitions. [2019-09-10 07:09:25,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:25,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 07:09:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:25,889 INFO L225 Difference]: With dead ends: 222 [2019-09-10 07:09:25,889 INFO L226 Difference]: Without dead ends: 214 [2019-09-10 07:09:25,892 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:09:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-10 07:09:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-09-10 07:09:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-10 07:09:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 315 transitions. [2019-09-10 07:09:25,986 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 315 transitions. Word has length 64 [2019-09-10 07:09:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:25,987 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 315 transitions. [2019-09-10 07:09:25,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 315 transitions. [2019-09-10 07:09:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:09:25,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:25,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:25,990 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:25,991 INFO L82 PathProgramCache]: Analyzing trace with hash 140291049, now seen corresponding path program 1 times [2019-09-10 07:09:25,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:25,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:25,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:25,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:25,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:26,133 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 07:09:26,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:26,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:26,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:26,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:26,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:26,137 INFO L87 Difference]: Start difference. First operand 212 states and 315 transitions. Second operand 3 states. [2019-09-10 07:09:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:26,192 INFO L93 Difference]: Finished difference Result 353 states and 537 transitions. [2019-09-10 07:09:26,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:26,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 07:09:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:26,199 INFO L225 Difference]: With dead ends: 353 [2019-09-10 07:09:26,201 INFO L226 Difference]: Without dead ends: 353 [2019-09-10 07:09:26,202 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:09:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-09-10 07:09:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2019-09-10 07:09:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-10 07:09:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 536 transitions. [2019-09-10 07:09:26,244 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 536 transitions. Word has length 64 [2019-09-10 07:09:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:26,245 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 536 transitions. [2019-09-10 07:09:26,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 536 transitions. [2019-09-10 07:09:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:09:26,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:26,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:26,248 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash -854561524, now seen corresponding path program 1 times [2019-09-10 07:09:26,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:26,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:26,382 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 07:09:26,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:26,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:26,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:26,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:26,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:26,384 INFO L87 Difference]: Start difference. First operand 351 states and 536 transitions. Second operand 3 states. [2019-09-10 07:09:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:26,406 INFO L93 Difference]: Finished difference Result 599 states and 925 transitions. [2019-09-10 07:09:26,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:26,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 07:09:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:26,411 INFO L225 Difference]: With dead ends: 599 [2019-09-10 07:09:26,411 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 07:09:26,411 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:09:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 07:09:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2019-09-10 07:09:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-10 07:09:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 924 transitions. [2019-09-10 07:09:26,436 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 924 transitions. Word has length 65 [2019-09-10 07:09:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:26,436 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 924 transitions. [2019-09-10 07:09:26,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 924 transitions. [2019-09-10 07:09:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:09:26,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:26,439 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:26,440 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1360555230, now seen corresponding path program 1 times [2019-09-10 07:09:26,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:26,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:26,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:26,559 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 07:09:26,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:26,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:26,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:26,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:26,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:26,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:26,563 INFO L87 Difference]: Start difference. First operand 597 states and 924 transitions. Second operand 3 states. [2019-09-10 07:09:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:26,585 INFO L93 Difference]: Finished difference Result 1027 states and 1593 transitions. [2019-09-10 07:09:26,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:26,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 07:09:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:26,595 INFO L225 Difference]: With dead ends: 1027 [2019-09-10 07:09:26,595 INFO L226 Difference]: Without dead ends: 1027 [2019-09-10 07:09:26,596 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:09:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-09-10 07:09:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1025. [2019-09-10 07:09:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2019-09-10 07:09:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1592 transitions. [2019-09-10 07:09:26,624 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1592 transitions. Word has length 66 [2019-09-10 07:09:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:26,625 INFO L475 AbstractCegarLoop]: Abstraction has 1025 states and 1592 transitions. [2019-09-10 07:09:26,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1592 transitions. [2019-09-10 07:09:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:09:26,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:26,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:26,627 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash 689018699, now seen corresponding path program 1 times [2019-09-10 07:09:26,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:26,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:26,711 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 07:09:26,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:26,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:26,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:26,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:26,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:26,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:26,715 INFO L87 Difference]: Start difference. First operand 1025 states and 1592 transitions. Second operand 3 states. [2019-09-10 07:09:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:26,746 INFO L93 Difference]: Finished difference Result 1755 states and 2713 transitions. [2019-09-10 07:09:26,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:26,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 07:09:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:26,761 INFO L225 Difference]: With dead ends: 1755 [2019-09-10 07:09:26,761 INFO L226 Difference]: Without dead ends: 1755 [2019-09-10 07:09:26,762 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:09:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-09-10 07:09:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2019-09-10 07:09:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-09-10 07:09:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2712 transitions. [2019-09-10 07:09:26,836 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2712 transitions. Word has length 67 [2019-09-10 07:09:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:26,875 INFO L475 AbstractCegarLoop]: Abstraction has 1753 states and 2712 transitions. [2019-09-10 07:09:26,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2712 transitions. [2019-09-10 07:09:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:09:26,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:26,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:26,880 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:26,881 INFO L82 PathProgramCache]: Analyzing trace with hash 536594407, now seen corresponding path program 1 times [2019-09-10 07:09:26,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:26,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:26,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:26,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:27,128 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 07:09:27,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:27,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:27,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:27,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:27,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:27,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:27,132 INFO L87 Difference]: Start difference. First operand 1753 states and 2712 transitions. Second operand 7 states. [2019-09-10 07:09:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:27,372 INFO L93 Difference]: Finished difference Result 7329 states and 11260 transitions. [2019-09-10 07:09:27,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:09:27,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-10 07:09:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:27,415 INFO L225 Difference]: With dead ends: 7329 [2019-09-10 07:09:27,415 INFO L226 Difference]: Without dead ends: 7329 [2019-09-10 07:09:27,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2019-09-10 07:09:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 7321. [2019-09-10 07:09:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-09-10 07:09:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 11256 transitions. [2019-09-10 07:09:27,623 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 11256 transitions. Word has length 68 [2019-09-10 07:09:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:27,625 INFO L475 AbstractCegarLoop]: Abstraction has 7321 states and 11256 transitions. [2019-09-10 07:09:27,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 11256 transitions. [2019-09-10 07:09:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:09:27,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:27,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:27,632 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:27,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:27,639 INFO L82 PathProgramCache]: Analyzing trace with hash -451828971, now seen corresponding path program 1 times [2019-09-10 07:09:27,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:27,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:27,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:27,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:27,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:27,940 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 07:09:27,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:27,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:09:27,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:27,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:09:27,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:09:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:27,942 INFO L87 Difference]: Start difference. First operand 7321 states and 11256 transitions. Second operand 7 states. [2019-09-10 07:09:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:28,332 INFO L93 Difference]: Finished difference Result 29971 states and 45869 transitions. [2019-09-10 07:09:28,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:09:28,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-10 07:09:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:28,462 INFO L225 Difference]: With dead ends: 29971 [2019-09-10 07:09:28,462 INFO L226 Difference]: Without dead ends: 29971 [2019-09-10 07:09:28,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:09:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29971 states. [2019-09-10 07:09:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29971 to 14601. [2019-09-10 07:09:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14601 states. [2019-09-10 07:09:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 22152 transitions. [2019-09-10 07:09:28,915 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 22152 transitions. Word has length 70 [2019-09-10 07:09:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:28,916 INFO L475 AbstractCegarLoop]: Abstraction has 14601 states and 22152 transitions. [2019-09-10 07:09:28,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:09:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 22152 transitions. [2019-09-10 07:09:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:09:28,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:28,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:28,917 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:28,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:28,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1140328934, now seen corresponding path program 1 times [2019-09-10 07:09:28,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:28,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:28,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:29,018 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 07:09:29,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:29,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:09:29,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:29,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:09:29,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:09:29,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:09:29,020 INFO L87 Difference]: Start difference. First operand 14601 states and 22152 transitions. Second operand 5 states. [2019-09-10 07:09:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:29,175 INFO L93 Difference]: Finished difference Result 29801 states and 44584 transitions. [2019-09-10 07:09:29,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:09:29,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:09:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:29,250 INFO L225 Difference]: With dead ends: 29801 [2019-09-10 07:09:29,250 INFO L226 Difference]: Without dead ends: 29801 [2019-09-10 07:09:29,251 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 07:09:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29801 states. [2019-09-10 07:09:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29801 to 15241. [2019-09-10 07:09:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15241 states. [2019-09-10 07:09:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15241 states to 15241 states and 22792 transitions. [2019-09-10 07:09:29,690 INFO L78 Accepts]: Start accepts. Automaton has 15241 states and 22792 transitions. Word has length 71 [2019-09-10 07:09:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:29,691 INFO L475 AbstractCegarLoop]: Abstraction has 15241 states and 22792 transitions. [2019-09-10 07:09:29,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:09:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 15241 states and 22792 transitions. [2019-09-10 07:09:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:09:29,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:29,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:29,692 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash -980838812, now seen corresponding path program 1 times [2019-09-10 07:09:29,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:29,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:29,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:29,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:29,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:29,756 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 07:09:29,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:29,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:29,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:29,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:29,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:29,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:29,758 INFO L87 Difference]: Start difference. First operand 15241 states and 22792 transitions. Second operand 3 states. [2019-09-10 07:09:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:29,831 INFO L93 Difference]: Finished difference Result 21917 states and 32603 transitions. [2019-09-10 07:09:29,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:29,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 07:09:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:29,876 INFO L225 Difference]: With dead ends: 21917 [2019-09-10 07:09:29,876 INFO L226 Difference]: Without dead ends: 21917 [2019-09-10 07:09:29,877 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 07:09:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21917 states. [2019-09-10 07:09:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21917 to 21915. [2019-09-10 07:09:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21915 states. [2019-09-10 07:09:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21915 states to 21915 states and 32602 transitions. [2019-09-10 07:09:30,702 INFO L78 Accepts]: Start accepts. Automaton has 21915 states and 32602 transitions. Word has length 72 [2019-09-10 07:09:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:30,703 INFO L475 AbstractCegarLoop]: Abstraction has 21915 states and 32602 transitions. [2019-09-10 07:09:30,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 21915 states and 32602 transitions. [2019-09-10 07:09:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:09:30,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:30,716 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:30,716 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:30,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2077189795, now seen corresponding path program 1 times [2019-09-10 07:09:30,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:30,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:30,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:30,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:09:30,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:30,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:09:30,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 07:09:30,861 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], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [133], [135], [138], [149], [151], [154], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [199], [204], [217], [219], [232], [240], [259], [270], [272], [285], [293], [312], [323], [325], [338], [346], [365], [376], [378], [381], [384], [387], [389], [391], [429], [431], [444], [452], [489], [490], [494], [495], [496] [2019-09-10 07:09:30,910 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:09:30,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:09:31,099 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:09:31,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:09:31,783 INFO L272 AbstractInterpreter]: Visited 89 different actions 554 times. Merged at 50 different actions 399 times. Widened at 16 different actions 57 times. Performed 1907 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1907 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 56 fixpoints after 13 different actions. Largest state had 145 variables. [2019-09-10 07:09:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:31,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:09:31,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:31,790 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) [2019-09-10 07:09:31,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:31,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:09:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:32,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:09:32,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:09:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:09:32,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:09:32,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:09:32,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:09:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:32,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:09:32,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2019-09-10 07:09:32,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:09:32,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:09:32,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:09:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:09:32,285 INFO L87 Difference]: Start difference. First operand 21915 states and 32602 transitions. Second operand 5 states. [2019-09-10 07:09:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:32,501 INFO L93 Difference]: Finished difference Result 39255 states and 58211 transitions. [2019-09-10 07:09:32,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:09:32,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 07:09:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:32,589 INFO L225 Difference]: With dead ends: 39255 [2019-09-10 07:09:32,589 INFO L226 Difference]: Without dead ends: 39255 [2019-09-10 07:09:32,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:09:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39255 states. [2019-09-10 07:09:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39255 to 36411. [2019-09-10 07:09:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36411 states. [2019-09-10 07:09:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36411 states to 36411 states and 53946 transitions. [2019-09-10 07:09:33,513 INFO L78 Accepts]: Start accepts. Automaton has 36411 states and 53946 transitions. Word has length 97 [2019-09-10 07:09:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:33,514 INFO L475 AbstractCegarLoop]: Abstraction has 36411 states and 53946 transitions. [2019-09-10 07:09:33,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:09:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 36411 states and 53946 transitions. [2019-09-10 07:09:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:09:33,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:33,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:33,527 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash 441654667, now seen corresponding path program 1 times [2019-09-10 07:09:33,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:33,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:33,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:33,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:33,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:33,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:33,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:33,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:33,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:33,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:33,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:33,609 INFO L87 Difference]: Start difference. First operand 36411 states and 53946 transitions. Second operand 3 states. [2019-09-10 07:09:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:33,838 INFO L93 Difference]: Finished difference Result 64701 states and 95067 transitions. [2019-09-10 07:09:33,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:33,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:09:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:33,993 INFO L225 Difference]: With dead ends: 64701 [2019-09-10 07:09:33,994 INFO L226 Difference]: Without dead ends: 64701 [2019-09-10 07:09:33,994 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:09:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64701 states. [2019-09-10 07:09:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64701 to 64699. [2019-09-10 07:09:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64699 states. [2019-09-10 07:09:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64699 states to 64699 states and 95066 transitions. [2019-09-10 07:09:35,865 INFO L78 Accepts]: Start accepts. Automaton has 64699 states and 95066 transitions. Word has length 98 [2019-09-10 07:09:35,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:35,866 INFO L475 AbstractCegarLoop]: Abstraction has 64699 states and 95066 transitions. [2019-09-10 07:09:35,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:35,866 INFO L276 IsEmpty]: Start isEmpty. Operand 64699 states and 95066 transitions. [2019-09-10 07:09:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:09:35,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:35,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:35,902 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:35,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1758273834, now seen corresponding path program 1 times [2019-09-10 07:09:35,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:35,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:35,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:35,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:36,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:36,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:36,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:36,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:36,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:36,248 INFO L87 Difference]: Start difference. First operand 64699 states and 95066 transitions. Second operand 3 states. [2019-09-10 07:09:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:36,519 INFO L93 Difference]: Finished difference Result 87335 states and 126698 transitions. [2019-09-10 07:09:36,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:36,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:09:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:36,740 INFO L225 Difference]: With dead ends: 87335 [2019-09-10 07:09:36,741 INFO L226 Difference]: Without dead ends: 87335 [2019-09-10 07:09:36,741 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:09:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87335 states. [2019-09-10 07:09:39,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87335 to 81285. [2019-09-10 07:09:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81285 states. [2019-09-10 07:09:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81285 states to 81285 states and 118201 transitions. [2019-09-10 07:09:39,303 INFO L78 Accepts]: Start accepts. Automaton has 81285 states and 118201 transitions. Word has length 98 [2019-09-10 07:09:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:39,303 INFO L475 AbstractCegarLoop]: Abstraction has 81285 states and 118201 transitions. [2019-09-10 07:09:39,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 81285 states and 118201 transitions. [2019-09-10 07:09:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:09:39,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:39,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:39,333 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:39,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:39,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1271438003, now seen corresponding path program 1 times [2019-09-10 07:09:39,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:39,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:39,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:39,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:39,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:39,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:39,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:39,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:39,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:39,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:39,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:39,426 INFO L87 Difference]: Start difference. First operand 81285 states and 118201 transitions. Second operand 3 states. [2019-09-10 07:09:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:39,706 INFO L93 Difference]: Finished difference Result 92589 states and 132582 transitions. [2019-09-10 07:09:39,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:39,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:09:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:39,920 INFO L225 Difference]: With dead ends: 92589 [2019-09-10 07:09:39,920 INFO L226 Difference]: Without dead ends: 85297 [2019-09-10 07:09:39,921 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:09:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85297 states. [2019-09-10 07:09:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85297 to 82175. [2019-09-10 07:09:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82175 states. [2019-09-10 07:09:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82175 states to 82175 states and 117613 transitions. [2019-09-10 07:09:41,336 INFO L78 Accepts]: Start accepts. Automaton has 82175 states and 117613 transitions. Word has length 98 [2019-09-10 07:09:41,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:41,336 INFO L475 AbstractCegarLoop]: Abstraction has 82175 states and 117613 transitions. [2019-09-10 07:09:41,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 82175 states and 117613 transitions. [2019-09-10 07:09:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:09:41,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:41,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:41,361 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:41,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:41,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1058242613, now seen corresponding path program 1 times [2019-09-10 07:09:41,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:41,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:41,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:41,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:41,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:41,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:41,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:41,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:41,438 INFO L87 Difference]: Start difference. First operand 82175 states and 117613 transitions. Second operand 3 states. [2019-09-10 07:09:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:41,756 INFO L93 Difference]: Finished difference Result 130232 states and 184260 transitions. [2019-09-10 07:09:41,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:41,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 07:09:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:41,950 INFO L225 Difference]: With dead ends: 130232 [2019-09-10 07:09:41,950 INFO L226 Difference]: Without dead ends: 128908 [2019-09-10 07:09:41,951 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:09:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128908 states. [2019-09-10 07:09:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128908 to 127037. [2019-09-10 07:09:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127037 states. [2019-09-10 07:09:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127037 states to 127037 states and 179873 transitions. [2019-09-10 07:09:45,235 INFO L78 Accepts]: Start accepts. Automaton has 127037 states and 179873 transitions. Word has length 98 [2019-09-10 07:09:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:45,236 INFO L475 AbstractCegarLoop]: Abstraction has 127037 states and 179873 transitions. [2019-09-10 07:09:45,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 127037 states and 179873 transitions. [2019-09-10 07:09:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:09:45,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:45,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:45,269 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:45,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:45,269 INFO L82 PathProgramCache]: Analyzing trace with hash -164057962, now seen corresponding path program 1 times [2019-09-10 07:09:45,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:45,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:45,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:45,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:45,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:45,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:45,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:09:45,387 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:09:45,388 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], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [125], [128], [133], [135], [138], [149], [151], [154], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [270], [272], [285], [293], [312], [323], [325], [338], [346], [365], [367], [370], [378], [381], [384], [387], [389], [391], [429], [431], [444], [452], [489], [490], [494], [495], [496] [2019-09-10 07:09:45,392 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:09:45,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:09:45,430 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:09:45,720 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:09:45,721 INFO L272 AbstractInterpreter]: Visited 86 different actions 424 times. Merged at 44 different actions 286 times. Widened at 11 different actions 28 times. Performed 1535 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1535 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 32 fixpoints after 8 different actions. Largest state had 145 variables. [2019-09-10 07:09:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:45,721 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:09:46,116 INFO L227 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 81.01% of their original sizes. [2019-09-10 07:09:46,117 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:09:51,944 INFO L420 sIntCurrentIteration]: We unified 97 AI predicates to 97 [2019-09-10 07:09:51,944 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:09:51,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:09:51,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [7] total 61 [2019-09-10 07:09:51,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:51,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:09:51,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:09:51,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2750, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:09:51,948 INFO L87 Difference]: Start difference. First operand 127037 states and 179873 transitions. Second operand 56 states. [2019-09-10 07:11:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:04,477 INFO L93 Difference]: Finished difference Result 264595 states and 368776 transitions. [2019-09-10 07:11:04,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2019-09-10 07:11:04,478 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 98 [2019-09-10 07:11:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:04,874 INFO L225 Difference]: With dead ends: 264595 [2019-09-10 07:11:04,875 INFO L226 Difference]: Without dead ends: 264143 [2019-09-10 07:11:04,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25907 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=9837, Invalid=58023, Unknown=0, NotChecked=0, Total=67860 [2019-09-10 07:11:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264143 states. [2019-09-10 07:11:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264143 to 160295. [2019-09-10 07:11:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160295 states. [2019-09-10 07:11:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160295 states to 160295 states and 224295 transitions. [2019-09-10 07:11:06,975 INFO L78 Accepts]: Start accepts. Automaton has 160295 states and 224295 transitions. Word has length 98 [2019-09-10 07:11:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:06,975 INFO L475 AbstractCegarLoop]: Abstraction has 160295 states and 224295 transitions. [2019-09-10 07:11:06,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 07:11:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 160295 states and 224295 transitions. [2019-09-10 07:11:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:11:07,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:07,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:07,003 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:07,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:07,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1224846863, now seen corresponding path program 1 times [2019-09-10 07:11:07,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:07,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:07,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:07,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:11:07,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:11:07,122 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:11:07,123 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], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [133], [135], [138], [141], [144], [149], [151], [154], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [270], [272], [285], [293], [312], [314], [317], [325], [328], [331], [334], [336], [338], [376], [378], [391], [399], [418], [429], [431], [444], [452], [489], [490], [494], [495], [496] [2019-09-10 07:11:07,127 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:11:07,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:11:07,146 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:11:07,304 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:11:07,304 INFO L272 AbstractInterpreter]: Visited 86 different actions 435 times. Merged at 44 different actions 294 times. Widened at 12 different actions 28 times. Performed 1639 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1639 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 32 fixpoints after 8 different actions. Largest state had 145 variables. [2019-09-10 07:11:07,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:07,305 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:11:07,440 INFO L227 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 81.33% of their original sizes. [2019-09-10 07:11:07,441 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:11:12,061 INFO L420 sIntCurrentIteration]: We unified 97 AI predicates to 97 [2019-09-10 07:11:12,061 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:11:12,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:11:12,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [7] total 60 [2019-09-10 07:11:12,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:12,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 07:11:12,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 07:11:12,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2646, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 07:11:12,063 INFO L87 Difference]: Start difference. First operand 160295 states and 224295 transitions. Second operand 55 states. [2019-09-10 07:12:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:41,956 INFO L93 Difference]: Finished difference Result 298930 states and 412733 transitions. [2019-09-10 07:12:41,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2019-09-10 07:12:41,956 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 98 [2019-09-10 07:12:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:42,290 INFO L225 Difference]: With dead ends: 298930 [2019-09-10 07:12:42,290 INFO L226 Difference]: Without dead ends: 298772 [2019-09-10 07:12:42,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35993 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=12092, Invalid=77608, Unknown=0, NotChecked=0, Total=89700 [2019-09-10 07:12:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298772 states. [2019-09-10 07:12:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298772 to 179809. [2019-09-10 07:12:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179809 states. [2019-09-10 07:12:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179809 states to 179809 states and 249407 transitions. [2019-09-10 07:12:45,154 INFO L78 Accepts]: Start accepts. Automaton has 179809 states and 249407 transitions. Word has length 98 [2019-09-10 07:12:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:45,154 INFO L475 AbstractCegarLoop]: Abstraction has 179809 states and 249407 transitions. [2019-09-10 07:12:45,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 07:12:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 179809 states and 249407 transitions. [2019-09-10 07:12:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:12:45,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:45,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:45,176 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:45,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:45,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1145297258, now seen corresponding path program 1 times [2019-09-10 07:12:45,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:45,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:45,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:45,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:12:45,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:12:45,298 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:12:45,298 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], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [133], [135], [138], [149], [151], [154], [157], [160], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [261], [264], [272], [275], [278], [281], [283], [285], [323], [325], [338], [346], [365], [376], [378], [391], [399], [418], [429], [431], [444], [452], [489], [490], [494], [495], [496] [2019-09-10 07:12:45,302 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:12:45,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:12:45,323 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:12:45,491 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:12:45,492 INFO L272 AbstractInterpreter]: Visited 86 different actions 460 times. Merged at 44 different actions 317 times. Widened at 13 different actions 31 times. Performed 1659 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1659 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 33 fixpoints after 9 different actions. Largest state had 145 variables. [2019-09-10 07:12:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:45,492 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:12:45,656 INFO L227 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 81.26% of their original sizes. [2019-09-10 07:12:45,657 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:12:49,407 INFO L420 sIntCurrentIteration]: We unified 97 AI predicates to 97 [2019-09-10 07:12:49,407 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:12:49,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:12:49,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [7] total 60 [2019-09-10 07:12:49,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:49,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 07:12:49,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 07:12:49,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=2632, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 07:12:49,409 INFO L87 Difference]: Start difference. First operand 179809 states and 249407 transitions. Second operand 55 states. [2019-09-10 07:13:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:51,546 INFO L93 Difference]: Finished difference Result 300396 states and 414950 transitions. [2019-09-10 07:13:51,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2019-09-10 07:13:51,547 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 98 [2019-09-10 07:13:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:51,942 INFO L225 Difference]: With dead ends: 300396 [2019-09-10 07:13:51,942 INFO L226 Difference]: Without dead ends: 300349 [2019-09-10 07:13:51,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18107 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=6586, Invalid=41594, Unknown=0, NotChecked=0, Total=48180 [2019-09-10 07:13:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300349 states. [2019-09-10 07:13:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300349 to 192728. [2019-09-10 07:13:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192728 states. [2019-09-10 07:14:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192728 states to 192728 states and 265928 transitions. [2019-09-10 07:14:01,162 INFO L78 Accepts]: Start accepts. Automaton has 192728 states and 265928 transitions. Word has length 98 [2019-09-10 07:14:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:01,163 INFO L475 AbstractCegarLoop]: Abstraction has 192728 states and 265928 transitions. [2019-09-10 07:14:01,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 07:14:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 192728 states and 265928 transitions. [2019-09-10 07:14:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:14:01,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:01,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:01,188 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:01,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:01,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1831088311, now seen corresponding path program 1 times [2019-09-10 07:14:01,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:01,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:01,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:01,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:01,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:01,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:14:01,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:14:01,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:14:01,294 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], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [133], [135], [138], [149], [151], [154], [165], [167], [170], [173], [176], [181], [183], [186], [189], [191], [194], [195], [197], [206], [208], [211], [219], [222], [225], [228], [230], [232], [270], [272], [285], [293], [312], [323], [325], [338], [346], [365], [376], [378], [391], [399], [418], [429], [431], [444], [452], [489], [490], [494], [495], [496] [2019-09-10 07:14:01,300 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:14:01,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:14:01,318 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:14:01,463 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:14:01,463 INFO L272 AbstractInterpreter]: Visited 86 different actions 414 times. Merged at 44 different actions 279 times. Widened at 10 different actions 29 times. Performed 1464 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1464 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 28 fixpoints after 9 different actions. Largest state had 145 variables. [2019-09-10 07:14:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:01,464 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:14:01,604 INFO L227 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 81.15% of their original sizes. [2019-09-10 07:14:01,604 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:14:05,561 INFO L420 sIntCurrentIteration]: We unified 97 AI predicates to 97 [2019-09-10 07:14:05,562 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:14:05,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:14:05,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [7] total 61 [2019-09-10 07:14:05,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:05,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:14:05,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:14:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=2741, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:14:05,565 INFO L87 Difference]: Start difference. First operand 192728 states and 265928 transitions. Second operand 56 states. [2019-09-10 07:15:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:17,204 INFO L93 Difference]: Finished difference Result 310764 states and 428203 transitions. [2019-09-10 07:15:17,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-10 07:15:17,204 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 98 [2019-09-10 07:15:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:17,625 INFO L225 Difference]: With dead ends: 310764 [2019-09-10 07:15:17,625 INFO L226 Difference]: Without dead ends: 310644 [2019-09-10 07:15:17,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11315 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=4894, Invalid=27686, Unknown=0, NotChecked=0, Total=32580 [2019-09-10 07:15:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310644 states. [2019-09-10 07:15:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310644 to 202600. [2019-09-10 07:15:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202600 states. [2019-09-10 07:15:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202600 states to 202600 states and 278374 transitions. [2019-09-10 07:15:21,730 INFO L78 Accepts]: Start accepts. Automaton has 202600 states and 278374 transitions. Word has length 98 [2019-09-10 07:15:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:21,730 INFO L475 AbstractCegarLoop]: Abstraction has 202600 states and 278374 transitions. [2019-09-10 07:15:21,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 07:15:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 202600 states and 278374 transitions. [2019-09-10 07:15:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:15:21,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:21,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:21,764 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:21,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1345133303, now seen corresponding path program 1 times [2019-09-10 07:15:21,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:21,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:21,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:21,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:21,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 07:15:21,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:21,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:15:21,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:21,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:15:21,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:15:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:15:21,842 INFO L87 Difference]: Start difference. First operand 202600 states and 278374 transitions. Second operand 5 states. [2019-09-10 07:15:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:22,964 INFO L93 Difference]: Finished difference Result 279403 states and 382357 transitions. [2019-09-10 07:15:22,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:15:22,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:15:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:23,481 INFO L225 Difference]: With dead ends: 279403 [2019-09-10 07:15:23,481 INFO L226 Difference]: Without dead ends: 279403 [2019-09-10 07:15:23,482 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 07:15:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279403 states. [2019-09-10 07:15:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279403 to 202453. [2019-09-10 07:15:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202453 states. [2019-09-10 07:15:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202453 states to 202453 states and 277067 transitions. [2019-09-10 07:15:29,829 INFO L78 Accepts]: Start accepts. Automaton has 202453 states and 277067 transitions. Word has length 99 [2019-09-10 07:15:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:29,830 INFO L475 AbstractCegarLoop]: Abstraction has 202453 states and 277067 transitions. [2019-09-10 07:15:29,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:15:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 202453 states and 277067 transitions. [2019-09-10 07:15:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:15:29,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:29,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:29,853 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:29,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:29,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1576406770, now seen corresponding path program 1 times [2019-09-10 07:15:29,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:29,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:29,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:29,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:29,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:29,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:15:29,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:15:29,944 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:15:29,944 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], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [109], [112], [117], [119], [122], [133], [135], [138], [149], [151], [154], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [270], [272], [285], [293], [312], [323], [325], [338], [346], [365], [376], [378], [391], [399], [418], [420], [423], [431], [434], [437], [440], [442], [444], [489], [490], [494], [495], [496] [2019-09-10 07:15:29,946 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:15:29,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:15:29,962 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:15:30,100 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:15:30,101 INFO L272 AbstractInterpreter]: Visited 87 different actions 402 times. Merged at 45 different actions 266 times. Widened at 9 different actions 24 times. Performed 1490 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1490 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 32 fixpoints after 8 different actions. Largest state had 145 variables. [2019-09-10 07:15:30,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:30,101 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:15:30,822 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 80% of their original sizes. [2019-09-10 07:15:30,823 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:15:35,027 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-10 07:15:35,027 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:15:35,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:15:35,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [7] total 62 [2019-09-10 07:15:35,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:35,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 07:15:35,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 07:15:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2849, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:15:35,029 INFO L87 Difference]: Start difference. First operand 202453 states and 277067 transitions. Second operand 57 states. [2019-09-10 07:16:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:51,934 INFO L93 Difference]: Finished difference Result 394113 states and 534131 transitions. [2019-09-10 07:16:51,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-10 07:16:51,934 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 99 [2019-09-10 07:16:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:52,547 INFO L225 Difference]: With dead ends: 394113 [2019-09-10 07:16:52,547 INFO L226 Difference]: Without dead ends: 394094 [2019-09-10 07:16:52,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6919 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3093, Invalid=19859, Unknown=0, NotChecked=0, Total=22952 [2019-09-10 07:16:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394094 states. [2019-09-10 07:16:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394094 to 243658. [2019-09-10 07:16:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243658 states. [2019-09-10 07:16:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243658 states to 243658 states and 331910 transitions. [2019-09-10 07:16:57,625 INFO L78 Accepts]: Start accepts. Automaton has 243658 states and 331910 transitions. Word has length 99 [2019-09-10 07:16:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:57,626 INFO L475 AbstractCegarLoop]: Abstraction has 243658 states and 331910 transitions. [2019-09-10 07:16:57,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 07:16:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 243658 states and 331910 transitions. [2019-09-10 07:16:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:16:57,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:57,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:57,653 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:57,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:57,653 INFO L82 PathProgramCache]: Analyzing trace with hash 970694141, now seen corresponding path program 1 times [2019-09-10 07:16:57,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:57,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:57,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:57,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:57,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:16:57,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:57,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:57,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:57,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:57,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:57,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:57,727 INFO L87 Difference]: Start difference. First operand 243658 states and 331910 transitions. Second operand 3 states. [2019-09-10 07:16:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:58,523 INFO L93 Difference]: Finished difference Result 332634 states and 449537 transitions. [2019-09-10 07:16:58,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:58,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:16:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:58,986 INFO L225 Difference]: With dead ends: 332634 [2019-09-10 07:16:58,986 INFO L226 Difference]: Without dead ends: 329515 [2019-09-10 07:16:58,987 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:16:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329515 states. [2019-09-10 07:17:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329515 to 326269. [2019-09-10 07:17:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326269 states. [2019-09-10 07:17:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326269 states to 326269 states and 441436 transitions. [2019-09-10 07:17:07,763 INFO L78 Accepts]: Start accepts. Automaton has 326269 states and 441436 transitions. Word has length 99 [2019-09-10 07:17:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:07,763 INFO L475 AbstractCegarLoop]: Abstraction has 326269 states and 441436 transitions. [2019-09-10 07:17:07,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 326269 states and 441436 transitions. [2019-09-10 07:17:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:17:07,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:07,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:07,805 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:07,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1602599747, now seen corresponding path program 1 times [2019-09-10 07:17:07,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:07,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:07,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:07,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:07,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:17:07,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:07,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:07,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:07,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:07,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:07,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:07,986 INFO L87 Difference]: Start difference. First operand 326269 states and 441436 transitions. Second operand 7 states. [2019-09-10 07:17:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:10,636 INFO L93 Difference]: Finished difference Result 633213 states and 872672 transitions. [2019-09-10 07:17:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:17:10,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-09-10 07:17:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:11,628 INFO L225 Difference]: With dead ends: 633213 [2019-09-10 07:17:11,628 INFO L226 Difference]: Without dead ends: 632484 [2019-09-10 07:17:11,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632484 states. [2019-09-10 07:17:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632484 to 419757. [2019-09-10 07:17:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419757 states. [2019-09-10 07:17:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419757 states to 419757 states and 570776 transitions. [2019-09-10 07:17:32,091 INFO L78 Accepts]: Start accepts. Automaton has 419757 states and 570776 transitions. Word has length 100 [2019-09-10 07:17:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:32,091 INFO L475 AbstractCegarLoop]: Abstraction has 419757 states and 570776 transitions. [2019-09-10 07:17:32,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:17:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 419757 states and 570776 transitions. [2019-09-10 07:17:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:17:32,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:32,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:32,132 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:32,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:32,132 INFO L82 PathProgramCache]: Analyzing trace with hash -708415096, now seen corresponding path program 1 times [2019-09-10 07:17:32,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:32,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:32,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:32,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:32,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:17:32,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:17:32,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:17:32,217 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], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [125], [128], [133], [135], [138], [149], [151], [154], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [270], [272], [285], [293], [312], [323], [325], [328], [331], [334], [336], [338], [367], [370], [378], [381], [384], [387], [389], [391], [429], [431], [444], [452], [489], [490], [494], [495], [496] [2019-09-10 07:17:32,219 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:17:32,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:17:32,235 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:17:32,424 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:17:32,424 INFO L272 AbstractInterpreter]: Visited 88 different actions 505 times. Merged at 46 different actions 354 times. Widened at 15 different actions 42 times. Performed 1788 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1788 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 38 fixpoints after 11 different actions. Largest state had 146 variables. [2019-09-10 07:17:32,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:32,425 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:17:32,538 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 81.79% of their original sizes. [2019-09-10 07:17:32,538 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:17:36,431 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 07:17:36,432 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:17:36,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:17:36,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [7] total 61 [2019-09-10 07:17:36,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:36,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:17:36,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:17:36,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=2746, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:17:36,434 INFO L87 Difference]: Start difference. First operand 419757 states and 570776 transitions. Second operand 56 states. [2019-09-10 07:20:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:28,849 INFO L93 Difference]: Finished difference Result 788745 states and 1049929 transitions. [2019-09-10 07:20:28,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 625 states. [2019-09-10 07:20:28,849 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 100 [2019-09-10 07:20:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:29,956 INFO L225 Difference]: With dead ends: 788745 [2019-09-10 07:20:29,956 INFO L226 Difference]: Without dead ends: 788607 [2019-09-10 07:20:29,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 654 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191496 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=40637, Invalid=389043, Unknown=0, NotChecked=0, Total=429680 [2019-09-10 07:20:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788607 states. [2019-09-10 07:20:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788607 to 468595. [2019-09-10 07:20:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468595 states. [2019-09-10 07:20:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468595 states to 468595 states and 631126 transitions. [2019-09-10 07:20:52,319 INFO L78 Accepts]: Start accepts. Automaton has 468595 states and 631126 transitions. Word has length 100 [2019-09-10 07:20:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:52,319 INFO L475 AbstractCegarLoop]: Abstraction has 468595 states and 631126 transitions. [2019-09-10 07:20:52,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 07:20:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 468595 states and 631126 transitions. [2019-09-10 07:20:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:20:52,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:52,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:20:52,363 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:52,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:52,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1682149352, now seen corresponding path program 1 times [2019-09-10 07:20:52,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:52,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:52,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:52,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:52,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:20:52,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:20:52,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:20:52,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:20:52,447 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], [78], [81], [84], [87], [90], [93], [96], [99], [103], [106], [117], [119], [122], [133], [135], [138], [149], [151], [154], [157], [160], [165], [167], [170], [181], [183], [186], [189], [191], [194], [195], [197], [206], [217], [219], [232], [240], [259], [261], [264], [272], [275], [278], [281], [283], [285], [323], [325], [338], [346], [365], [376], [378], [381], [384], [387], [389], [391], [429], [431], [444], [452], [489], [490], [494], [495], [496] [2019-09-10 07:20:52,449 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:20:52,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:20:52,463 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:20:52,641 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:20:52,641 INFO L272 AbstractInterpreter]: Visited 88 different actions 496 times. Merged at 46 different actions 350 times. Widened at 18 different actions 54 times. Performed 1756 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1756 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 36 fixpoints after 9 different actions. Largest state had 146 variables. [2019-09-10 07:20:52,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:52,641 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:20:52,744 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 81.89% of their original sizes. [2019-09-10 07:20:52,744 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:20:56,216 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 07:20:56,216 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:20:56,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:20:56,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [7] total 59 [2019-09-10 07:20:56,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:56,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 07:20:56,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 07:20:56,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2530, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 07:20:56,219 INFO L87 Difference]: Start difference. First operand 468595 states and 631126 transitions. Second operand 54 states.