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/ssh-simplified/s3_srvr_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:09:10,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:09:10,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:09:10,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:09:10,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:09:10,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:09:10,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:09:10,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:09:10,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:09:10,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:09:10,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:09:10,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:09:10,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:09:10,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:09:10,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:09:10,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:09:10,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:09:10,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:09:10,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:09:10,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:09:10,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:09:10,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:09:10,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:09:10,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:09:10,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:09:10,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:09:10,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:09:10,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:09:10,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:09:10,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:09:10,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:09:10,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:09:10,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:09:10,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:09:10,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:09:10,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:09:10,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:09:10,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:09:10,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:09:10,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:09:10,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:09:10,686 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-10-03 04:09:10,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:09:10,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:09:10,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:09:10,712 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:09:10,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:09:10,713 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:09:10,713 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:09:10,713 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:09:10,714 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:09:10,714 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:09:10,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:09:10,716 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:09:10,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:09:10,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:09:10,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:09:10,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:09:10,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:09:10,717 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:09:10,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:09:10,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:09:10,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:09:10,718 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:09:10,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:09:10,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:09:10,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:09:10,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:09:10,719 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:09:10,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:09:10,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:09:10,720 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:09:10,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:09:10,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:09:10,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:09:10,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:09:10,782 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:09:10,783 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-10-03 04:09:10,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4610e13ce/084cd16ca6fc40b1a158b2c896dcc99b/FLAG48024107b [2019-10-03 04:09:11,287 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:09:11,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-10-03 04:09:11,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4610e13ce/084cd16ca6fc40b1a158b2c896dcc99b/FLAG48024107b [2019-10-03 04:09:11,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4610e13ce/084cd16ca6fc40b1a158b2c896dcc99b [2019-10-03 04:09:11,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:09:11,630 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:09:11,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:11,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:09:11,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:09:11,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:11" (1/1) ... [2019-10-03 04:09:11,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@323621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:11, skipping insertion in model container [2019-10-03 04:09:11,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:09:11" (1/1) ... [2019-10-03 04:09:11,648 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:09:11,708 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:09:12,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:12,077 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:09:12,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:09:12,171 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:09:12,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12 WrapperNode [2019-10-03 04:09:12,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:09:12,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:09:12,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:09:12,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:09:12,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (1/1) ... [2019-10-03 04:09:12,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:09:12,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:09:12,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:09:12,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:09:12,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09: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-10-03 04:09:12,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:09:12,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:09:12,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-03 04:09:12,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:09:12,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:09:12,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 04:09:12,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:09:12,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 04:09:12,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 04:09:12,292 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-03 04:09:12,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:09:12,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:09:12,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:09:12,539 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 04:09:13,015 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-03 04:09:13,015 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-03 04:09:13,018 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:09:13,018 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 04:09:13,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:13 BoogieIcfgContainer [2019-10-03 04:09:13,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:09:13,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:09:13,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:09:13,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:09:13,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:09:11" (1/3) ... [2019-10-03 04:09:13,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2232ac45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:13, skipping insertion in model container [2019-10-03 04:09:13,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:09:12" (2/3) ... [2019-10-03 04:09:13,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2232ac45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:09:13, skipping insertion in model container [2019-10-03 04:09:13,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:09:13" (3/3) ... [2019-10-03 04:09:13,029 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-10-03 04:09:13,040 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:09:13,048 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:09:13,064 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:09:13,087 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:09:13,087 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:09:13,087 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:09:13,087 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:09:13,088 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:09:13,088 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:09:13,088 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:09:13,088 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:09:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-03 04:09:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 04:09:13,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:13,121 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,125 INFO L82 PathProgramCache]: Analyzing trace with hash 882212075, now seen corresponding path program 1 times [2019-10-03 04:09:13,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:13,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:13,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:13,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:13,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:13,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:13,447 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-03 04:09:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:13,832 INFO L93 Difference]: Finished difference Result 201 states and 337 transitions. [2019-10-03 04:09:13,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:13,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-03 04:09:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:13,848 INFO L225 Difference]: With dead ends: 201 [2019-10-03 04:09:13,848 INFO L226 Difference]: Without dead ends: 180 [2019-10-03 04:09:13,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-03 04:09:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-03 04:09:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-03 04:09:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-03 04:09:13,906 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-03 04:09:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:13,907 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-03 04:09:13,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-03 04:09:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 04:09:13,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:13,911 INFO L411 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] [2019-10-03 04:09:13,911 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1571615886, now seen corresponding path program 1 times [2019-10-03 04:09:13,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:13,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:13,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:13,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:14,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:14,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:14,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:14,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:14,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:14,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:14,098 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-03 04:09:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:14,416 INFO L93 Difference]: Finished difference Result 223 states and 365 transitions. [2019-10-03 04:09:14,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:14,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-03 04:09:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:14,420 INFO L225 Difference]: With dead ends: 223 [2019-10-03 04:09:14,421 INFO L226 Difference]: Without dead ends: 221 [2019-10-03 04:09:14,421 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-03 04:09:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-03 04:09:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-03 04:09:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-03 04:09:14,452 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-03 04:09:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:14,453 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-03 04:09:14,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-03 04:09:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 04:09:14,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:14,460 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:14,460 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:14,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1796709690, now seen corresponding path program 1 times [2019-10-03 04:09:14,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:14,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:14,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:14,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:14,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:14,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:14,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:14,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:14,594 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-03 04:09:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:14,850 INFO L93 Difference]: Finished difference Result 247 states and 413 transitions. [2019-10-03 04:09:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:14,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-03 04:09:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:14,856 INFO L225 Difference]: With dead ends: 247 [2019-10-03 04:09:14,856 INFO L226 Difference]: Without dead ends: 247 [2019-10-03 04:09:14,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-03 04:09:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-03 04:09:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-03 04:09:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-03 04:09:14,882 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-03 04:09:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:14,883 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-03 04:09:14,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-03 04:09:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 04:09:14,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:14,888 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:09:14,889 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:14,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:14,892 INFO L82 PathProgramCache]: Analyzing trace with hash 903111100, now seen corresponding path program 1 times [2019-10-03 04:09:14,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:14,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:14,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:14,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:15,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:15,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:15,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:15,015 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-03 04:09:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:15,224 INFO L93 Difference]: Finished difference Result 264 states and 438 transitions. [2019-10-03 04:09:15,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:15,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-03 04:09:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:15,228 INFO L225 Difference]: With dead ends: 264 [2019-10-03 04:09:15,228 INFO L226 Difference]: Without dead ends: 264 [2019-10-03 04:09:15,228 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-03 04:09:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-03 04:09:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-03 04:09:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-03 04:09:15,250 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-03 04:09:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:15,251 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-03 04:09:15,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-03 04:09:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 04:09:15,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:15,255 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:15,255 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:15,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -890466136, now seen corresponding path program 1 times [2019-10-03 04:09:15,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:15,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:15,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:15,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:15,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:15,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:15,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:15,358 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-03 04:09:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:15,581 INFO L93 Difference]: Finished difference Result 308 states and 515 transitions. [2019-10-03 04:09:15,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:15,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-03 04:09:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:15,583 INFO L225 Difference]: With dead ends: 308 [2019-10-03 04:09:15,584 INFO L226 Difference]: Without dead ends: 308 [2019-10-03 04:09:15,584 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-03 04:09:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-10-03 04:09:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-03 04:09:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-03 04:09:15,596 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-03 04:09:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:15,596 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-03 04:09:15,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-03 04:09:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 04:09:15,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:15,603 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:09:15,604 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:15,605 INFO L82 PathProgramCache]: Analyzing trace with hash -550567068, now seen corresponding path program 1 times [2019-10-03 04:09:15,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:15,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:15,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:15,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:15,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:15,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:15,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:15,694 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-03 04:09:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:15,882 INFO L93 Difference]: Finished difference Result 306 states and 508 transitions. [2019-10-03 04:09:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:15,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-03 04:09:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:15,885 INFO L225 Difference]: With dead ends: 306 [2019-10-03 04:09:15,885 INFO L226 Difference]: Without dead ends: 306 [2019-10-03 04:09:15,886 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-03 04:09:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-03 04:09:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-03 04:09:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-03 04:09:15,893 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-03 04:09:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:15,894 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-03 04:09:15,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-03 04:09:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 04:09:15,895 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:15,895 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:15,896 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash -80048661, now seen corresponding path program 1 times [2019-10-03 04:09:15,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:15,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:09:15,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:15,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:15,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:15,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:15,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:15,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:15,970 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-03 04:09:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,197 INFO L93 Difference]: Finished difference Result 308 states and 509 transitions. [2019-10-03 04:09:16,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:16,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-03 04:09:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,200 INFO L225 Difference]: With dead ends: 308 [2019-10-03 04:09:16,200 INFO L226 Difference]: Without dead ends: 306 [2019-10-03 04:09:16,201 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-03 04:09:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-10-03 04:09:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-03 04:09:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-03 04:09:16,212 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-03 04:09:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,212 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-03 04:09:16,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-03 04:09:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-03 04:09:16,214 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,214 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:16,215 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,215 INFO L82 PathProgramCache]: Analyzing trace with hash 597213445, now seen corresponding path program 1 times [2019-10-03 04:09:16,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 04:09:16,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:16,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:16,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:16,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:16,291 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-03 04:09:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,444 INFO L93 Difference]: Finished difference Result 311 states and 507 transitions. [2019-10-03 04:09:16,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:16,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-03 04:09:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,447 INFO L225 Difference]: With dead ends: 311 [2019-10-03 04:09:16,447 INFO L226 Difference]: Without dead ends: 311 [2019-10-03 04:09:16,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-03 04:09:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-03 04:09:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-03 04:09:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-03 04:09:16,455 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-03 04:09:16,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,456 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-03 04:09:16,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-03 04:09:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 04:09:16,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,458 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:16,458 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,458 INFO L82 PathProgramCache]: Analyzing trace with hash 301165919, now seen corresponding path program 1 times [2019-10-03 04:09:16,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:16,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:16,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:16,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:16,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:16,521 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-03 04:09:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,742 INFO L93 Difference]: Finished difference Result 342 states and 556 transitions. [2019-10-03 04:09:16,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:16,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-03 04:09:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,745 INFO L225 Difference]: With dead ends: 342 [2019-10-03 04:09:16,746 INFO L226 Difference]: Without dead ends: 342 [2019-10-03 04:09:16,746 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-03 04:09:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-03 04:09:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-03 04:09:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-03 04:09:16,756 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-03 04:09:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:16,756 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-03 04:09:16,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-03 04:09:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 04:09:16,759 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:16,759 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:16,759 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:16,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash -283935385, now seen corresponding path program 1 times [2019-10-03 04:09:16,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:16,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:16,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:16,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:16,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:16,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:16,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:16,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:16,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:16,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:16,819 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-03 04:09:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:16,994 INFO L93 Difference]: Finished difference Result 342 states and 552 transitions. [2019-10-03 04:09:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:16,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-03 04:09:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:16,998 INFO L225 Difference]: With dead ends: 342 [2019-10-03 04:09:16,998 INFO L226 Difference]: Without dead ends: 342 [2019-10-03 04:09:16,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-03 04:09:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-03 04:09:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-03 04:09:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-03 04:09:17,006 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-03 04:09:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,006 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-03 04:09:17,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-03 04:09:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 04:09:17,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,008 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:17,008 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1626624529, now seen corresponding path program 1 times [2019-10-03 04:09:17,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:17,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:17,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:17,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:17,060 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-03 04:09:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,263 INFO L93 Difference]: Finished difference Result 375 states and 605 transitions. [2019-10-03 04:09:17,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:17,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-03 04:09:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,266 INFO L225 Difference]: With dead ends: 375 [2019-10-03 04:09:17,266 INFO L226 Difference]: Without dead ends: 375 [2019-10-03 04:09:17,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-03 04:09:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-03 04:09:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-03 04:09:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-03 04:09:17,276 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-03 04:09:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,276 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-03 04:09:17,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-03 04:09:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:09:17,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,278 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:17,279 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1291287383, now seen corresponding path program 1 times [2019-10-03 04:09:17,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 04:09:17,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:17,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:17,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:17,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:17,341 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-03 04:09:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,547 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2019-10-03 04:09:17,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:17,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:09:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,551 INFO L225 Difference]: With dead ends: 375 [2019-10-03 04:09:17,551 INFO L226 Difference]: Without dead ends: 375 [2019-10-03 04:09:17,552 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-03 04:09:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-03 04:09:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-03 04:09:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-03 04:09:17,559 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-03 04:09:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,560 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-03 04:09:17,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-03 04:09:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 04:09:17,561 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,562 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-10-03 04:09:17,562 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1329985514, now seen corresponding path program 1 times [2019-10-03 04:09:17,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 04:09:17,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:17,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:17,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:17,612 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-03 04:09:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:17,798 INFO L93 Difference]: Finished difference Result 392 states and 622 transitions. [2019-10-03 04:09:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:17,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-03 04:09:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:17,801 INFO L225 Difference]: With dead ends: 392 [2019-10-03 04:09:17,801 INFO L226 Difference]: Without dead ends: 392 [2019-10-03 04:09:17,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:17,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-03 04:09:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-03 04:09:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-03 04:09:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-03 04:09:17,809 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-03 04:09:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:17,810 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-03 04:09:17,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-03 04:09:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 04:09:17,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:17,812 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-10-03 04:09:17,812 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1711185522, now seen corresponding path program 1 times [2019-10-03 04:09:17,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:17,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:17,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:17,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 04:09:17,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:17,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:17,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:17,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:17,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:17,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:17,868 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-03 04:09:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:18,052 INFO L93 Difference]: Finished difference Result 392 states and 616 transitions. [2019-10-03 04:09:18,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:18,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-03 04:09:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:18,056 INFO L225 Difference]: With dead ends: 392 [2019-10-03 04:09:18,056 INFO L226 Difference]: Without dead ends: 392 [2019-10-03 04:09:18,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-03 04:09:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-03 04:09:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-03 04:09:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-03 04:09:18,068 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-03 04:09:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:18,069 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-03 04:09:18,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-03 04:09:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-03 04:09:18,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:18,071 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:18,071 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1344904457, now seen corresponding path program 1 times [2019-10-03 04:09:18,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:18,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:18,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 04:09:18,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:18,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:18,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:18,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:18,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:18,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:18,158 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-03 04:09:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:18,198 INFO L93 Difference]: Finished difference Result 761 states and 1201 transitions. [2019-10-03 04:09:18,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:18,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-03 04:09:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:18,202 INFO L225 Difference]: With dead ends: 761 [2019-10-03 04:09:18,202 INFO L226 Difference]: Without dead ends: 761 [2019-10-03 04:09:18,205 INFO L640 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-10-03 04:09:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-03 04:09:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-03 04:09:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-03 04:09:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-03 04:09:18,218 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-03 04:09:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:18,218 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-03 04:09:18,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-03 04:09:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-03 04:09:18,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:18,221 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:18,221 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:18,221 INFO L82 PathProgramCache]: Analyzing trace with hash -773137702, now seen corresponding path program 1 times [2019-10-03 04:09:18,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 04:09:18,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:18,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:18,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:18,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:18,316 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 5 states. [2019-10-03 04:09:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:18,544 INFO L93 Difference]: Finished difference Result 845 states and 1331 transitions. [2019-10-03 04:09:18,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:18,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-10-03 04:09:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:18,550 INFO L225 Difference]: With dead ends: 845 [2019-10-03 04:09:18,551 INFO L226 Difference]: Without dead ends: 845 [2019-10-03 04:09:18,551 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-10-03 04:09:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2019-10-03 04:09:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-10-03 04:09:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1319 transitions. [2019-10-03 04:09:18,567 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1319 transitions. Word has length 127 [2019-10-03 04:09:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:18,567 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1319 transitions. [2019-10-03 04:09:18,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1319 transitions. [2019-10-03 04:09:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 04:09:18,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:18,572 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:18,572 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:18,573 INFO L82 PathProgramCache]: Analyzing trace with hash -260517251, now seen corresponding path program 1 times [2019-10-03 04:09:18,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:18,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:18,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 04:09:18,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:18,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:18,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:18,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:18,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:18,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:18,647 INFO L87 Difference]: Start difference. First operand 837 states and 1319 transitions. Second operand 5 states. [2019-10-03 04:09:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:18,838 INFO L93 Difference]: Finished difference Result 845 states and 1325 transitions. [2019-10-03 04:09:18,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:18,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-03 04:09:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:18,842 INFO L225 Difference]: With dead ends: 845 [2019-10-03 04:09:18,843 INFO L226 Difference]: Without dead ends: 841 [2019-10-03 04:09:18,843 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-10-03 04:09:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 833. [2019-10-03 04:09:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-10-03 04:09:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1307 transitions. [2019-10-03 04:09:18,865 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1307 transitions. Word has length 128 [2019-10-03 04:09:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:18,865 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1307 transitions. [2019-10-03 04:09:18,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1307 transitions. [2019-10-03 04:09:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-03 04:09:18,868 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:18,868 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-10-03 04:09:18,869 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1086305590, now seen corresponding path program 1 times [2019-10-03 04:09:18,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:18,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-03 04:09:18,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:18,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:18,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:18,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:18,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:18,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:18,928 INFO L87 Difference]: Start difference. First operand 833 states and 1307 transitions. Second operand 5 states. [2019-10-03 04:09:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:19,142 INFO L93 Difference]: Finished difference Result 909 states and 1419 transitions. [2019-10-03 04:09:19,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:19,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-03 04:09:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:19,149 INFO L225 Difference]: With dead ends: 909 [2019-10-03 04:09:19,149 INFO L226 Difference]: Without dead ends: 909 [2019-10-03 04:09:19,150 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-10-03 04:09:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 905. [2019-10-03 04:09:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-10-03 04:09:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1415 transitions. [2019-10-03 04:09:19,173 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1415 transitions. Word has length 160 [2019-10-03 04:09:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:19,173 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1415 transitions. [2019-10-03 04:09:19,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1415 transitions. [2019-10-03 04:09:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-03 04:09:19,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:19,180 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-03 04:09:19,181 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:19,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:19,181 INFO L82 PathProgramCache]: Analyzing trace with hash -643380505, now seen corresponding path program 1 times [2019-10-03 04:09:19,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:19,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:19,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-03 04:09:19,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:19,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:19,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:19,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:19,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:19,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:19,349 INFO L87 Difference]: Start difference. First operand 905 states and 1415 transitions. Second operand 5 states. [2019-10-03 04:09:19,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:19,635 INFO L93 Difference]: Finished difference Result 909 states and 1411 transitions. [2019-10-03 04:09:19,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:19,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-03 04:09:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:19,642 INFO L225 Difference]: With dead ends: 909 [2019-10-03 04:09:19,642 INFO L226 Difference]: Without dead ends: 905 [2019-10-03 04:09:19,643 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-10-03 04:09:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 901. [2019-10-03 04:09:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-03 04:09:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1401 transitions. [2019-10-03 04:09:19,674 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1401 transitions. Word has length 161 [2019-10-03 04:09:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:19,674 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1401 transitions. [2019-10-03 04:09:19,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1401 transitions. [2019-10-03 04:09:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-03 04:09:19,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:19,680 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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] [2019-10-03 04:09:19,681 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:19,681 INFO L82 PathProgramCache]: Analyzing trace with hash -306607681, now seen corresponding path program 1 times [2019-10-03 04:09:19,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-03 04:09:19,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:19,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:19,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:19,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:19,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:19,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:19,758 INFO L87 Difference]: Start difference. First operand 901 states and 1401 transitions. Second operand 5 states. [2019-10-03 04:09:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:19,949 INFO L93 Difference]: Finished difference Result 973 states and 1503 transitions. [2019-10-03 04:09:19,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:19,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-10-03 04:09:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:19,954 INFO L225 Difference]: With dead ends: 973 [2019-10-03 04:09:19,954 INFO L226 Difference]: Without dead ends: 973 [2019-10-03 04:09:19,955 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:19,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-10-03 04:09:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 969. [2019-10-03 04:09:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-10-03 04:09:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1499 transitions. [2019-10-03 04:09:19,976 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1499 transitions. Word has length 191 [2019-10-03 04:09:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:19,976 INFO L475 AbstractCegarLoop]: Abstraction has 969 states and 1499 transitions. [2019-10-03 04:09:19,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1499 transitions. [2019-10-03 04:09:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-03 04:09:19,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:19,981 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-10-03 04:09:19,981 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:19,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1259797154, now seen corresponding path program 1 times [2019-10-03 04:09:19,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:19,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:19,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:19,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-03 04:09:20,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:20,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:20,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:20,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:20,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:20,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:20,056 INFO L87 Difference]: Start difference. First operand 969 states and 1499 transitions. Second operand 5 states. [2019-10-03 04:09:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:20,250 INFO L93 Difference]: Finished difference Result 973 states and 1493 transitions. [2019-10-03 04:09:20,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:20,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-10-03 04:09:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:20,255 INFO L225 Difference]: With dead ends: 973 [2019-10-03 04:09:20,255 INFO L226 Difference]: Without dead ends: 969 [2019-10-03 04:09:20,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:20,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-10-03 04:09:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 965. [2019-10-03 04:09:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-10-03 04:09:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1483 transitions. [2019-10-03 04:09:20,275 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1483 transitions. Word has length 192 [2019-10-03 04:09:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:20,275 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1483 transitions. [2019-10-03 04:09:20,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1483 transitions. [2019-10-03 04:09:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 04:09:20,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:20,279 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:20,279 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:20,280 INFO L82 PathProgramCache]: Analyzing trace with hash 637510067, now seen corresponding path program 1 times [2019-10-03 04:09:20,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:20,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:20,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-03 04:09:20,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:20,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:20,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:20,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:20,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:20,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:20,375 INFO L87 Difference]: Start difference. First operand 965 states and 1483 transitions. Second operand 5 states. [2019-10-03 04:09:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:20,556 INFO L93 Difference]: Finished difference Result 1041 states and 1589 transitions. [2019-10-03 04:09:20,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:20,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-10-03 04:09:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:20,563 INFO L225 Difference]: With dead ends: 1041 [2019-10-03 04:09:20,563 INFO L226 Difference]: Without dead ends: 1041 [2019-10-03 04:09:20,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-03 04:09:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-10-03 04:09:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-03 04:09:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1547 transitions. [2019-10-03 04:09:20,583 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1547 transitions. Word has length 209 [2019-10-03 04:09:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:20,583 INFO L475 AbstractCegarLoop]: Abstraction has 1015 states and 1547 transitions. [2019-10-03 04:09:20,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1547 transitions. [2019-10-03 04:09:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 04:09:20,589 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:20,589 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:20,589 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:20,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1262219653, now seen corresponding path program 1 times [2019-10-03 04:09:20,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:20,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:20,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-03 04:09:20,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:20,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:20,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:20,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:20,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:20,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:20,661 INFO L87 Difference]: Start difference. First operand 1015 states and 1547 transitions. Second operand 5 states. [2019-10-03 04:09:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:20,869 INFO L93 Difference]: Finished difference Result 1041 states and 1571 transitions. [2019-10-03 04:09:20,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:20,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-10-03 04:09:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:20,875 INFO L225 Difference]: With dead ends: 1041 [2019-10-03 04:09:20,875 INFO L226 Difference]: Without dead ends: 1041 [2019-10-03 04:09:20,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-03 04:09:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-10-03 04:09:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-03 04:09:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1529 transitions. [2019-10-03 04:09:20,901 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1529 transitions. Word has length 210 [2019-10-03 04:09:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:20,901 INFO L475 AbstractCegarLoop]: Abstraction has 1015 states and 1529 transitions. [2019-10-03 04:09:20,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1529 transitions. [2019-10-03 04:09:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-03 04:09:20,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:20,905 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-10-03 04:09:20,906 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:20,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1315202570, now seen corresponding path program 1 times [2019-10-03 04:09:20,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:20,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:20,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:20,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-03 04:09:21,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:21,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:21,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:21,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:21,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:21,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:21,006 INFO L87 Difference]: Start difference. First operand 1015 states and 1529 transitions. Second operand 5 states. [2019-10-03 04:09:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:21,236 INFO L93 Difference]: Finished difference Result 1023 states and 1527 transitions. [2019-10-03 04:09:21,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:21,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-10-03 04:09:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:21,241 INFO L225 Difference]: With dead ends: 1023 [2019-10-03 04:09:21,242 INFO L226 Difference]: Without dead ends: 1023 [2019-10-03 04:09:21,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-10-03 04:09:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1015. [2019-10-03 04:09:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-03 04:09:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1517 transitions. [2019-10-03 04:09:21,260 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1517 transitions. Word has length 222 [2019-10-03 04:09:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:21,260 INFO L475 AbstractCegarLoop]: Abstraction has 1015 states and 1517 transitions. [2019-10-03 04:09:21,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1517 transitions. [2019-10-03 04:09:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-03 04:09:21,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:21,264 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2019-10-03 04:09:21,264 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:21,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:21,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1975125977, now seen corresponding path program 1 times [2019-10-03 04:09:21,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-03 04:09:21,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:21,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:21,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:21,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:21,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:21,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:21,351 INFO L87 Difference]: Start difference. First operand 1015 states and 1517 transitions. Second operand 5 states. [2019-10-03 04:09:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:21,532 INFO L93 Difference]: Finished difference Result 1023 states and 1515 transitions. [2019-10-03 04:09:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:21,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-10-03 04:09:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:21,537 INFO L225 Difference]: With dead ends: 1023 [2019-10-03 04:09:21,537 INFO L226 Difference]: Without dead ends: 1005 [2019-10-03 04:09:21,537 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-10-03 04:09:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 997. [2019-10-03 04:09:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-10-03 04:09:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1479 transitions. [2019-10-03 04:09:21,554 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1479 transitions. Word has length 223 [2019-10-03 04:09:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:21,554 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1479 transitions. [2019-10-03 04:09:21,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1479 transitions. [2019-10-03 04:09:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-03 04:09:21,558 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:21,558 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:21,558 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:21,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:21,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1054088717, now seen corresponding path program 1 times [2019-10-03 04:09:21,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-03 04:09:21,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:21,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:21,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:21,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:21,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:21,628 INFO L87 Difference]: Start difference. First operand 997 states and 1479 transitions. Second operand 5 states. [2019-10-03 04:09:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:21,791 INFO L93 Difference]: Finished difference Result 1051 states and 1543 transitions. [2019-10-03 04:09:21,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:21,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-10-03 04:09:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:21,799 INFO L225 Difference]: With dead ends: 1051 [2019-10-03 04:09:21,799 INFO L226 Difference]: Without dead ends: 1051 [2019-10-03 04:09:21,800 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-10-03 04:09:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1043. [2019-10-03 04:09:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-10-03 04:09:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1533 transitions. [2019-10-03 04:09:21,817 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1533 transitions. Word has length 230 [2019-10-03 04:09:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:21,817 INFO L475 AbstractCegarLoop]: Abstraction has 1043 states and 1533 transitions. [2019-10-03 04:09:21,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1533 transitions. [2019-10-03 04:09:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 04:09:21,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:21,821 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:21,821 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:21,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash 364858085, now seen corresponding path program 1 times [2019-10-03 04:09:21,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:21,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:21,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:21,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-03 04:09:21,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:21,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:09:21,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:21,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:09:21,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:09:21,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:21,913 INFO L87 Difference]: Start difference. First operand 1043 states and 1533 transitions. Second operand 5 states. [2019-10-03 04:09:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:22,117 INFO L93 Difference]: Finished difference Result 1051 states and 1523 transitions. [2019-10-03 04:09:22,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:22,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-10-03 04:09:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:22,122 INFO L225 Difference]: With dead ends: 1051 [2019-10-03 04:09:22,122 INFO L226 Difference]: Without dead ends: 1043 [2019-10-03 04:09:22,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-03 04:09:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-10-03 04:09:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1035. [2019-10-03 04:09:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-10-03 04:09:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1501 transitions. [2019-10-03 04:09:22,140 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1501 transitions. Word has length 231 [2019-10-03 04:09:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:22,140 INFO L475 AbstractCegarLoop]: Abstraction has 1035 states and 1501 transitions. [2019-10-03 04:09:22,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:09:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1501 transitions. [2019-10-03 04:09:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-03 04:09:22,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:22,145 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:09:22,145 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:22,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:22,145 INFO L82 PathProgramCache]: Analyzing trace with hash -567208800, now seen corresponding path program 1 times [2019-10-03 04:09:22,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:22,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:22,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-03 04:09:22,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:22,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:22,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2019-10-03 04:09:22,265 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [477], [485], [490], [492], [494], [499], [504], [510], [515], [517], [520], [588], [590], [602], [605], [606], [607], [609] [2019-10-03 04:09:22,318 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:22,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:22,583 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:23,904 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:09:23,907 INFO L272 AbstractInterpreter]: Visited 94 different actions 1935 times. Merged at 81 different actions 1633 times. Widened at 18 different actions 251 times. Performed 4413 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4413 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 175 fixpoints after 24 different actions. Largest state had 97 variables. [2019-10-03 04:09:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:23,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:09:23,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:23,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:09:23,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:23,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:09:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:24,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 04:09:24,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:09:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-03 04:09:24,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:09:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-03 04:09:24,237 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:09:24,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:09:24,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:24,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:24,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:24,241 INFO L87 Difference]: Start difference. First operand 1035 states and 1501 transitions. Second operand 3 states. [2019-10-03 04:09:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:24,281 INFO L93 Difference]: Finished difference Result 1545 states and 2241 transitions. [2019-10-03 04:09:24,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:24,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-10-03 04:09:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:24,288 INFO L225 Difference]: With dead ends: 1545 [2019-10-03 04:09:24,288 INFO L226 Difference]: Without dead ends: 1545 [2019-10-03 04:09:24,289 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 533 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:09:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2019-10-03 04:09:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2019-10-03 04:09:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2019-10-03 04:09:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2241 transitions. [2019-10-03 04:09:24,320 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2241 transitions. Word has length 267 [2019-10-03 04:09:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:24,321 INFO L475 AbstractCegarLoop]: Abstraction has 1545 states and 2241 transitions. [2019-10-03 04:09:24,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2241 transitions. [2019-10-03 04:09:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-03 04:09:24,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:24,354 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-10-03 04:09:24,354 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:24,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:24,355 INFO L82 PathProgramCache]: Analyzing trace with hash 767374129, now seen corresponding path program 1 times [2019-10-03 04:09:24,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:24,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:24,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:24,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-03 04:09:24,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:24,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:24,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:24,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:24,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:24,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:24,529 INFO L87 Difference]: Start difference. First operand 1545 states and 2241 transitions. Second operand 3 states. [2019-10-03 04:09:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:24,560 INFO L93 Difference]: Finished difference Result 2996 states and 4336 transitions. [2019-10-03 04:09:24,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:24,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-03 04:09:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:24,576 INFO L225 Difference]: With dead ends: 2996 [2019-10-03 04:09:24,576 INFO L226 Difference]: Without dead ends: 2996 [2019-10-03 04:09:24,578 INFO L640 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-10-03 04:09:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-10-03 04:09:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2994. [2019-10-03 04:09:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2019-10-03 04:09:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 4335 transitions. [2019-10-03 04:09:24,634 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 4335 transitions. Word has length 274 [2019-10-03 04:09:24,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:24,634 INFO L475 AbstractCegarLoop]: Abstraction has 2994 states and 4335 transitions. [2019-10-03 04:09:24,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 4335 transitions. [2019-10-03 04:09:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-03 04:09:24,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:24,646 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:24,646 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:24,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1658002288, now seen corresponding path program 1 times [2019-10-03 04:09:24,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:24,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:24,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:24,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:24,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-03 04:09:24,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:24,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:24,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:24,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:24,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:24,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:24,743 INFO L87 Difference]: Start difference. First operand 2994 states and 4335 transitions. Second operand 3 states. [2019-10-03 04:09:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:24,855 INFO L93 Difference]: Finished difference Result 3114 states and 4479 transitions. [2019-10-03 04:09:24,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:24,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-03 04:09:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:24,864 INFO L225 Difference]: With dead ends: 3114 [2019-10-03 04:09:24,864 INFO L226 Difference]: Without dead ends: 1997 [2019-10-03 04:09:24,865 INFO L640 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-10-03 04:09:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-10-03 04:09:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1977. [2019-10-03 04:09:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-10-03 04:09:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2813 transitions. [2019-10-03 04:09:24,893 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2813 transitions. Word has length 311 [2019-10-03 04:09:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:24,893 INFO L475 AbstractCegarLoop]: Abstraction has 1977 states and 2813 transitions. [2019-10-03 04:09:24,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2813 transitions. [2019-10-03 04:09:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-03 04:09:24,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:24,898 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:24,898 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:24,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:24,899 INFO L82 PathProgramCache]: Analyzing trace with hash -872859034, now seen corresponding path program 1 times [2019-10-03 04:09:24,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:24,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:24,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:24,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:24,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-03 04:09:25,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:25,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:25,115 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 378 with the following transitions: [2019-10-03 04:09:25,115 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [477], [485], [490], [492], [494], [499], [502], [504], [510], [515], [517], [520], [522], [527], [532], [534], [588], [590], [602], [605], [606], [607], [609] [2019-10-03 04:09:25,119 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:25,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:25,182 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:26,274 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:09:26,275 INFO L272 AbstractInterpreter]: Visited 99 different actions 2044 times. Merged at 86 different actions 1705 times. Widened at 19 different actions 262 times. Performed 4771 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4771 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 218 fixpoints after 21 different actions. Largest state had 97 variables. [2019-10-03 04:09:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:26,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:09:26,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:26,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:09:26,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:26,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:09:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:26,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:09:26,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:09:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-03 04:09:26,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:09:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-03 04:09:26,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:09:26,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:09:26,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:09:26,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:09:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:09:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:26,599 INFO L87 Difference]: Start difference. First operand 1977 states and 2813 transitions. Second operand 4 states. [2019-10-03 04:09:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:26,854 INFO L93 Difference]: Finished difference Result 2626 states and 3591 transitions. [2019-10-03 04:09:26,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:09:26,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2019-10-03 04:09:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:26,865 INFO L225 Difference]: With dead ends: 2626 [2019-10-03 04:09:26,866 INFO L226 Difference]: Without dead ends: 2582 [2019-10-03 04:09:26,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 754 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-10-03 04:09:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2019-10-03 04:09:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1954. [2019-10-03 04:09:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-10-03 04:09:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-10-03 04:09:26,897 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 377 [2019-10-03 04:09:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:26,898 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-10-03 04:09:26,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:09:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-10-03 04:09:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-10-03 04:09:26,903 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:26,904 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:09:26,904 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1790317548, now seen corresponding path program 1 times [2019-10-03 04:09:26,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:26,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:26,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:26,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:26,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-03 04:09:27,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:27,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:09:27,283 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 606 with the following transitions: [2019-10-03 04:09:27,283 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [160], [162], [167], [170], [172], [177], [180], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [442], [447], [452], [457], [460], [465], [467], [472], [474], [477], [479], [485], [490], [492], [494], [499], [502], [504], [510], [515], [517], [520], [522], [527], [532], [534], [588], [590], [602], [605], [606], [607], [609] [2019-10-03 04:09:27,301 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:09:27,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:09:27,348 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:09:28,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:09:28,486 INFO L272 AbstractInterpreter]: Visited 111 different actions 2225 times. Merged at 94 different actions 1799 times. Widened at 21 different actions 282 times. Performed 5405 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5405 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 275 fixpoints after 24 different actions. Largest state had 101 variables. [2019-10-03 04:09:28,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:28,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:09:28,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:09:28,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:09:28,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:28,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:09:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:28,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:09:28,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:09:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-03 04:09:28,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:09:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-03 04:09:29,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:09:29,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:09:29,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:09:29,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:09:29,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:09:29,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:09:29,050 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 4 states. [2019-10-03 04:09:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:29,279 INFO L93 Difference]: Finished difference Result 2874 states and 3940 transitions. [2019-10-03 04:09:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:09:29,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 605 [2019-10-03 04:09:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:29,286 INFO L225 Difference]: With dead ends: 2874 [2019-10-03 04:09:29,286 INFO L226 Difference]: Without dead ends: 2736 [2019-10-03 04:09:29,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1215 GetRequests, 1210 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-10-03 04:09:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-10-03 04:09:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1954. [2019-10-03 04:09:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-10-03 04:09:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-10-03 04:09:29,316 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 605 [2019-10-03 04:09:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:29,317 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-10-03 04:09:29,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:09:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-10-03 04:09:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-10-03 04:09:29,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:29,324 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 04:09:29,324 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:29,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:29,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1901319823, now seen corresponding path program 1 times [2019-10-03 04:09:29,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:29,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:29,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:29,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:29,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-10-03 04:09:29,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:29,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:29,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:29,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:29,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:29,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:29,606 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 3 states. [2019-10-03 04:09:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:29,758 INFO L93 Difference]: Finished difference Result 1994 states and 2726 transitions. [2019-10-03 04:09:29,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:29,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 675 [2019-10-03 04:09:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:29,763 INFO L225 Difference]: With dead ends: 1994 [2019-10-03 04:09:29,763 INFO L226 Difference]: Without dead ends: 1994 [2019-10-03 04:09:29,764 INFO L640 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-10-03 04:09:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2019-10-03 04:09:29,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1954. [2019-10-03 04:09:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-10-03 04:09:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2678 transitions. [2019-10-03 04:09:29,786 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2678 transitions. Word has length 675 [2019-10-03 04:09:29,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:29,787 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 2678 transitions. [2019-10-03 04:09:29,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2678 transitions. [2019-10-03 04:09:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-10-03 04:09:29,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:29,794 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 04:09:29,794 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:29,795 INFO L82 PathProgramCache]: Analyzing trace with hash -554544010, now seen corresponding path program 1 times [2019-10-03 04:09:29,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:29,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:29,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:29,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:29,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-10-03 04:09:30,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:30,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:30,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:30,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:30,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:30,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:30,182 INFO L87 Difference]: Start difference. First operand 1954 states and 2678 transitions. Second operand 3 states. [2019-10-03 04:09:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:30,339 INFO L93 Difference]: Finished difference Result 1986 states and 2677 transitions. [2019-10-03 04:09:30,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:30,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-10-03 04:09:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:30,345 INFO L225 Difference]: With dead ends: 1986 [2019-10-03 04:09:30,345 INFO L226 Difference]: Without dead ends: 1986 [2019-10-03 04:09:30,345 INFO L640 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-10-03 04:09:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-10-03 04:09:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1941. [2019-10-03 04:09:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-10-03 04:09:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2619 transitions. [2019-10-03 04:09:30,367 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2619 transitions. Word has length 689 [2019-10-03 04:09:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:30,367 INFO L475 AbstractCegarLoop]: Abstraction has 1941 states and 2619 transitions. [2019-10-03 04:09:30,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2619 transitions. [2019-10-03 04:09:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-10-03 04:09:30,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:30,374 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 04:09:30,374 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:30,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:30,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1850705057, now seen corresponding path program 1 times [2019-10-03 04:09:30,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:30,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:30,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:30,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:30,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-10-03 04:09:30,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:30,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:30,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:30,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:30,717 INFO L87 Difference]: Start difference. First operand 1941 states and 2619 transitions. Second operand 3 states. [2019-10-03 04:09:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:30,837 INFO L93 Difference]: Finished difference Result 2021 states and 2706 transitions. [2019-10-03 04:09:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:30,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2019-10-03 04:09:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:30,843 INFO L225 Difference]: With dead ends: 2021 [2019-10-03 04:09:30,843 INFO L226 Difference]: Without dead ends: 2003 [2019-10-03 04:09:30,843 INFO L640 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-10-03 04:09:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2019-10-03 04:09:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1983. [2019-10-03 04:09:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2019-10-03 04:09:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2664 transitions. [2019-10-03 04:09:30,863 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2664 transitions. Word has length 717 [2019-10-03 04:09:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:30,864 INFO L475 AbstractCegarLoop]: Abstraction has 1983 states and 2664 transitions. [2019-10-03 04:09:30,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2664 transitions. [2019-10-03 04:09:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-10-03 04:09:30,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:09:30,871 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 04:09:30,872 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:09:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:09:30,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1896110854, now seen corresponding path program 1 times [2019-10-03 04:09:30,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:09:30,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:30,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:09:30,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:09:30,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:09:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:09:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-10-03 04:09:31,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:09:31,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:09:31,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:09:31,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:09:31,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:09:31,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:09:31,208 INFO L87 Difference]: Start difference. First operand 1983 states and 2664 transitions. Second operand 3 states. [2019-10-03 04:09:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:09:31,334 INFO L93 Difference]: Finished difference Result 584 states and 742 transitions. [2019-10-03 04:09:31,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:09:31,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-10-03 04:09:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:09:31,337 INFO L225 Difference]: With dead ends: 584 [2019-10-03 04:09:31,337 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 04:09:31,337 INFO L640 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-10-03 04:09:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 04:09:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 04:09:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 04:09:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 04:09:31,338 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2019-10-03 04:09:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:09:31,339 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 04:09:31,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:09:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 04:09:31,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 04:09:31,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:09:31 BoogieIcfgContainer [2019-10-03 04:09:31,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:09:31,347 INFO L168 Benchmark]: Toolchain (without parser) took 19716.44 ms. Allocated memory was 132.6 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 88.1 MB in the beginning and 293.7 MB in the end (delta: -205.6 MB). Peak memory consumption was 804.7 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:31,348 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 04:09:31,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.68 ms. Allocated memory was 132.6 MB in the beginning and 200.3 MB in the end (delta: 67.6 MB). Free memory was 87.9 MB in the beginning and 173.3 MB in the end (delta: -85.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:31,350 INFO L168 Benchmark]: Boogie Preprocessor took 63.34 ms. Allocated memory is still 200.3 MB. Free memory was 173.3 MB in the beginning and 170.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:31,350 INFO L168 Benchmark]: RCFGBuilder took 783.97 ms. Allocated memory is still 200.3 MB. Free memory was 170.6 MB in the beginning and 120.2 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:31,351 INFO L168 Benchmark]: TraceAbstraction took 18323.96 ms. Allocated memory was 200.3 MB in the beginning and 1.1 GB in the end (delta: 942.7 MB). Free memory was 120.2 MB in the beginning and 293.7 MB in the end (delta: -173.4 MB). Peak memory consumption was 769.2 MB. Max. memory is 7.1 GB. [2019-10-03 04:09:31,354 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 540.68 ms. Allocated memory was 132.6 MB in the beginning and 200.3 MB in the end (delta: 67.6 MB). Free memory was 87.9 MB in the beginning and 173.3 MB in the end (delta: -85.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.34 ms. Allocated memory is still 200.3 MB. Free memory was 173.3 MB in the beginning and 170.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 783.97 ms. Allocated memory is still 200.3 MB. Free memory was 170.6 MB in the beginning and 120.2 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18323.96 ms. Allocated memory was 200.3 MB in the beginning and 1.1 GB in the end (delta: 942.7 MB). Free memory was 120.2 MB in the beginning and 293.7 MB in the end (delta: -173.4 MB). Peak memory consumption was 769.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 149 locations, 1 error locations. SAFE Result, 18.2s OverallTime, 36 OverallIterations, 25 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5781 SDtfs, 11352 SDslu, 5755 SDs, 0 SdLazy, 5231 SolverSat, 1413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2688 GetRequests, 2563 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2994occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.0s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 1703 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 9581 NumberOfCodeBlocks, 9581 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10788 ConstructedInterpolants, 0 QuantifiedInterpolants, 5485928 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2133 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 42 InterpolantComputations, 35 PerfectInterpolantSequences, 46512/46694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...