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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:37:51,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:37:51,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:37:51,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:37:51,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:37:51,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:37:51,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:37:51,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:37:51,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:37:51,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:37:51,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:37:51,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:37:51,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:37:51,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:37:51,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:37:51,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:37:51,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:37:51,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:37:51,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:37:51,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:37:51,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:37:51,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:37:51,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:37:51,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:37:51,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:37:51,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:37:51,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:37:51,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:37:51,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:37:51,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:37:51,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:37:51,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:37:51,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:37:51,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:37:51,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:37:51,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:37:51,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:37:51,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:37:51,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:37:51,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:37:51,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:37:51,708 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 08:37:51,730 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:37:51,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:37:51,731 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:37:51,732 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:37:51,732 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:37:51,732 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:37:51,733 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:37:51,733 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:37:51,733 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:37:51,733 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:37:51,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:37:51,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:37:51,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:37:51,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:37:51,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:37:51,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:37:51,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:37:51,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:37:51,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:37:51,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:37:51,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:37:51,738 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:37:51,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:37:51,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:37:51,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:37:51,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:37:51,739 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:37:51,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:37:51,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:37:51,740 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:37:51,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:37:51,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:37:51,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:37:51,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:37:51,814 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:37:51,815 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:37:51,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f516177a5/c87c32236a8c45e1b7657ee23bb4db14/FLAG7b3968501 [2019-09-10 08:37:52,363 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:37:52,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:37:52,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f516177a5/c87c32236a8c45e1b7657ee23bb4db14/FLAG7b3968501 [2019-09-10 08:37:52,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f516177a5/c87c32236a8c45e1b7657ee23bb4db14 [2019-09-10 08:37:52,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:37:52,734 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:37:52,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:37:52,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:37:52,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:37:52,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:37:52" (1/1) ... [2019-09-10 08:37:52,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:52, skipping insertion in model container [2019-09-10 08:37:52,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:37:52" (1/1) ... [2019-09-10 08:37:52,750 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:37:52,802 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:37:53,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:37:53,188 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:37:53,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:37:53,317 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:37:53,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:53 WrapperNode [2019-09-10 08:37:53,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:37:53,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:37:53,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:37:53,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:37:53,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:53" (1/1) ... [2019-09-10 08:37:53,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:53" (1/1) ... [2019-09-10 08:37:53,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:53" (1/1) ... [2019-09-10 08:37:53,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:53" (1/1) ... [2019-09-10 08:37:53,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:53" (1/1) ... [2019-09-10 08:37:53,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:53" (1/1) ... [2019-09-10 08:37:53,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:53" (1/1) ... [2019-09-10 08:37:53,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:37:53,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:37:53,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:37:53,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:37:53,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:53" (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 08:37:53,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:37:53,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:37:53,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:37:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:37:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:37:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:37:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:37:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:37:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:37:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:37:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:37:53,452 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:37:53,452 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:37:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:37:53,453 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:37:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:37:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:37:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:37:54,252 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:37:54,252 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:37:54,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:37:54 BoogieIcfgContainer [2019-09-10 08:37:54,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:37:54,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:37:54,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:37:54,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:37:54,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:37:52" (1/3) ... [2019-09-10 08:37:54,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a5742a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:37:54, skipping insertion in model container [2019-09-10 08:37:54,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:37:53" (2/3) ... [2019-09-10 08:37:54,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a5742a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:37:54, skipping insertion in model container [2019-09-10 08:37:54,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:37:54" (3/3) ... [2019-09-10 08:37:54,261 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:37:54,270 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:37:54,278 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:37:54,295 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:37:54,317 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:37:54,317 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:37:54,318 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:37:54,318 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:37:54,318 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:37:54,318 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:37:54,318 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:37:54,318 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:37:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-10 08:37:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 08:37:54,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:54,352 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 08:37:54,354 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:54,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash -902016562, now seen corresponding path program 1 times [2019-09-10 08:37:54,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:54,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:54,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:54,799 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 08:37:54,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:54,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:37:54,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:54,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:37:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:37:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:37:54,820 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-10 08:37:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:54,932 INFO L93 Difference]: Finished difference Result 237 states and 393 transitions. [2019-09-10 08:37:54,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:37:54,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 08:37:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:54,948 INFO L225 Difference]: With dead ends: 237 [2019-09-10 08:37:54,948 INFO L226 Difference]: Without dead ends: 229 [2019-09-10 08:37:54,950 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 08:37:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-10 08:37:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-09-10 08:37:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 08:37:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 353 transitions. [2019-09-10 08:37:55,007 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 353 transitions. Word has length 66 [2019-09-10 08:37:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:55,008 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 353 transitions. [2019-09-10 08:37:55,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:37:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 353 transitions. [2019-09-10 08:37:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:37:55,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:55,012 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 08:37:55,012 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:55,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:55,013 INFO L82 PathProgramCache]: Analyzing trace with hash 730168783, now seen corresponding path program 1 times [2019-09-10 08:37:55,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:55,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:55,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:55,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:55,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:55,165 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 08:37:55,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:55,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:37:55,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:55,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:37:55,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:37:55,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:37:55,168 INFO L87 Difference]: Start difference. First operand 227 states and 353 transitions. Second operand 3 states. [2019-09-10 08:37:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:55,206 INFO L93 Difference]: Finished difference Result 377 states and 597 transitions. [2019-09-10 08:37:55,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:37:55,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 08:37:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:55,211 INFO L225 Difference]: With dead ends: 377 [2019-09-10 08:37:55,212 INFO L226 Difference]: Without dead ends: 377 [2019-09-10 08:37:55,212 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 08:37:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-10 08:37:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2019-09-10 08:37:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-10 08:37:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 596 transitions. [2019-09-10 08:37:55,254 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 596 transitions. Word has length 68 [2019-09-10 08:37:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:55,256 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 596 transitions. [2019-09-10 08:37:55,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:37:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 596 transitions. [2019-09-10 08:37:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 08:37:55,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:55,261 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 08:37:55,261 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:55,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1550224880, now seen corresponding path program 1 times [2019-09-10 08:37:55,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:55,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:55,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:55,413 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 08:37:55,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:55,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:37:55,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:55,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:37:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:37:55,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:37:55,416 INFO L87 Difference]: Start difference. First operand 375 states and 596 transitions. Second operand 3 states. [2019-09-10 08:37:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:55,454 INFO L93 Difference]: Finished difference Result 657 states and 1053 transitions. [2019-09-10 08:37:55,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:37:55,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 08:37:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:55,465 INFO L225 Difference]: With dead ends: 657 [2019-09-10 08:37:55,466 INFO L226 Difference]: Without dead ends: 657 [2019-09-10 08:37:55,467 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 08:37:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-10 08:37:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2019-09-10 08:37:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-10 08:37:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1052 transitions. [2019-09-10 08:37:55,517 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1052 transitions. Word has length 70 [2019-09-10 08:37:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:55,518 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 1052 transitions. [2019-09-10 08:37:55,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:37:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1052 transitions. [2019-09-10 08:37:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 08:37:55,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:55,531 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 08:37:55,532 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2032710127, now seen corresponding path program 1 times [2019-09-10 08:37:55,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:55,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:55,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:55,692 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 08:37:55,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:55,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:37:55,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:55,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:37:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:37:55,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:37:55,694 INFO L87 Difference]: Start difference. First operand 655 states and 1052 transitions. Second operand 5 states. [2019-09-10 08:37:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:55,871 INFO L93 Difference]: Finished difference Result 1593 states and 2597 transitions. [2019-09-10 08:37:55,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:37:55,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 08:37:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:55,885 INFO L225 Difference]: With dead ends: 1593 [2019-09-10 08:37:55,885 INFO L226 Difference]: Without dead ends: 1593 [2019-09-10 08:37:55,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:37:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2019-09-10 08:37:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1421. [2019-09-10 08:37:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-09-10 08:37:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2313 transitions. [2019-09-10 08:37:55,990 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2313 transitions. Word has length 72 [2019-09-10 08:37:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:55,990 INFO L475 AbstractCegarLoop]: Abstraction has 1421 states and 2313 transitions. [2019-09-10 08:37:55,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:37:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2313 transitions. [2019-09-10 08:37:55,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 08:37:55,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:55,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:55,993 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:55,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:55,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1348885045, now seen corresponding path program 1 times [2019-09-10 08:37:55,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:55,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:55,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:55,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:55,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:56,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:56,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:37:56,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:56,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:37:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:37:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:37:56,129 INFO L87 Difference]: Start difference. First operand 1421 states and 2313 transitions. Second operand 6 states. [2019-09-10 08:37:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:56,351 INFO L93 Difference]: Finished difference Result 4239 states and 6897 transitions. [2019-09-10 08:37:56,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:37:56,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-09-10 08:37:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:56,375 INFO L225 Difference]: With dead ends: 4239 [2019-09-10 08:37:56,375 INFO L226 Difference]: Without dead ends: 4239 [2019-09-10 08:37:56,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4239 states. [2019-09-10 08:37:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4239 to 4136. [2019-09-10 08:37:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4136 states. [2019-09-10 08:37:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 6750 transitions. [2019-09-10 08:37:56,501 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 6750 transitions. Word has length 73 [2019-09-10 08:37:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:56,501 INFO L475 AbstractCegarLoop]: Abstraction has 4136 states and 6750 transitions. [2019-09-10 08:37:56,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:37:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 6750 transitions. [2019-09-10 08:37:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:37:56,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:56,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:56,505 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:56,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1795572021, now seen corresponding path program 1 times [2019-09-10 08:37:56,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:56,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:56,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:56,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:56,568 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 08:37:56,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:56,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:37:56,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:56,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:37:56,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:37:56,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:37:56,569 INFO L87 Difference]: Start difference. First operand 4136 states and 6750 transitions. Second operand 3 states. [2019-09-10 08:37:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:56,627 INFO L93 Difference]: Finished difference Result 6131 states and 9982 transitions. [2019-09-10 08:37:56,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:37:56,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:37:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:56,661 INFO L225 Difference]: With dead ends: 6131 [2019-09-10 08:37:56,662 INFO L226 Difference]: Without dead ends: 6131 [2019-09-10 08:37:56,662 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 08:37:56,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2019-09-10 08:37:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 6129. [2019-09-10 08:37:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2019-09-10 08:37:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 9981 transitions. [2019-09-10 08:37:56,869 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 9981 transitions. Word has length 74 [2019-09-10 08:37:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:56,869 INFO L475 AbstractCegarLoop]: Abstraction has 6129 states and 9981 transitions. [2019-09-10 08:37:56,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:37:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 9981 transitions. [2019-09-10 08:37:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:37:56,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:56,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:56,871 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1561348457, now seen corresponding path program 1 times [2019-09-10 08:37:56,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:56,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:56,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:56,933 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 08:37:56,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:56,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:37:56,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:56,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:37:56,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:37:56,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:37:56,935 INFO L87 Difference]: Start difference. First operand 6129 states and 9981 transitions. Second operand 3 states. [2019-09-10 08:37:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:57,009 INFO L93 Difference]: Finished difference Result 8439 states and 13684 transitions. [2019-09-10 08:37:57,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:37:57,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:37:57,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:57,051 INFO L225 Difference]: With dead ends: 8439 [2019-09-10 08:37:57,051 INFO L226 Difference]: Without dead ends: 8439 [2019-09-10 08:37:57,052 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 08:37:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8439 states. [2019-09-10 08:37:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8439 to 8437. [2019-09-10 08:37:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8437 states. [2019-09-10 08:37:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 13683 transitions. [2019-09-10 08:37:57,253 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 13683 transitions. Word has length 74 [2019-09-10 08:37:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:57,254 INFO L475 AbstractCegarLoop]: Abstraction has 8437 states and 13683 transitions. [2019-09-10 08:37:57,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:37:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 13683 transitions. [2019-09-10 08:37:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:37:57,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:57,255 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:57,255 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1191289000, now seen corresponding path program 1 times [2019-09-10 08:37:57,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:57,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:57,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:57,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:57,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:57,485 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 08:37:57,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:57,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:37:57,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:57,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:37:57,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:37:57,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:37:57,488 INFO L87 Difference]: Start difference. First operand 8437 states and 13683 transitions. Second operand 4 states. [2019-09-10 08:37:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:57,626 INFO L93 Difference]: Finished difference Result 13079 states and 21168 transitions. [2019-09-10 08:37:57,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:37:57,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-10 08:37:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:57,678 INFO L225 Difference]: With dead ends: 13079 [2019-09-10 08:37:57,678 INFO L226 Difference]: Without dead ends: 13079 [2019-09-10 08:37:57,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:37:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13079 states. [2019-09-10 08:37:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13079 to 13035. [2019-09-10 08:37:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13035 states. [2019-09-10 08:37:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13035 states to 13035 states and 21086 transitions. [2019-09-10 08:37:57,898 INFO L78 Accepts]: Start accepts. Automaton has 13035 states and 21086 transitions. Word has length 74 [2019-09-10 08:37:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:57,899 INFO L475 AbstractCegarLoop]: Abstraction has 13035 states and 21086 transitions. [2019-09-10 08:37:57,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:37:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 13035 states and 21086 transitions. [2019-09-10 08:37:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:37:57,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:57,900 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:57,900 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1031073657, now seen corresponding path program 1 times [2019-09-10 08:37:57,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:57,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:57,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:57,996 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 08:37:57,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:57,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:37:57,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:57,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:37:57,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:37:57,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:37:57,999 INFO L87 Difference]: Start difference. First operand 13035 states and 21086 transitions. Second operand 3 states. [2019-09-10 08:37:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:58,116 INFO L93 Difference]: Finished difference Result 17770 states and 28545 transitions. [2019-09-10 08:37:58,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:37:58,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:37:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:58,236 INFO L225 Difference]: With dead ends: 17770 [2019-09-10 08:37:58,236 INFO L226 Difference]: Without dead ends: 17770 [2019-09-10 08:37:58,237 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 08:37:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2019-09-10 08:37:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17768. [2019-09-10 08:37:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17768 states. [2019-09-10 08:37:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17768 states to 17768 states and 28544 transitions. [2019-09-10 08:37:58,569 INFO L78 Accepts]: Start accepts. Automaton has 17768 states and 28544 transitions. Word has length 74 [2019-09-10 08:37:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:58,570 INFO L475 AbstractCegarLoop]: Abstraction has 17768 states and 28544 transitions. [2019-09-10 08:37:58,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:37:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 17768 states and 28544 transitions. [2019-09-10 08:37:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 08:37:58,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:58,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:58,572 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:58,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1672252252, now seen corresponding path program 1 times [2019-09-10 08:37:58,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:58,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:58,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:58,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:58,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:58,732 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 08:37:58,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:58,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:37:58,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:58,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:37:58,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:37:58,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:37:58,737 INFO L87 Difference]: Start difference. First operand 17768 states and 28544 transitions. Second operand 4 states. [2019-09-10 08:37:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:59,575 INFO L93 Difference]: Finished difference Result 39448 states and 63337 transitions. [2019-09-10 08:37:59,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:37:59,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-10 08:37:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:59,699 INFO L225 Difference]: With dead ends: 39448 [2019-09-10 08:37:59,700 INFO L226 Difference]: Without dead ends: 39448 [2019-09-10 08:37:59,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:37:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39448 states. [2019-09-10 08:38:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39448 to 26203. [2019-09-10 08:38:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26203 states. [2019-09-10 08:38:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26203 states to 26203 states and 41961 transitions. [2019-09-10 08:38:00,666 INFO L78 Accepts]: Start accepts. Automaton has 26203 states and 41961 transitions. Word has length 75 [2019-09-10 08:38:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:00,666 INFO L475 AbstractCegarLoop]: Abstraction has 26203 states and 41961 transitions. [2019-09-10 08:38:00,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:38:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26203 states and 41961 transitions. [2019-09-10 08:38:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:38:00,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:00,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:00,668 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:00,668 INFO L82 PathProgramCache]: Analyzing trace with hash -772989972, now seen corresponding path program 1 times [2019-09-10 08:38:00,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:00,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:00,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:00,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:00,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:00,828 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 08:38:00,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:00,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:38:00,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:00,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:38:00,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:38:00,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:00,830 INFO L87 Difference]: Start difference. First operand 26203 states and 41961 transitions. Second operand 5 states. [2019-09-10 08:38:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:01,099 INFO L93 Difference]: Finished difference Result 28175 states and 45033 transitions. [2019-09-10 08:38:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:38:01,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:38:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:01,162 INFO L225 Difference]: With dead ends: 28175 [2019-09-10 08:38:01,162 INFO L226 Difference]: Without dead ends: 28175 [2019-09-10 08:38:01,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28175 states. [2019-09-10 08:38:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28175 to 26203. [2019-09-10 08:38:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26203 states. [2019-09-10 08:38:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26203 states to 26203 states and 41826 transitions. [2019-09-10 08:38:01,991 INFO L78 Accepts]: Start accepts. Automaton has 26203 states and 41826 transitions. Word has length 77 [2019-09-10 08:38:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:01,992 INFO L475 AbstractCegarLoop]: Abstraction has 26203 states and 41826 transitions. [2019-09-10 08:38:01,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:38:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 26203 states and 41826 transitions. [2019-09-10 08:38:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:38:01,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:01,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:01,994 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash -579116247, now seen corresponding path program 1 times [2019-09-10 08:38:01,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:01,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:01,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:01,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:02,294 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 08:38:02,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:02,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:38:02,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:02,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:38:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:38:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:02,296 INFO L87 Difference]: Start difference. First operand 26203 states and 41826 transitions. Second operand 5 states. [2019-09-10 08:38:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:02,715 INFO L93 Difference]: Finished difference Result 58799 states and 93903 transitions. [2019-09-10 08:38:02,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:38:02,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 08:38:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:02,898 INFO L225 Difference]: With dead ends: 58799 [2019-09-10 08:38:02,898 INFO L226 Difference]: Without dead ends: 58799 [2019-09-10 08:38:02,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58799 states. [2019-09-10 08:38:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58799 to 36841. [2019-09-10 08:38:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36841 states. [2019-09-10 08:38:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36841 states to 36841 states and 58607 transitions. [2019-09-10 08:38:04,374 INFO L78 Accepts]: Start accepts. Automaton has 36841 states and 58607 transitions. Word has length 80 [2019-09-10 08:38:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:04,374 INFO L475 AbstractCegarLoop]: Abstraction has 36841 states and 58607 transitions. [2019-09-10 08:38:04,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:38:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 36841 states and 58607 transitions. [2019-09-10 08:38:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:38:04,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:04,376 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:04,376 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash -774643767, now seen corresponding path program 1 times [2019-09-10 08:38:04,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:04,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:04,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:04,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:04,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:04,474 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 08:38:04,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:04,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:38:04,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:04,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:38:04,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:38:04,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:04,476 INFO L87 Difference]: Start difference. First operand 36841 states and 58607 transitions. Second operand 5 states. [2019-09-10 08:38:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:04,728 INFO L93 Difference]: Finished difference Result 65270 states and 102837 transitions. [2019-09-10 08:38:04,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:38:04,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 08:38:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:04,900 INFO L225 Difference]: With dead ends: 65270 [2019-09-10 08:38:04,900 INFO L226 Difference]: Without dead ends: 65270 [2019-09-10 08:38:04,901 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 08:38:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65270 states. [2019-09-10 08:38:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65270 to 37697. [2019-09-10 08:38:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37697 states. [2019-09-10 08:38:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37697 states to 37697 states and 59454 transitions. [2019-09-10 08:38:05,928 INFO L78 Accepts]: Start accepts. Automaton has 37697 states and 59454 transitions. Word has length 81 [2019-09-10 08:38:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:05,929 INFO L475 AbstractCegarLoop]: Abstraction has 37697 states and 59454 transitions. [2019-09-10 08:38:05,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:38:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 37697 states and 59454 transitions. [2019-09-10 08:38:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:38:05,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:05,934 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:05,934 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1389875202, now seen corresponding path program 1 times [2019-09-10 08:38:05,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:05,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:05,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:38:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:38:06,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:06,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:38:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:38:06,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:06,073 INFO L87 Difference]: Start difference. First operand 37697 states and 59454 transitions. Second operand 5 states. [2019-09-10 08:38:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:06,275 INFO L93 Difference]: Finished difference Result 43482 states and 68439 transitions. [2019-09-10 08:38:06,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:38:06,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 08:38:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:06,394 INFO L225 Difference]: With dead ends: 43482 [2019-09-10 08:38:06,394 INFO L226 Difference]: Without dead ends: 43482 [2019-09-10 08:38:06,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43482 states. [2019-09-10 08:38:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43482 to 42943. [2019-09-10 08:38:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42943 states. [2019-09-10 08:38:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42943 states to 42943 states and 67653 transitions. [2019-09-10 08:38:08,197 INFO L78 Accepts]: Start accepts. Automaton has 42943 states and 67653 transitions. Word has length 105 [2019-09-10 08:38:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:08,198 INFO L475 AbstractCegarLoop]: Abstraction has 42943 states and 67653 transitions. [2019-09-10 08:38:08,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:38:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 42943 states and 67653 transitions. [2019-09-10 08:38:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:38:08,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:08,201 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:08,203 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash 451828384, now seen corresponding path program 1 times [2019-09-10 08:38:08,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:08,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:08,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:08,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:08,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:38:08,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:08,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:38:08,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:08,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:38:08,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:38:08,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:08,366 INFO L87 Difference]: Start difference. First operand 42943 states and 67653 transitions. Second operand 5 states. [2019-09-10 08:38:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:08,592 INFO L93 Difference]: Finished difference Result 47113 states and 74288 transitions. [2019-09-10 08:38:08,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:38:08,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 08:38:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:08,666 INFO L225 Difference]: With dead ends: 47113 [2019-09-10 08:38:08,666 INFO L226 Difference]: Without dead ends: 47113 [2019-09-10 08:38:08,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:38:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47113 states. [2019-09-10 08:38:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47113 to 45863. [2019-09-10 08:38:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45863 states. [2019-09-10 08:38:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45863 states to 45863 states and 72269 transitions. [2019-09-10 08:38:09,487 INFO L78 Accepts]: Start accepts. Automaton has 45863 states and 72269 transitions. Word has length 105 [2019-09-10 08:38:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:09,487 INFO L475 AbstractCegarLoop]: Abstraction has 45863 states and 72269 transitions. [2019-09-10 08:38:09,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:38:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 45863 states and 72269 transitions. [2019-09-10 08:38:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:38:09,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:09,492 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:09,492 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:09,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2140593730, now seen corresponding path program 1 times [2019-09-10 08:38:09,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:09,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:09,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:09,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:09,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:09,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:38:09,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:38:09,620 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 08:38:09,622 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [155], [183], [186], [201], [204], [207], [209], [211], [214], [217], [220], [223], [230], [238], [240], [243], [244], [246], [255], [258], [269], [272], [282], [290], [294], [296], [299], [330], [340], [350], [366], [369], [400], [410], [420], [436], [439], [470], [480], [490], [605], [606], [610], [611], [612] [2019-09-10 08:38:09,670 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:38:09,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:38:09,864 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:38:10,216 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:38:10,221 INFO L272 AbstractInterpreter]: Visited 87 different actions 278 times. Merged at 35 different actions 176 times. Widened at 16 different actions 17 times. Performed 979 root evaluator evaluations with a maximum evaluation depth of 5. Performed 979 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 174 variables. [2019-09-10 08:38:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:10,226 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:38:10,536 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 85.06% of their original sizes. [2019-09-10 08:38:10,537 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:38:15,275 INFO L420 sIntCurrentIteration]: We unified 104 AI predicates to 104 [2019-09-10 08:38:15,275 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:38:15,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:38:15,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [5] total 66 [2019-09-10 08:38:15,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:15,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 08:38:15,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 08:38:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=3408, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:38:15,279 INFO L87 Difference]: Start difference. First operand 45863 states and 72269 transitions. Second operand 63 states. [2019-09-10 08:39:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:21,729 INFO L93 Difference]: Finished difference Result 222156 states and 344073 transitions. [2019-09-10 08:39:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-10 08:39:21,729 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 105 [2019-09-10 08:39:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:22,344 INFO L225 Difference]: With dead ends: 222156 [2019-09-10 08:39:22,345 INFO L226 Difference]: Without dead ends: 222156 [2019-09-10 08:39:22,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10177 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=3607, Invalid=24115, Unknown=0, NotChecked=0, Total=27722 [2019-09-10 08:39:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222156 states. [2019-09-10 08:39:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222156 to 74871. [2019-09-10 08:39:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74871 states. [2019-09-10 08:39:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74871 states to 74871 states and 117101 transitions. [2019-09-10 08:39:24,812 INFO L78 Accepts]: Start accepts. Automaton has 74871 states and 117101 transitions. Word has length 105 [2019-09-10 08:39:24,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:24,812 INFO L475 AbstractCegarLoop]: Abstraction has 74871 states and 117101 transitions. [2019-09-10 08:39:24,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 08:39:24,813 INFO L276 IsEmpty]: Start isEmpty. Operand 74871 states and 117101 transitions. [2019-09-10 08:39:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:39:24,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:24,819 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:24,820 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash -383639073, now seen corresponding path program 1 times [2019-09-10 08:39:24,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:24,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:24,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:39:24,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:24,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:24,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:24,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:24,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:24,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:24,887 INFO L87 Difference]: Start difference. First operand 74871 states and 117101 transitions. Second operand 3 states. [2019-09-10 08:39:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:25,259 INFO L93 Difference]: Finished difference Result 149728 states and 234180 transitions. [2019-09-10 08:39:25,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:25,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:39:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:25,930 INFO L225 Difference]: With dead ends: 149728 [2019-09-10 08:39:25,930 INFO L226 Difference]: Without dead ends: 149728 [2019-09-10 08:39:25,931 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 08:39:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149728 states. [2019-09-10 08:39:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149728 to 74874. [2019-09-10 08:39:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74874 states. [2019-09-10 08:39:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74874 states to 74874 states and 117105 transitions. [2019-09-10 08:39:29,299 INFO L78 Accepts]: Start accepts. Automaton has 74874 states and 117105 transitions. Word has length 106 [2019-09-10 08:39:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:29,300 INFO L475 AbstractCegarLoop]: Abstraction has 74874 states and 117105 transitions. [2019-09-10 08:39:29,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 74874 states and 117105 transitions. [2019-09-10 08:39:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:39:29,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:29,304 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:29,304 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:29,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:29,305 INFO L82 PathProgramCache]: Analyzing trace with hash -900487682, now seen corresponding path program 1 times [2019-09-10 08:39:29,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:29,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:29,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:29,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:29,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:39:29,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:29,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:29,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:29,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:29,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:29,351 INFO L87 Difference]: Start difference. First operand 74874 states and 117105 transitions. Second operand 3 states. [2019-09-10 08:39:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:29,751 INFO L93 Difference]: Finished difference Result 149714 states and 234154 transitions. [2019-09-10 08:39:29,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:29,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:39:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:30,284 INFO L225 Difference]: With dead ends: 149714 [2019-09-10 08:39:30,284 INFO L226 Difference]: Without dead ends: 149714 [2019-09-10 08:39:30,285 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 08:39:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149714 states. [2019-09-10 08:39:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149714 to 74876. [2019-09-10 08:39:31,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74876 states. [2019-09-10 08:39:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74876 states to 74876 states and 117107 transitions. [2019-09-10 08:39:32,039 INFO L78 Accepts]: Start accepts. Automaton has 74876 states and 117107 transitions. Word has length 106 [2019-09-10 08:39:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:32,039 INFO L475 AbstractCegarLoop]: Abstraction has 74876 states and 117107 transitions. [2019-09-10 08:39:32,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 74876 states and 117107 transitions. [2019-09-10 08:39:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:39:32,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:32,044 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:32,044 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:32,045 INFO L82 PathProgramCache]: Analyzing trace with hash 134984115, now seen corresponding path program 1 times [2019-09-10 08:39:32,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:32,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:32,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:32,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:32,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:39:32,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:32,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:32,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:32,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:32,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:32,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:32,123 INFO L87 Difference]: Start difference. First operand 74876 states and 117107 transitions. Second operand 3 states. [2019-09-10 08:39:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:32,419 INFO L93 Difference]: Finished difference Result 100583 states and 157724 transitions. [2019-09-10 08:39:32,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:32,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:39:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:32,530 INFO L225 Difference]: With dead ends: 100583 [2019-09-10 08:39:32,530 INFO L226 Difference]: Without dead ends: 100583 [2019-09-10 08:39:32,531 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 08:39:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100583 states. [2019-09-10 08:39:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100583 to 100400. [2019-09-10 08:39:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100400 states. [2019-09-10 08:39:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100400 states to 100400 states and 157542 transitions. [2019-09-10 08:39:33,437 INFO L78 Accepts]: Start accepts. Automaton has 100400 states and 157542 transitions. Word has length 106 [2019-09-10 08:39:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:33,437 INFO L475 AbstractCegarLoop]: Abstraction has 100400 states and 157542 transitions. [2019-09-10 08:39:33,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 100400 states and 157542 transitions. [2019-09-10 08:39:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:39:33,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:33,443 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:33,444 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:33,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash 62486747, now seen corresponding path program 1 times [2019-09-10 08:39:33,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:33,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:33,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:39:33,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:33,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:33,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:33,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:33,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:33,505 INFO L87 Difference]: Start difference. First operand 100400 states and 157542 transitions. Second operand 3 states. [2019-09-10 08:39:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:34,493 INFO L93 Difference]: Finished difference Result 200752 states and 315004 transitions. [2019-09-10 08:39:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:34,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:39:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:34,734 INFO L225 Difference]: With dead ends: 200752 [2019-09-10 08:39:34,734 INFO L226 Difference]: Without dead ends: 200752 [2019-09-10 08:39:34,735 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 08:39:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200752 states. [2019-09-10 08:39:35,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200752 to 100406. [2019-09-10 08:39:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100406 states. [2019-09-10 08:39:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100406 states to 100406 states and 157550 transitions. [2019-09-10 08:39:36,106 INFO L78 Accepts]: Start accepts. Automaton has 100406 states and 157550 transitions. Word has length 106 [2019-09-10 08:39:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:36,107 INFO L475 AbstractCegarLoop]: Abstraction has 100406 states and 157550 transitions. [2019-09-10 08:39:36,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 100406 states and 157550 transitions. [2019-09-10 08:39:36,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:39:36,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:36,111 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:36,112 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:36,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:36,112 INFO L82 PathProgramCache]: Analyzing trace with hash -472030852, now seen corresponding path program 1 times [2019-09-10 08:39:36,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:36,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:36,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:36,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:36,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:39:36,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:36,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:36,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:36,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:36,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:36,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:36,155 INFO L87 Difference]: Start difference. First operand 100406 states and 157550 transitions. Second operand 3 states. [2019-09-10 08:39:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:37,215 INFO L93 Difference]: Finished difference Result 200754 states and 315006 transitions. [2019-09-10 08:39:37,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:37,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:39:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:37,443 INFO L225 Difference]: With dead ends: 200754 [2019-09-10 08:39:37,443 INFO L226 Difference]: Without dead ends: 200754 [2019-09-10 08:39:37,443 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 08:39:37,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200754 states. [2019-09-10 08:39:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200754 to 100408. [2019-09-10 08:39:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100408 states. [2019-09-10 08:39:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100408 states to 100408 states and 157552 transitions. [2019-09-10 08:39:38,768 INFO L78 Accepts]: Start accepts. Automaton has 100408 states and 157552 transitions. Word has length 106 [2019-09-10 08:39:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:38,769 INFO L475 AbstractCegarLoop]: Abstraction has 100408 states and 157552 transitions. [2019-09-10 08:39:38,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 100408 states and 157552 transitions. [2019-09-10 08:39:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:39:38,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:38,774 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:38,775 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:38,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:38,775 INFO L82 PathProgramCache]: Analyzing trace with hash 746984925, now seen corresponding path program 1 times [2019-09-10 08:39:38,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:38,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:38,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:39:38,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:38,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:38,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:38,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:38,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:38,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:38,824 INFO L87 Difference]: Start difference. First operand 100408 states and 157552 transitions. Second operand 3 states. [2019-09-10 08:39:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:39,197 INFO L93 Difference]: Finished difference Result 200784 states and 315052 transitions. [2019-09-10 08:39:39,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:39,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:39:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:39,442 INFO L225 Difference]: With dead ends: 200784 [2019-09-10 08:39:39,442 INFO L226 Difference]: Without dead ends: 200784 [2019-09-10 08:39:39,442 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 08:39:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200784 states. [2019-09-10 08:39:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200784 to 100414. [2019-09-10 08:39:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100414 states. [2019-09-10 08:39:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100414 states to 100414 states and 157560 transitions. [2019-09-10 08:39:41,472 INFO L78 Accepts]: Start accepts. Automaton has 100414 states and 157560 transitions. Word has length 106 [2019-09-10 08:39:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:41,473 INFO L475 AbstractCegarLoop]: Abstraction has 100414 states and 157560 transitions. [2019-09-10 08:39:41,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 100414 states and 157560 transitions. [2019-09-10 08:39:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:39:41,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:41,476 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:41,476 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:41,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:41,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1426692480, now seen corresponding path program 1 times [2019-09-10 08:39:41,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:41,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:41,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:41,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:39:41,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:41,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:41,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:41,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:41,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:41,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:41,517 INFO L87 Difference]: Start difference. First operand 100414 states and 157560 transitions. Second operand 3 states. [2019-09-10 08:39:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:41,985 INFO L93 Difference]: Finished difference Result 200810 states and 315092 transitions. [2019-09-10 08:39:41,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:41,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:39:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:42,237 INFO L225 Difference]: With dead ends: 200810 [2019-09-10 08:39:42,237 INFO L226 Difference]: Without dead ends: 200810 [2019-09-10 08:39:42,237 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 08:39:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200810 states. [2019-09-10 08:39:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200810 to 100416. [2019-09-10 08:39:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100416 states. [2019-09-10 08:39:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100416 states to 100416 states and 157562 transitions. [2019-09-10 08:39:46,085 INFO L78 Accepts]: Start accepts. Automaton has 100416 states and 157562 transitions. Word has length 106 [2019-09-10 08:39:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:46,085 INFO L475 AbstractCegarLoop]: Abstraction has 100416 states and 157562 transitions. [2019-09-10 08:39:46,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 100416 states and 157562 transitions. [2019-09-10 08:39:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:39:46,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:46,089 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:46,089 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:46,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2136006622, now seen corresponding path program 1 times [2019-09-10 08:39:46,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:46,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:46,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:46,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:46,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:46,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:39:46,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:39:46,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 08:39:46,180 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [155], [183], [186], [201], [204], [207], [209], [211], [214], [217], [220], [223], [230], [238], [240], [243], [244], [246], [255], [258], [269], [272], [282], [290], [294], [296], [299], [330], [340], [350], [366], [369], [400], [410], [420], [436], [439], [470], [480], [490], [578], [581], [587], [605], [606], [610], [611], [612] [2019-09-10 08:39:46,189 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:39:46,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:39:46,214 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:39:46,330 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:39:46,331 INFO L272 AbstractInterpreter]: Visited 89 different actions 285 times. Merged at 35 different actions 181 times. Widened at 16 different actions 19 times. Performed 990 root evaluator evaluations with a maximum evaluation depth of 5. Performed 990 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 174 variables. [2019-09-10 08:39:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:46,331 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:39:46,496 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 85.25% of their original sizes. [2019-09-10 08:39:46,497 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:39:51,218 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 08:39:51,219 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:39:51,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:39:51,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [5] total 65 [2019-09-10 08:39:51,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:51,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 08:39:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 08:39:51,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3302, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 08:39:51,222 INFO L87 Difference]: Start difference. First operand 100416 states and 157562 transitions. Second operand 62 states. [2019-09-10 08:41:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:12,787 INFO L93 Difference]: Finished difference Result 301709 states and 468139 transitions. [2019-09-10 08:41:12,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-10 08:41:12,787 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 107 [2019-09-10 08:41:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:13,265 INFO L225 Difference]: With dead ends: 301709 [2019-09-10 08:41:13,266 INFO L226 Difference]: Without dead ends: 301709 [2019-09-10 08:41:13,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10508 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3872, Invalid=24520, Unknown=0, NotChecked=0, Total=28392 [2019-09-10 08:41:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301709 states. [2019-09-10 08:41:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301709 to 100612. [2019-09-10 08:41:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100612 states. [2019-09-10 08:41:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100612 states to 100612 states and 157835 transitions. [2019-09-10 08:41:15,971 INFO L78 Accepts]: Start accepts. Automaton has 100612 states and 157835 transitions. Word has length 107 [2019-09-10 08:41:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:15,971 INFO L475 AbstractCegarLoop]: Abstraction has 100612 states and 157835 transitions. [2019-09-10 08:41:15,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 08:41:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 100612 states and 157835 transitions. [2019-09-10 08:41:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:41:15,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:15,975 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:15,975 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:15,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash 535566749, now seen corresponding path program 1 times [2019-09-10 08:41:15,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:15,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:15,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:15,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:15,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:41:16,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:16,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:16,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:16,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:16,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:16,079 INFO L87 Difference]: Start difference. First operand 100612 states and 157835 transitions. Second operand 4 states. [2019-09-10 08:41:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:16,417 INFO L93 Difference]: Finished difference Result 100639 states and 157868 transitions. [2019-09-10 08:41:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:41:16,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-10 08:41:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:16,695 INFO L225 Difference]: With dead ends: 100639 [2019-09-10 08:41:16,695 INFO L226 Difference]: Without dead ends: 100612 [2019-09-10 08:41:16,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100612 states. [2019-09-10 08:41:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100612 to 100603. [2019-09-10 08:41:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100603 states. [2019-09-10 08:41:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100603 states to 100603 states and 157817 transitions. [2019-09-10 08:41:18,520 INFO L78 Accepts]: Start accepts. Automaton has 100603 states and 157817 transitions. Word has length 107 [2019-09-10 08:41:18,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:18,521 INFO L475 AbstractCegarLoop]: Abstraction has 100603 states and 157817 transitions. [2019-09-10 08:41:18,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 100603 states and 157817 transitions. [2019-09-10 08:41:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:41:18,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:18,524 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:18,524 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:18,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:18,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1363669356, now seen corresponding path program 1 times [2019-09-10 08:41:18,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:18,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:18,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:18,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:18,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:18,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:41:18,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:41:18,612 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 08:41:18,613 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [155], [183], [186], [201], [204], [207], [209], [211], [214], [217], [220], [223], [230], [238], [240], [243], [244], [246], [255], [258], [269], [272], [282], [290], [294], [296], [299], [330], [340], [350], [366], [369], [400], [410], [420], [436], [439], [470], [480], [490], [565], [568], [574], [605], [606], [610], [611], [612] [2019-09-10 08:41:18,616 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:41:18,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:41:18,642 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:41:18,802 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:41:18,803 INFO L272 AbstractInterpreter]: Visited 89 different actions 285 times. Merged at 35 different actions 181 times. Widened at 16 different actions 19 times. Performed 990 root evaluator evaluations with a maximum evaluation depth of 5. Performed 990 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 174 variables. [2019-09-10 08:41:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:18,803 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:41:18,965 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 85.25% of their original sizes. [2019-09-10 08:41:18,966 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:41:23,165 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 08:41:23,165 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:41:23,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:41:23,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [5] total 65 [2019-09-10 08:41:23,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:23,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 08:41:23,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 08:41:23,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3302, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 08:41:23,167 INFO L87 Difference]: Start difference. First operand 100603 states and 157817 transitions. Second operand 62 states. [2019-09-10 08:42:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:36,831 INFO L93 Difference]: Finished difference Result 301882 states and 468368 transitions. [2019-09-10 08:42:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-10 08:42:36,831 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 107 [2019-09-10 08:42:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:37,259 INFO L225 Difference]: With dead ends: 301882 [2019-09-10 08:42:37,259 INFO L226 Difference]: Without dead ends: 301882 [2019-09-10 08:42:37,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10508 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3872, Invalid=24520, Unknown=0, NotChecked=0, Total=28392 [2019-09-10 08:42:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301882 states. [2019-09-10 08:42:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301882 to 100605. [2019-09-10 08:42:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100605 states. [2019-09-10 08:42:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100605 states to 100605 states and 157819 transitions. [2019-09-10 08:42:39,896 INFO L78 Accepts]: Start accepts. Automaton has 100605 states and 157819 transitions. Word has length 107 [2019-09-10 08:42:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:39,896 INFO L475 AbstractCegarLoop]: Abstraction has 100605 states and 157819 transitions. [2019-09-10 08:42:39,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 08:42:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 100605 states and 157819 transitions. [2019-09-10 08:42:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:42:39,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:39,900 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:39,900 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:39,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:39,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1864454230, now seen corresponding path program 1 times [2019-09-10 08:42:39,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:39,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:39,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:39,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:39,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:39,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:39,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:39,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:39,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:39,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:39,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:39,957 INFO L87 Difference]: Start difference. First operand 100605 states and 157819 transitions. Second operand 3 states. [2019-09-10 08:42:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:40,618 INFO L93 Difference]: Finished difference Result 195166 states and 303641 transitions. [2019-09-10 08:42:40,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:40,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:42:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:40,982 INFO L225 Difference]: With dead ends: 195166 [2019-09-10 08:42:40,983 INFO L226 Difference]: Without dead ends: 195166 [2019-09-10 08:42:40,983 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 08:42:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195166 states. [2019-09-10 08:42:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195166 to 195164. [2019-09-10 08:42:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195164 states. [2019-09-10 08:42:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195164 states to 195164 states and 303640 transitions. [2019-09-10 08:42:43,936 INFO L78 Accepts]: Start accepts. Automaton has 195164 states and 303640 transitions. Word has length 107 [2019-09-10 08:42:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:43,937 INFO L475 AbstractCegarLoop]: Abstraction has 195164 states and 303640 transitions. [2019-09-10 08:42:43,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 195164 states and 303640 transitions. [2019-09-10 08:42:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:42:43,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:43,943 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:43,943 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:43,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash 720900890, now seen corresponding path program 1 times [2019-09-10 08:42:43,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:43,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:43,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:43,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:43,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:42:44,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:44,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:42:44,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:44,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:42:44,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:42:44,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:42:44,119 INFO L87 Difference]: Start difference. First operand 195164 states and 303640 transitions. Second operand 4 states. [2019-09-10 08:42:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:44,808 INFO L93 Difference]: Finished difference Result 316470 states and 492842 transitions. [2019-09-10 08:42:44,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:42:44,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-10 08:42:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:45,206 INFO L225 Difference]: With dead ends: 316470 [2019-09-10 08:42:45,207 INFO L226 Difference]: Without dead ends: 316470 [2019-09-10 08:42:45,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:42:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316470 states. [2019-09-10 08:42:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316470 to 282007. [2019-09-10 08:42:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282007 states. [2019-09-10 08:42:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282007 states to 282007 states and 439411 transitions. [2019-09-10 08:42:52,466 INFO L78 Accepts]: Start accepts. Automaton has 282007 states and 439411 transitions. Word has length 107 [2019-09-10 08:42:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:52,466 INFO L475 AbstractCegarLoop]: Abstraction has 282007 states and 439411 transitions. [2019-09-10 08:42:52,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:42:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 282007 states and 439411 transitions. [2019-09-10 08:42:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:42:52,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:52,471 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:52,471 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:52,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1871521224, now seen corresponding path program 1 times [2019-09-10 08:42:52,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:52,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:52,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:52,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:52,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:52,531 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 08:42:52,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:52,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:52,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:52,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:52,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:52,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:52,533 INFO L87 Difference]: Start difference. First operand 282007 states and 439411 transitions. Second operand 3 states. [2019-09-10 08:42:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:53,127 INFO L93 Difference]: Finished difference Result 240198 states and 371923 transitions. [2019-09-10 08:42:53,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:53,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:42:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:54,557 INFO L225 Difference]: With dead ends: 240198 [2019-09-10 08:42:54,557 INFO L226 Difference]: Without dead ends: 240198 [2019-09-10 08:42:54,557 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 08:42:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240198 states. [2019-09-10 08:42:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240198 to 239986. [2019-09-10 08:42:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239986 states. [2019-09-10 08:42:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239986 states to 239986 states and 371643 transitions. [2019-09-10 08:42:57,785 INFO L78 Accepts]: Start accepts. Automaton has 239986 states and 371643 transitions. Word has length 107 [2019-09-10 08:42:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:57,785 INFO L475 AbstractCegarLoop]: Abstraction has 239986 states and 371643 transitions. [2019-09-10 08:42:57,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 239986 states and 371643 transitions. [2019-09-10 08:42:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:42:57,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:57,788 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:57,788 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:57,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:57,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1819747193, now seen corresponding path program 1 times [2019-09-10 08:42:57,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:57,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:57,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:57,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:57,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:43:03,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:03,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:03,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:03,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:03,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:03,656 INFO L87 Difference]: Start difference. First operand 239986 states and 371643 transitions. Second operand 4 states. [2019-09-10 08:43:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:04,571 INFO L93 Difference]: Finished difference Result 416655 states and 646636 transitions. [2019-09-10 08:43:04,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:43:04,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 08:43:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:05,135 INFO L225 Difference]: With dead ends: 416655 [2019-09-10 08:43:05,135 INFO L226 Difference]: Without dead ends: 416655 [2019-09-10 08:43:05,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416655 states. [2019-09-10 08:43:09,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416655 to 363827. [2019-09-10 08:43:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363827 states. [2019-09-10 08:43:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363827 states to 363827 states and 564624 transitions. [2019-09-10 08:43:17,803 INFO L78 Accepts]: Start accepts. Automaton has 363827 states and 564624 transitions. Word has length 108 [2019-09-10 08:43:17,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:17,803 INFO L475 AbstractCegarLoop]: Abstraction has 363827 states and 564624 transitions. [2019-09-10 08:43:17,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 363827 states and 564624 transitions. [2019-09-10 08:43:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:43:17,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:17,807 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:17,807 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1697967367, now seen corresponding path program 1 times [2019-09-10 08:43:17,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:17,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:17,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:17,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:17,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:17,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:17,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:17,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:17,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:17,863 INFO L87 Difference]: Start difference. First operand 363827 states and 564624 transitions. Second operand 3 states. [2019-09-10 08:43:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:20,765 INFO L93 Difference]: Finished difference Result 707288 states and 1088299 transitions. [2019-09-10 08:43:20,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:20,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 08:43:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:21,768 INFO L225 Difference]: With dead ends: 707288 [2019-09-10 08:43:21,768 INFO L226 Difference]: Without dead ends: 707288 [2019-09-10 08:43:21,769 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 08:43:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707288 states. [2019-09-10 08:43:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707288 to 707286. [2019-09-10 08:43:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707286 states. [2019-09-10 08:43:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707286 states to 707286 states and 1088298 transitions. [2019-09-10 08:43:43,562 INFO L78 Accepts]: Start accepts. Automaton has 707286 states and 1088298 transitions. Word has length 108 [2019-09-10 08:43:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:43,563 INFO L475 AbstractCegarLoop]: Abstraction has 707286 states and 1088298 transitions. [2019-09-10 08:43:43,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 707286 states and 1088298 transitions. [2019-09-10 08:43:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:43:43,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:43,567 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:43,567 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:43,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:43,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2063874521, now seen corresponding path program 1 times [2019-09-10 08:43:43,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:43,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:43,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:43,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:43,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:43:43,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:43,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:43,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:43,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:43,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:43,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:43,628 INFO L87 Difference]: Start difference. First operand 707286 states and 1088298 transitions. Second operand 3 states. [2019-09-10 08:43:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:53,013 INFO L93 Difference]: Finished difference Result 992443 states and 1527500 transitions. [2019-09-10 08:43:53,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:53,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:43:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:55,462 INFO L225 Difference]: With dead ends: 992443 [2019-09-10 08:43:55,462 INFO L226 Difference]: Without dead ends: 992443 [2019-09-10 08:43:55,462 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 08:43:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992443 states. [2019-09-10 08:44:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992443 to 713169. [2019-09-10 08:44:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713169 states. [2019-09-10 08:44:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713169 states to 713169 states and 1097083 transitions. [2019-09-10 08:44:13,490 INFO L78 Accepts]: Start accepts. Automaton has 713169 states and 1097083 transitions. Word has length 109 [2019-09-10 08:44:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:13,490 INFO L475 AbstractCegarLoop]: Abstraction has 713169 states and 1097083 transitions. [2019-09-10 08:44:13,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 713169 states and 1097083 transitions. [2019-09-10 08:44:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:44:13,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:13,494 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:13,494 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:13,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1299926249, now seen corresponding path program 1 times [2019-09-10 08:44:13,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:13,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:13,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:13,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:13,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:44:13,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:13,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:13,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:13,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:13,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:13,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:13,549 INFO L87 Difference]: Start difference. First operand 713169 states and 1097083 transitions. Second operand 3 states. [2019-09-10 08:44:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:25,083 INFO L93 Difference]: Finished difference Result 1008327 states and 1553991 transitions. [2019-09-10 08:44:25,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:25,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:44:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:27,756 INFO L225 Difference]: With dead ends: 1008327 [2019-09-10 08:44:27,756 INFO L226 Difference]: Without dead ends: 1008327 [2019-09-10 08:44:27,757 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 08:44:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008327 states. [2019-09-10 08:44:45,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008327 to 976565. [2019-09-10 08:44:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976565 states. [2019-09-10 08:44:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976565 states to 976565 states and 1496678 transitions. [2019-09-10 08:44:59,158 INFO L78 Accepts]: Start accepts. Automaton has 976565 states and 1496678 transitions. Word has length 109 [2019-09-10 08:44:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:59,158 INFO L475 AbstractCegarLoop]: Abstraction has 976565 states and 1496678 transitions. [2019-09-10 08:44:59,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 976565 states and 1496678 transitions. [2019-09-10 08:44:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:44:59,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:59,162 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:59,162 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:59,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:59,162 INFO L82 PathProgramCache]: Analyzing trace with hash -652358726, now seen corresponding path program 1 times [2019-09-10 08:44:59,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:59,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:59,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:59,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:59,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:59,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:59,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:59,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:59,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:59,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:59,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:59,227 INFO L87 Difference]: Start difference. First operand 976565 states and 1496678 transitions. Second operand 3 states. [2019-09-10 08:45:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:08,345 INFO L93 Difference]: Finished difference Result 416192 states and 633574 transitions. [2019-09-10 08:45:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:08,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:45:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:08,929 INFO L225 Difference]: With dead ends: 416192 [2019-09-10 08:45:08,930 INFO L226 Difference]: Without dead ends: 416192 [2019-09-10 08:45:08,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416192 states. [2019-09-10 08:45:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416192 to 306617. [2019-09-10 08:45:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306617 states. [2019-09-10 08:45:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306617 states to 306617 states and 469563 transitions. [2019-09-10 08:45:13,302 INFO L78 Accepts]: Start accepts. Automaton has 306617 states and 469563 transitions. Word has length 111 [2019-09-10 08:45:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:13,303 INFO L475 AbstractCegarLoop]: Abstraction has 306617 states and 469563 transitions. [2019-09-10 08:45:13,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 306617 states and 469563 transitions. [2019-09-10 08:45:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:45:13,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:13,306 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:13,306 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash -260188509, now seen corresponding path program 1 times [2019-09-10 08:45:13,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:13,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:13,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:13,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:13,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:45:13,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:13,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:13,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:13,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:13,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:13,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:13,466 INFO L87 Difference]: Start difference. First operand 306617 states and 469563 transitions. Second operand 4 states. [2019-09-10 08:45:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:15,723 INFO L93 Difference]: Finished difference Result 593249 states and 899081 transitions. [2019-09-10 08:45:15,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:15,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 08:45:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:16,567 INFO L225 Difference]: With dead ends: 593249 [2019-09-10 08:45:16,568 INFO L226 Difference]: Without dead ends: 593249 [2019-09-10 08:45:16,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593249 states. [2019-09-10 08:45:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593249 to 593247. [2019-09-10 08:45:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593247 states. [2019-09-10 08:45:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593247 states to 593247 states and 899080 transitions. [2019-09-10 08:45:29,454 INFO L78 Accepts]: Start accepts. Automaton has 593247 states and 899080 transitions. Word has length 112 [2019-09-10 08:45:29,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:29,455 INFO L475 AbstractCegarLoop]: Abstraction has 593247 states and 899080 transitions. [2019-09-10 08:45:29,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 593247 states and 899080 transitions. [2019-09-10 08:45:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:45:29,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:29,460 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:29,460 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash -633732128, now seen corresponding path program 1 times [2019-09-10 08:45:29,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:29,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:29,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:29,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:29,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:45:29,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:29,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:29,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:29,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:29,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:29,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:29,516 INFO L87 Difference]: Start difference. First operand 593247 states and 899080 transitions. Second operand 3 states. [2019-09-10 08:45:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:42,841 INFO L93 Difference]: Finished difference Result 835076 states and 1264378 transitions. [2019-09-10 08:45:42,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:42,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 08:45:42,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:44,131 INFO L225 Difference]: With dead ends: 835076 [2019-09-10 08:45:44,131 INFO L226 Difference]: Without dead ends: 835076 [2019-09-10 08:45:44,132 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 08:45:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835076 states. [2019-09-10 08:45:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835076 to 814538. [2019-09-10 08:45:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814538 states. [2019-09-10 08:46:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814538 states to 814538 states and 1233625 transitions. [2019-09-10 08:46:04,452 INFO L78 Accepts]: Start accepts. Automaton has 814538 states and 1233625 transitions. Word has length 114 [2019-09-10 08:46:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:04,452 INFO L475 AbstractCegarLoop]: Abstraction has 814538 states and 1233625 transitions. [2019-09-10 08:46:04,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 814538 states and 1233625 transitions. [2019-09-10 08:46:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:46:04,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:04,458 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:04,458 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash -445502604, now seen corresponding path program 1 times [2019-09-10 08:46:04,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:04,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:04,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:46:04,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:04,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:04,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:04,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:04,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:04,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:04,528 INFO L87 Difference]: Start difference. First operand 814538 states and 1233625 transitions. Second operand 3 states. [2019-09-10 08:46:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:11,031 INFO L93 Difference]: Finished difference Result 1523977 states and 2282334 transitions. [2019-09-10 08:46:11,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:11,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 08:46:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:25,407 INFO L225 Difference]: With dead ends: 1523977 [2019-09-10 08:46:25,407 INFO L226 Difference]: Without dead ends: 1523977 [2019-09-10 08:46:25,408 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 08:46:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523977 states. [2019-09-10 08:46:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523977 to 1523975. [2019-09-10 08:46:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523975 states. [2019-09-10 08:47:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523975 states to 1523975 states and 2282333 transitions. [2019-09-10 08:47:03,796 INFO L78 Accepts]: Start accepts. Automaton has 1523975 states and 2282333 transitions. Word has length 114 [2019-09-10 08:47:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:03,797 INFO L475 AbstractCegarLoop]: Abstraction has 1523975 states and 2282333 transitions. [2019-09-10 08:47:03,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1523975 states and 2282333 transitions. [2019-09-10 08:47:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:47:03,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:03,807 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:03,807 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:03,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:03,807 INFO L82 PathProgramCache]: Analyzing trace with hash 767058641, now seen corresponding path program 1 times [2019-09-10 08:47:03,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:03,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:03,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:03,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:03,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:47:03,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:03,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:03,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:03,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:03,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:03,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:03,902 INFO L87 Difference]: Start difference. First operand 1523975 states and 2282333 transitions. Second operand 4 states.