java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:25:11,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:25:11,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:25:11,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:25:11,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:25:11,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:25:11,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:25:11,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:25:11,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:25:11,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:25:11,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:25:11,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:25:11,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:25:11,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:25:11,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:25:11,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:25:11,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:25:11,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:25:11,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:25:11,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:25:11,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:25:11,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:25:11,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:25:11,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:25:11,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:25:11,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:25:11,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:25:11,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:25:11,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:25:11,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:25:11,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:25:11,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:25:11,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:25:11,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:25:11,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:25:11,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:25:11,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:25:11,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:25:11,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:25:11,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:25:11,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:25:11,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:25:11,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:25:11,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:25:11,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:25:11,151 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:25:11,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:25:11,152 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:25:11,153 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:25:11,153 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:25:11,153 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:25:11,153 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:25:11,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:25:11,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:25:11,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:25:11,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:25:11,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:25:11,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:25:11,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:25:11,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:25:11,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:25:11,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:25:11,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:25:11,156 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:25:11,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:25:11,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:25:11,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:25:11,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:25:11,157 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:25:11,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:25:11,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:25:11,158 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:25:11,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:25:11,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:25:11,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:25:11,215 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:25:11,215 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:25:11,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 07:25:11,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd598e5d/afd468b3ace5464d8bdcf4ca9d4cd3fd/FLAG9ac93deda [2019-09-10 07:25:11,850 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:25:11,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 07:25:11,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd598e5d/afd468b3ace5464d8bdcf4ca9d4cd3fd/FLAG9ac93deda [2019-09-10 07:25:12,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd598e5d/afd468b3ace5464d8bdcf4ca9d4cd3fd [2019-09-10 07:25:12,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:25:12,183 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:25:12,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:25:12,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:25:12,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:25:12,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:25:12" (1/1) ... [2019-09-10 07:25:12,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa5746d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12, skipping insertion in model container [2019-09-10 07:25:12,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:25:12" (1/1) ... [2019-09-10 07:25:12,199 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:25:12,248 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:25:12,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:25:12,681 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:25:12,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:25:12,809 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:25:12,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12 WrapperNode [2019-09-10 07:25:12,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:25:12,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:25:12,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:25:12,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:25:12,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12" (1/1) ... [2019-09-10 07:25:12,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12" (1/1) ... [2019-09-10 07:25:12,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12" (1/1) ... [2019-09-10 07:25:12,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12" (1/1) ... [2019-09-10 07:25:12,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12" (1/1) ... [2019-09-10 07:25:12,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12" (1/1) ... [2019-09-10 07:25:12,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12" (1/1) ... [2019-09-10 07:25:12,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:25:12,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:25:12,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:25:12,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:25:12,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:25:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:25:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:25:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:25:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:25:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:25:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:25:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:25:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:25:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:25:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:25:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:25:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:25:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:25:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:25:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:25:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:25:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:25:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:25:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:25:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:25:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:25:13,801 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:25:13,802 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:25:13,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:25:13 BoogieIcfgContainer [2019-09-10 07:25:13,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:25:13,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:25:13,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:25:13,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:25:13,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:25:12" (1/3) ... [2019-09-10 07:25:13,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b858f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:25:13, skipping insertion in model container [2019-09-10 07:25:13,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:12" (2/3) ... [2019-09-10 07:25:13,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b858f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:25:13, skipping insertion in model container [2019-09-10 07:25:13,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:25:13" (3/3) ... [2019-09-10 07:25:13,813 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 07:25:13,824 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:25:13,846 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:25:13,865 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:25:13,896 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:25:13,896 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:25:13,896 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:25:13,896 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:25:13,897 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:25:13,897 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:25:13,897 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:25:13,897 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:25:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2019-09-10 07:25:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:25:13,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:13,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:13,941 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:13,948 INFO L82 PathProgramCache]: Analyzing trace with hash -474732239, now seen corresponding path program 1 times [2019-09-10 07:25:13,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:14,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:14,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:14,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:14,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:14,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:14,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:14,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:14,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:14,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:14,545 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 3 states. [2019-09-10 07:25:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:14,640 INFO L93 Difference]: Finished difference Result 272 states and 441 transitions. [2019-09-10 07:25:14,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:14,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:25:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:14,668 INFO L225 Difference]: With dead ends: 272 [2019-09-10 07:25:14,668 INFO L226 Difference]: Without dead ends: 264 [2019-09-10 07:25:14,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-10 07:25:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-10 07:25:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-10 07:25:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 390 transitions. [2019-09-10 07:25:14,780 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 390 transitions. Word has length 77 [2019-09-10 07:25:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:14,781 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 390 transitions. [2019-09-10 07:25:14,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 390 transitions. [2019-09-10 07:25:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:25:14,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:14,785 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] [2019-09-10 07:25:14,786 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash -992316925, now seen corresponding path program 1 times [2019-09-10 07:25:14,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:14,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:14,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:14,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:14,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:14,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:14,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:14,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:14,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:14,966 INFO L87 Difference]: Start difference. First operand 262 states and 390 transitions. Second operand 3 states. [2019-09-10 07:25:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:15,026 INFO L93 Difference]: Finished difference Result 444 states and 678 transitions. [2019-09-10 07:25:15,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:15,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 07:25:15,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:15,032 INFO L225 Difference]: With dead ends: 444 [2019-09-10 07:25:15,032 INFO L226 Difference]: Without dead ends: 444 [2019-09-10 07:25:15,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-10 07:25:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2019-09-10 07:25:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 07:25:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 677 transitions. [2019-09-10 07:25:15,070 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 677 transitions. Word has length 78 [2019-09-10 07:25:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:15,070 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 677 transitions. [2019-09-10 07:25:15,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 677 transitions. [2019-09-10 07:25:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:25:15,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:15,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:15,075 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:15,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1011193650, now seen corresponding path program 1 times [2019-09-10 07:25:15,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:15,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:15,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:15,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:15,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:15,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:15,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:15,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:15,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:15,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:15,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:15,227 INFO L87 Difference]: Start difference. First operand 442 states and 677 transitions. Second operand 3 states. [2019-09-10 07:25:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:15,255 INFO L93 Difference]: Finished difference Result 772 states and 1198 transitions. [2019-09-10 07:25:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:15,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:25:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:15,261 INFO L225 Difference]: With dead ends: 772 [2019-09-10 07:25:15,261 INFO L226 Difference]: Without dead ends: 772 [2019-09-10 07:25:15,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:15,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-09-10 07:25:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 770. [2019-09-10 07:25:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-09-10 07:25:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1197 transitions. [2019-09-10 07:25:15,289 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1197 transitions. Word has length 79 [2019-09-10 07:25:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:15,290 INFO L475 AbstractCegarLoop]: Abstraction has 770 states and 1197 transitions. [2019-09-10 07:25:15,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1197 transitions. [2019-09-10 07:25:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:25:15,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:15,292 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 07:25:15,293 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash 373615374, now seen corresponding path program 1 times [2019-09-10 07:25:15,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:15,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:15,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:15,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:15,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:15,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:15,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:15,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:15,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:15,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:15,447 INFO L87 Difference]: Start difference. First operand 770 states and 1197 transitions. Second operand 3 states. [2019-09-10 07:25:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:15,481 INFO L93 Difference]: Finished difference Result 1364 states and 2130 transitions. [2019-09-10 07:25:15,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:15,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:25:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:15,490 INFO L225 Difference]: With dead ends: 1364 [2019-09-10 07:25:15,491 INFO L226 Difference]: Without dead ends: 1364 [2019-09-10 07:25:15,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-09-10 07:25:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1362. [2019-09-10 07:25:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-10 07:25:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2129 transitions. [2019-09-10 07:25:15,585 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2129 transitions. Word has length 80 [2019-09-10 07:25:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:15,586 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 2129 transitions. [2019-09-10 07:25:15,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2129 transitions. [2019-09-10 07:25:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:25:15,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:15,589 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 07:25:15,589 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:15,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:15,589 INFO L82 PathProgramCache]: Analyzing trace with hash 779333447, now seen corresponding path program 1 times [2019-09-10 07:25:15,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:15,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:15,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:15,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:15,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:15,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:15,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:15,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:15,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:15,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:15,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:15,697 INFO L87 Difference]: Start difference. First operand 1362 states and 2129 transitions. Second operand 3 states. [2019-09-10 07:25:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:15,746 INFO L93 Difference]: Finished difference Result 2420 states and 3778 transitions. [2019-09-10 07:25:15,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:15,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:25:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:15,762 INFO L225 Difference]: With dead ends: 2420 [2019-09-10 07:25:15,763 INFO L226 Difference]: Without dead ends: 2420 [2019-09-10 07:25:15,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:15,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-09-10 07:25:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2418. [2019-09-10 07:25:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2019-09-10 07:25:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3777 transitions. [2019-09-10 07:25:15,848 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3777 transitions. Word has length 81 [2019-09-10 07:25:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:15,848 INFO L475 AbstractCegarLoop]: Abstraction has 2418 states and 3777 transitions. [2019-09-10 07:25:15,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3777 transitions. [2019-09-10 07:25:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:25:15,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:15,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:15,851 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:15,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash -148987347, now seen corresponding path program 1 times [2019-09-10 07:25:15,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:15,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:15,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:15,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:15,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:15,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:15,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:15,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:15,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:15,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:15,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:15,957 INFO L87 Difference]: Start difference. First operand 2418 states and 3777 transitions. Second operand 3 states. [2019-09-10 07:25:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:16,012 INFO L93 Difference]: Finished difference Result 4276 states and 6642 transitions. [2019-09-10 07:25:16,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:16,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:25:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:16,037 INFO L225 Difference]: With dead ends: 4276 [2019-09-10 07:25:16,037 INFO L226 Difference]: Without dead ends: 4276 [2019-09-10 07:25:16,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-09-10 07:25:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4274. [2019-09-10 07:25:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2019-09-10 07:25:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 6641 transitions. [2019-09-10 07:25:16,156 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 6641 transitions. Word has length 82 [2019-09-10 07:25:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:16,157 INFO L475 AbstractCegarLoop]: Abstraction has 4274 states and 6641 transitions. [2019-09-10 07:25:16,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 6641 transitions. [2019-09-10 07:25:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:25:16,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:16,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:16,159 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:16,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:16,159 INFO L82 PathProgramCache]: Analyzing trace with hash 328210800, now seen corresponding path program 1 times [2019-09-10 07:25:16,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:16,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:16,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:16,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:16,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:25:16,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:16,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:25:16,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:25:16,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:25:16,512 INFO L87 Difference]: Start difference. First operand 4274 states and 6641 transitions. Second operand 8 states. [2019-09-10 07:25:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:16,908 INFO L93 Difference]: Finished difference Result 21564 states and 33206 transitions. [2019-09-10 07:25:16,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:25:16,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-10 07:25:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:17,008 INFO L225 Difference]: With dead ends: 21564 [2019-09-10 07:25:17,008 INFO L226 Difference]: Without dead ends: 21564 [2019-09-10 07:25:17,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:25:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21564 states. [2019-09-10 07:25:17,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21564 to 21554. [2019-09-10 07:25:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21554 states. [2019-09-10 07:25:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21554 states to 21554 states and 33201 transitions. [2019-09-10 07:25:17,744 INFO L78 Accepts]: Start accepts. Automaton has 21554 states and 33201 transitions. Word has length 83 [2019-09-10 07:25:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:17,745 INFO L475 AbstractCegarLoop]: Abstraction has 21554 states and 33201 transitions. [2019-09-10 07:25:17,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:25:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21554 states and 33201 transitions. [2019-09-10 07:25:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:25:17,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:17,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:17,747 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:17,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:17,748 INFO L82 PathProgramCache]: Analyzing trace with hash -513165031, now seen corresponding path program 1 times [2019-09-10 07:25:17,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:17,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:17,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:17,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:17,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:17,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:17,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:17,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:17,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:17,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:17,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:17,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:17,872 INFO L87 Difference]: Start difference. First operand 21554 states and 33201 transitions. Second operand 5 states. [2019-09-10 07:25:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:18,464 INFO L93 Difference]: Finished difference Result 39956 states and 61266 transitions. [2019-09-10 07:25:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:18,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:25:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:18,556 INFO L225 Difference]: With dead ends: 39956 [2019-09-10 07:25:18,557 INFO L226 Difference]: Without dead ends: 39956 [2019-09-10 07:25:18,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39956 states. [2019-09-10 07:25:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39956 to 39954. [2019-09-10 07:25:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39954 states. [2019-09-10 07:25:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39954 states to 39954 states and 61265 transitions. [2019-09-10 07:25:20,156 INFO L78 Accepts]: Start accepts. Automaton has 39954 states and 61265 transitions. Word has length 85 [2019-09-10 07:25:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:20,156 INFO L475 AbstractCegarLoop]: Abstraction has 39954 states and 61265 transitions. [2019-09-10 07:25:20,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 39954 states and 61265 transitions. [2019-09-10 07:25:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:25:20,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:20,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:20,159 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash -670112898, now seen corresponding path program 1 times [2019-09-10 07:25:20,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:20,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:20,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:20,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:20,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:20,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:20,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:25:20,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:20,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:25:20,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:25:20,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:25:20,385 INFO L87 Difference]: Start difference. First operand 39954 states and 61265 transitions. Second operand 8 states. [2019-09-10 07:25:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:21,398 INFO L93 Difference]: Finished difference Result 194110 states and 296759 transitions. [2019-09-10 07:25:21,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:25:21,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-09-10 07:25:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:23,520 INFO L225 Difference]: With dead ends: 194110 [2019-09-10 07:25:23,520 INFO L226 Difference]: Without dead ends: 194110 [2019-09-10 07:25:23,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:25:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194110 states. [2019-09-10 07:25:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194110 to 79858. [2019-09-10 07:25:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79858 states. [2019-09-10 07:25:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79858 states to 79858 states and 121073 transitions. [2019-09-10 07:25:25,657 INFO L78 Accepts]: Start accepts. Automaton has 79858 states and 121073 transitions. Word has length 85 [2019-09-10 07:25:25,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:25,657 INFO L475 AbstractCegarLoop]: Abstraction has 79858 states and 121073 transitions. [2019-09-10 07:25:25,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:25:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 79858 states and 121073 transitions. [2019-09-10 07:25:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:25:25,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:25,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:25,659 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:25,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:25,660 INFO L82 PathProgramCache]: Analyzing trace with hash 682803964, now seen corresponding path program 1 times [2019-09-10 07:25:25,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:25,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:25,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:25,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:25,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:25,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:25,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:25,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:25,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:25,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:25,785 INFO L87 Difference]: Start difference. First operand 79858 states and 121073 transitions. Second operand 5 states. [2019-09-10 07:25:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:27,713 INFO L93 Difference]: Finished difference Result 162482 states and 243505 transitions. [2019-09-10 07:25:27,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:25:27,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:25:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:28,012 INFO L225 Difference]: With dead ends: 162482 [2019-09-10 07:25:28,012 INFO L226 Difference]: Without dead ends: 162482 [2019-09-10 07:25:28,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:25:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162482 states. [2019-09-10 07:25:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162482 to 82674. [2019-09-10 07:25:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82674 states. [2019-09-10 07:25:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82674 states to 82674 states and 123889 transitions. [2019-09-10 07:25:29,551 INFO L78 Accepts]: Start accepts. Automaton has 82674 states and 123889 transitions. Word has length 86 [2019-09-10 07:25:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:29,551 INFO L475 AbstractCegarLoop]: Abstraction has 82674 states and 123889 transitions. [2019-09-10 07:25:29,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 82674 states and 123889 transitions. [2019-09-10 07:25:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:25:29,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:29,552 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:29,553 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:29,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash -298293779, now seen corresponding path program 1 times [2019-09-10 07:25:29,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:29,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:29,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:29,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:29,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:29,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:29,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:29,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:29,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:29,639 INFO L87 Difference]: Start difference. First operand 82674 states and 123889 transitions. Second operand 3 states. [2019-09-10 07:25:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:30,333 INFO L93 Difference]: Finished difference Result 103574 states and 154340 transitions. [2019-09-10 07:25:30,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:30,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 07:25:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:30,489 INFO L225 Difference]: With dead ends: 103574 [2019-09-10 07:25:30,489 INFO L226 Difference]: Without dead ends: 103574 [2019-09-10 07:25:30,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103574 states. [2019-09-10 07:25:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103574 to 103572. [2019-09-10 07:25:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103572 states. [2019-09-10 07:25:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103572 states to 103572 states and 154339 transitions. [2019-09-10 07:25:33,225 INFO L78 Accepts]: Start accepts. Automaton has 103572 states and 154339 transitions. Word has length 87 [2019-09-10 07:25:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:33,226 INFO L475 AbstractCegarLoop]: Abstraction has 103572 states and 154339 transitions. [2019-09-10 07:25:33,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 103572 states and 154339 transitions. [2019-09-10 07:25:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:25:33,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:33,265 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:33,265 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:33,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:33,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1662270977, now seen corresponding path program 1 times [2019-09-10 07:25:33,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:33,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:33,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:33,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:25:33,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:25:33,535 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 07:25:33,537 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [144], [146], [149], [160], [162], [165], [176], [178], [181], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [237], [238], [240], [242], [247], [260], [262], [275], [283], [302], [313], [315], [328], [336], [355], [366], [368], [381], [389], [408], [419], [421], [434], [442], [461], [472], [474], [487], [495], [514], [525], [527], [530], [533], [536], [538], [540], [613], [614], [618], [619], [620] [2019-09-10 07:25:33,586 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:25:33,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:25:33,732 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:25:34,451 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:25:34,454 INFO L272 AbstractInterpreter]: Visited 107 different actions 710 times. Merged at 59 different actions 516 times. Widened at 21 different actions 81 times. Performed 2478 root evaluator evaluations with a maximum evaluation depth of 8. Performed 2478 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 73 fixpoints after 19 different actions. Largest state had 169 variables. [2019-09-10 07:25:34,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:34,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:25:34,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:25:34,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:25:34,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:34,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:25:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:34,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 07:25:34,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:25:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:25:34,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:25:34,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:25:34,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:25:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-10 07:25:34,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:25:34,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 4] total 15 [2019-09-10 07:25:34,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:25:34,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:25:34,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:25:34,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:25:34,896 INFO L87 Difference]: Start difference. First operand 103572 states and 154339 transitions. Second operand 13 states. [2019-09-10 07:25:36,503 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-09-10 07:25:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:57,462 INFO L93 Difference]: Finished difference Result 1352760 states and 1981862 transitions. [2019-09-10 07:25:57,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-10 07:25:57,463 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2019-09-10 07:25:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:00,009 INFO L225 Difference]: With dead ends: 1352760 [2019-09-10 07:26:00,009 INFO L226 Difference]: Without dead ends: 1352760 [2019-09-10 07:26:00,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5586 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2698, Invalid=10874, Unknown=0, NotChecked=0, Total=13572 [2019-09-10 07:26:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352760 states. [2019-09-10 07:26:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352760 to 312676. [2019-09-10 07:26:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312676 states. [2019-09-10 07:26:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312676 states to 312676 states and 459459 transitions. [2019-09-10 07:26:17,557 INFO L78 Accepts]: Start accepts. Automaton has 312676 states and 459459 transitions. Word has length 116 [2019-09-10 07:26:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:17,558 INFO L475 AbstractCegarLoop]: Abstraction has 312676 states and 459459 transitions. [2019-09-10 07:26:17,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:26:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 312676 states and 459459 transitions. [2019-09-10 07:26:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:26:17,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:17,612 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:17,612 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:17,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:17,612 INFO L82 PathProgramCache]: Analyzing trace with hash 482487770, now seen corresponding path program 1 times [2019-09-10 07:26:17,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:17,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:17,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:17,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:17,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:17,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:17,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:17,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:17,717 INFO L87 Difference]: Start difference. First operand 312676 states and 459459 transitions. Second operand 3 states. [2019-09-10 07:26:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:19,169 INFO L93 Difference]: Finished difference Result 536292 states and 780790 transitions. [2019-09-10 07:26:19,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:19,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:26:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:20,017 INFO L225 Difference]: With dead ends: 536292 [2019-09-10 07:26:20,017 INFO L226 Difference]: Without dead ends: 536292 [2019-09-10 07:26:20,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536292 states. [2019-09-10 07:26:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536292 to 525954. [2019-09-10 07:26:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525954 states. [2019-09-10 07:26:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525954 states to 525954 states and 766749 transitions. [2019-09-10 07:26:33,133 INFO L78 Accepts]: Start accepts. Automaton has 525954 states and 766749 transitions. Word has length 117 [2019-09-10 07:26:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:33,133 INFO L475 AbstractCegarLoop]: Abstraction has 525954 states and 766749 transitions. [2019-09-10 07:26:33,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 525954 states and 766749 transitions. [2019-09-10 07:26:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:26:33,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:33,182 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:33,182 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:33,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:33,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1877792189, now seen corresponding path program 1 times [2019-09-10 07:26:33,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:33,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:33,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:33,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:33,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:33,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:33,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:33,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:33,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:33,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:33,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:33,272 INFO L87 Difference]: Start difference. First operand 525954 states and 766749 transitions. Second operand 3 states. [2019-09-10 07:26:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:43,282 INFO L93 Difference]: Finished difference Result 759108 states and 1102590 transitions. [2019-09-10 07:26:43,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:43,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:26:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:44,492 INFO L225 Difference]: With dead ends: 759108 [2019-09-10 07:26:44,492 INFO L226 Difference]: Without dead ends: 759108 [2019-09-10 07:26:44,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759108 states. [2019-09-10 07:26:59,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759108 to 663202. [2019-09-10 07:26:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663202 states. [2019-09-10 07:27:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663202 states to 663202 states and 963317 transitions. [2019-09-10 07:27:02,967 INFO L78 Accepts]: Start accepts. Automaton has 663202 states and 963317 transitions. Word has length 117 [2019-09-10 07:27:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:02,968 INFO L475 AbstractCegarLoop]: Abstraction has 663202 states and 963317 transitions. [2019-09-10 07:27:02,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:27:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 663202 states and 963317 transitions. [2019-09-10 07:27:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:27:03,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:03,046 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:03,046 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:03,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1892887198, now seen corresponding path program 1 times [2019-09-10 07:27:03,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:03,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:03,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:03,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:03,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:03,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:27:03,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:27:03,182 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2019-09-10 07:27:03,183 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [130], [133], [144], [146], [149], [152], [155], [160], [162], [165], [176], [178], [181], [192], [194], [197], [208], [210], [213], [224], [226], [229], [232], [234], [237], [238], [240], [249], [260], [262], [275], [283], [302], [313], [315], [328], [336], [355], [366], [368], [381], [389], [408], [419], [421], [434], [442], [461], [463], [466], [474], [477], [480], [483], [485], [487], [525], [527], [540], [548], [567], [613], [614], [618], [619], [620] [2019-09-10 07:27:03,195 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:27:03,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:27:03,243 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:27:03,624 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:27:03,625 INFO L272 AbstractInterpreter]: Visited 104 different actions 539 times. Merged at 53 different actions 370 times. Widened at 16 different actions 42 times. Performed 1880 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1880 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 45 fixpoints after 12 different actions. Largest state had 169 variables. [2019-09-10 07:27:03,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:03,625 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:27:04,066 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 80.51% of their original sizes. [2019-09-10 07:27:04,066 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:27:16,318 INFO L420 sIntCurrentIteration]: We unified 116 AI predicates to 116 [2019-09-10 07:27:16,318 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:27:16,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:27:16,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [61] imperfect sequences [7] total 66 [2019-09-10 07:27:16,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:16,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 07:27:16,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 07:27:16,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=3260, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 07:27:16,323 INFO L87 Difference]: Start difference. First operand 663202 states and 963317 transitions. Second operand 61 states. [2019-09-10 07:30:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:24,535 INFO L93 Difference]: Finished difference Result 1511985 states and 2137621 transitions. [2019-09-10 07:30:24,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 695 states. [2019-09-10 07:30:24,535 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 117 [2019-09-10 07:30:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:26,503 INFO L225 Difference]: With dead ends: 1511985 [2019-09-10 07:30:26,503 INFO L226 Difference]: Without dead ends: 1511985 [2019-09-10 07:30:26,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 725 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232700 ImplicationChecksByTransitivity, 74.6s TimeCoverageRelationStatistics Valid=51449, Invalid=476353, Unknown=0, NotChecked=0, Total=527802 [2019-09-10 07:30:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511985 states. [2019-09-10 07:31:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511985 to 866345. [2019-09-10 07:31:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866345 states. [2019-09-10 07:31:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866345 states to 866345 states and 1240517 transitions. [2019-09-10 07:31:17,038 INFO L78 Accepts]: Start accepts. Automaton has 866345 states and 1240517 transitions. Word has length 117 [2019-09-10 07:31:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:17,039 INFO L475 AbstractCegarLoop]: Abstraction has 866345 states and 1240517 transitions. [2019-09-10 07:31:17,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 07:31:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 866345 states and 1240517 transitions. [2019-09-10 07:31:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:31:17,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:17,132 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:17,133 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:17,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1287174569, now seen corresponding path program 1 times [2019-09-10 07:31:17,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:17,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:17,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:17,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:17,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:17,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:31:17,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:31:17,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:31:17,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:31:17,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:31:17,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:31:17,212 INFO L87 Difference]: Start difference. First operand 866345 states and 1240517 transitions. Second operand 3 states. [2019-09-10 07:31:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:23,443 INFO L93 Difference]: Finished difference Result 1358210 states and 1927383 transitions. [2019-09-10 07:31:23,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:31:23,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:31:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:39,147 INFO L225 Difference]: With dead ends: 1358210 [2019-09-10 07:31:39,147 INFO L226 Difference]: Without dead ends: 1358210 [2019-09-10 07:31:39,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:31:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358210 states. [2019-09-10 07:32:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358210 to 1323554. [2019-09-10 07:32:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323554 states. [2019-09-10 07:32:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323554 states to 1323554 states and 1881724 transitions. [2019-09-10 07:32:21,862 INFO L78 Accepts]: Start accepts. Automaton has 1323554 states and 1881724 transitions. Word has length 117 [2019-09-10 07:32:21,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:32:21,862 INFO L475 AbstractCegarLoop]: Abstraction has 1323554 states and 1881724 transitions. [2019-09-10 07:32:21,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:32:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1323554 states and 1881724 transitions. [2019-09-10 07:32:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:32:24,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:32:24,252 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:32:24,253 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:32:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:32:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1934399398, now seen corresponding path program 1 times [2019-09-10 07:32:24,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:32:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:24,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:32:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:32:24,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:32:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:32:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:32:24,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:32:24,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:32:24,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:32:24,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:32:24,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:32:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:32:24,330 INFO L87 Difference]: Start difference. First operand 1323554 states and 1881724 transitions. Second operand 3 states. [2019-09-10 07:32:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:32:39,418 INFO L93 Difference]: Finished difference Result 2013361 states and 2832701 transitions. [2019-09-10 07:32:39,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:32:39,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:32:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:32:43,378 INFO L225 Difference]: With dead ends: 2013361 [2019-09-10 07:32:43,379 INFO L226 Difference]: Without dead ends: 2013361 [2019-09-10 07:32:43,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:32:44,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013361 states.